Generic Algorithms is a formal method in computer science that specifies algorithmic logic independent of specific data types, distinguished by its ability to operate uniformly across diverse types through explicit parameterization and constraints.
173
Publications
10.2K
Citations
420
Authors
220
Institutions
Publications per year
2017–2026
29
Parents
Publications
173
Robust clustering methods: a unified view
Rajesh N. Davé, Raghu Krishnapuram · IEEE Transactions on Fuzzy Systems · 1997 · 710 citations
A non-line-of-sight error mitigation algorithm in location estimation
Pi-Chun Chen · 2003 · 591 citations
Computing, Geoinformatics, Geodesy +14
A survey on Mesh Segmentation Techniques
Ariel Shamir · Computer Graphics Forum · 2008 · 588 citations
Alexander A. Stepanov, Meng Lee · 1998 · 409 citations
1–5 of 173
Authors
420
- AL
11
h-index
- JG
5
h-index
- DG
5
h-index
- JJ
5
h-index
- JW
4
h-index
1–5 of 420
Institutions
220
Indiana University Bloomington
Bloomington, United States
9 h-index
18 publications
736 citations
Centre National de la Recherche Scientifique
Paris, France
6 h-index
7 publications
255 citations
University of California San Diego
San Diego, United States
4 h-index
8 publications
322 citations
Reichman University
Herzliya, Israel
4 h-index
4 publications
772 citations
Texas A&M University
College Station, United States
4 h-index
8 publications
233 citations
Microsoft (United States)
Redmond, United States
4 h-index
5 publications
589 citations
KU Leuven
Leuven, Belgium
3 h-index
7 publications
289 citations
Delft University of Technology
Delft, The Netherlands
3 h-index
5 publications
254 citations
1–8 of 220
Venues
- ACM SIGPLAN Notices
7 publications · 248 citations
7
h-index
- Software Practice and Experience
6 publications · 221 citations
6
h-index
- IEEE Transactions on Software Engineering
TSE · 3 publications · 58 citations
3
h-index
- arXiv (Cornell University)
Repository · 3 publications · 95 citations
3
h-index
- AIChE Journal
2 publications · 62 citations
2
h-index
1–5