External Memory Intersection Algorithms is an algorithmic framework designed to compute the intersection of large datasets stored in external memory, distinguished by its optimization for minimizing input/output operations between internal and external storage during set-intersection computations.
9
Publications
212
Citations
17
Authors
9
Institutions
Publications per year
2017–2026
2
Publications
9
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
David Eppstein, Michael T. Goodrich, Michael Mitzenmacher et al. · 2017 · 23 citations · Full text
1–5 of 9
Authors
17
- LA
3
h-index
- YC
2
h-index
- JS
2
h-index
- AC
2
h-index
- DE
2
h-index
1–5 of 17
Institutions
9
Aarhus University
Aarhus, Denmark
2 h-index
2 publications
79 citations
Texas A&M University
College Station, United States
2 h-index
6 publications
72 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
10 publications
270 citations
Brown University
Providence, United States
1 h-index
1 publications
45 citations
University of California, Irvine
Irvine, United States
1 h-index
3 publications
69 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
2 publications
44 citations
Duke University
Durham, United States
1 h-index
1 publications
45 citations
Harvard University Press
Cambridge, United States
1 h-index
1 publications
23 citations
1–8 of 9
Venues
- BRICS Report Series
2 publications · 55 citations
2
h-index
- CINECA IRIS Institutial research information system (University of Pisa)
Repository · 1 publications · 35 citations
1
h-index
- Algorithmica
1 publications · 34 citations
1
h-index
- International Journal of Computational Geometry & Applications
IJCGA · 1 publications · 19 citations
1
h-index
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 1 publications · 11 citations
1
h-index
1–5