Adaptive Sorting
Adaptive Sorting is a sorting algorithm that belongs to the class of comparison-based sorting methods and is distinguished by its ability to exploit existing order in the input data to reduce the number of comparisons and time complexity for nearly-sorted sequences.
44
Publications
1.8K
Citations
117
Authors
69
Institutions
Publications per year
2017–2026
12
Parents
44
Daniel Holland-Moritz, Michael K. Wismer, Benjamin F. Mann et al. · Angewandte Chemie International Edition · 2019 · 167 citations · Full text
Adaptive sorted neighborhood methods for efficient record linkage
Yan Su, Dongwon Lee, Min‐Yen Kan et al. · 2007 · 115 citations
Amr Elmasry, Claus Jensen, Jyrki Katajainen · ACM Transactions on Algorithms · 2008 · 78 citations
1–5 of 44
117
6
h-index
4
h-index
2
h-index
Merck & Co., Inc., Rahway, NJ, USA (United States), United States
2 publications · 186 citations
2
h-index
2
h-index
1–5 of 117
69

Lund University
Lund, Sweden
5 h-index
7 publications
147 citations

The University of Melbourne
Melbourne, Australia
3 h-index
5 publications
112 citations
Janssen (United States)
Hopewell, United States
2 h-index
2 publications
186 citations
University of Bonn
Bonn, Germany
2 h-index
2 publications
144 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
6 publications
294 citations
Springhouse
Boston, United States
2 h-index
2 publications
186 citations
Analytical Engineering (United States)
Columbus, United States
2 h-index
2 publications
186 citations
University of Chile
Santiago, Chile
2 h-index
4 publications
134 citations
1–8 of 69
2 publications · 37 citations
2
h-index
2 publications · 67 citations
2
h-index
2 publications · 147 citations
2
h-index
2 publications · 39 citations
2
h-index
1 publications · 34 citations
1
h-index
1–5