Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
optimal time complexity
Description:
The best achievable asymptotic running time for solving a computational problem under a specified model of computation.
Related topics:
Computational Geometry and Mesh Generation (19%),
Parallel Computing and Optimization Techniques (16%),
Complexity and Algorithms in Graphs (15%),
Algorithms and Data Compression (13%)
OpenAlex ID:
keywords/optimal-time-complexity
An optimal convex hull algorithm in any fixed dimension
1993
·
Bernard Chazelle
·
Discrete & Computational Geometry
·
448
PDF
Constrained Delaunay triangulations
1987
·
L. P. Chew
·
Annual Symposium on Computational Geometry (SoCG)
·
327
An optimal algorithm for constructing the weighted voronoi diagram in the plane
1984
·
F. Aurenhammer
, H. Edelsbrunner
·
Pattern Recognition
·
325
Two-Dimensional Voronoi Diagrams in the L p -Metric
1980
·
D. T. Lee
·
Journal of the ACM
·
242
PDF
Optimal implementations of UPGMA and other common clustering algorithms
2007
·
Ilan Gronau
, Shlomo Moran
·
Information Processing Letters
·
216
Communication-Efficient Parallel Sorting
1999
·
Michael T. Goodrich
·
SIAM Journal on Computing
·
160
Boosting textual compression in optimal linear time
2005
·
Paolo Ferragina
, Raffaele Giancarlo
, et al.
·
Journal of the ACM
·
141
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
1989
·
Gianfranco Bilardi
, Alexandru Nicolau
·
SIAM Journal on Computing
·
137
GPU-ABiSort: optimal parallel sorting on stream architectures
2006
·
Andreas Greb
, Gabriel Zachmann
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
117
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
2014
·
Mihai Patrascu
, Mikkel Thorup
·
Annual Symposium on Foundations of Computer Science
·
112
An Efficient Algorithm for Generating Necklaces with Fixed Density
1999
·
Frank Ruskey
, Joe Sawada
·
SIAM Journal on Computing
·
88
An optimally efficient selection algorithm
1988
·
Richard John Cole
·
Information Processing Letters
·
85
Provably good mesh generation
2002
·
M. Bern
, D. Eppstein
, et al.
·
Annual Symposium on Foundations of Computer Science
·
82
A distributed system-level diagnosis algorithm for arbitrary network topologies
1995
·
S. Rangarajan
, A.T. Dahbura
, et al.
·
IEEE Transactions on Computers
·
80
Top-k document retrieval in optimal time and linear space
·
Gonzalo Navarro
, Yakov Nekrich
·
80
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
1990
·
Dany Breslauer
, Zvi Galil
·
SIAM Journal on Computing
·
79
Optimal Isosurface Extraction from Irregular Volume Data
·
P. Cignoni
, C. Montani
, et al.
·
68
An optimal randomized parallel algorithm for finding connected components in a graph
1986
·
Hillel Gazit
·
Annual Symposium on Foundations of Computer Science
·
66
Voronoi diagrams in the moscow metric: Extended abstract
1989
·
Rolf Klein
·
Lecture notes in computer science
·
63
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
2002
·
P.B. Callahan
·
Annual Symposium on Foundations of Computer Science
·
54
GPU-ABiSort: optimal parallel sorting on stream architectures
2006
·
A. Greb
, G. Zachmann
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
53
Plane-sweep solves the closest pair problem elegantly
1988
·
Klaus Hinrichs
, Jurg Nievergelt
, et al.
·
Information Processing Letters
·
48
Finding the convex hull of a sorted point set in parallel
1987
·
Michael T. Goodrich
·
Information Processing Letters
·
48
An optimal parallel algorithm for solving the maximal elements problem in the plane
1988
·
Ivan Stojmenović
, Masahiro Miyakawa
·
Parallel Computing
·
46
Optimal isosurface extraction from irregular volume data
2002
·
P. Cignoni
, C. Montani
, et al.
·
45
Show more works
View as search
Works count:
317
Citation count:
5,141
Year
Topic
Type