Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
comparison-based algorithms
Description:
Algorithms that determine the order or relationships of data items by comparing pairs of items.
Primary topic:
Complexity and Algorithms in Graphs (45%)
Related topics:
Complexity and Algorithms in Graphs (45%),
Algorithms and Data Compression (26%)
OpenAlex ID:
keywords/comparison-based-algorithms
A Compendium of Continuous Lattices
1980
·
Gerhard Gierz
, Karl Heinrich Hofmann
, et al.
·
Springer eBooks
·
1,491
On Finding the Maxima of a Set of Vectors
1975
·
H. T. Kung
, F. Luccio
, et al.
·
Journal of the ACM
·
1,073
PDF
Finding repeated elements
1982
·
J. Misra
, David Gries
·
Science of Computer Programming
·
636
A randomized linear-time algorithm to find minimum spanning trees
1995
·
David R. Karger
, Philip N. Klein
, et al.
·
Journal of the ACM
·
471
PDF
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
1994
·
Michael L. Fredman
, Dan E. Willard
·
Journal of Computer and System Sciences
·
455
Parallelism in Comparison Problems
1975
·
Leslie G. Valiant
·
SIAM Journal on Computing
·
439
A minimum spanning tree algorithm with inverse-Ackermann type complexity
2000
·
Bernard Chazelle
·
Journal of the ACM
·
408
PDF
MJRTY—A Fast Majority Vote Algorithm
1991
·
Robert S. Boyer
, J. Strother Moore
·
Automated reasoning series
·
301
An O(n log n) algorithm for finding all repetitions in a string
1984
·
Michael G Main
, Richard J Lorentz
·
Journal of Algorithms
·
300
New Bounds on the Complexity of the Shortest Path Problem
1976
·
Michael L. Fredman
·
SIAM Journal on Computing
·
290
On computing the length of longest increasing subsequences
1975
·
Michael L. Fredman
·
Discrete Mathematics
·
281
PDF
Efficient dilation, erosion, opening, and closing algorithms
2002
·
J.Y. Gil
, R. Kimmel
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
216
How good is the information theory bound in sorting?
1976
·
Michael L. Fredman
·
Theoretical Computer Science
·
212
PDF
Electing a leader in a synchronous ring
1987
·
Greg N. Frederickson
, Nancy A. Lynch
·
Journal of the ACM
·
204
PDF
Finding the median
1976
·
A. Schönhage
, M. Paterson
, et al.
·
Journal of Computer and System Sciences
·
200
A New Approach to Planar Point Location
1981
·
Franco P. Preparata
·
SIAM Journal on Computing
·
127
PDF
On Parallel Searching
1985
·
Marc Snir
·
SIAM Journal on Computing
·
125
A Fast Merging Algorithm
1979
·
Mark R. Brown
, Robert E. Tarjan
·
Journal of the ACM
·
120
PDF
On the strength of comparisons in property testing
2003
·
Eldar Fischer
·
Information and Computation
·
112
Heaps on Heaps
1986
·
Gaston H. Gonnet
, J. Ian Munro
·
SIAM Journal on Computing
·
103
Selecting the Median
1999
·
Dorit Dor
, Uri Zwick
·
SIAM Journal on Computing
·
97
Fast linear expected-time alogorithms for computing maxima and convex hulls
1990
·
Jon Bentley
, Kenneth L. Clarkson
, et al.
·
Symposium on Discrete Algorithms
·
94
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
2006
·
Lemire, Daniel
·
arXiv (Cornell University)
·
92
PDF
A simpler minimum spanning tree verification algorithm
1997
·
V. King
·
Algorithmica
·
90
Selection from read-only memory and sorting with minimum data movement
1996
·
J.Ian Munro
, Venkatesh Raman
·
Theoretical Computer Science
·
89
PDF
Show more works
View as search
Works count:
380
Citation count:
12,190
Year
Topic
Type