Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
time-optimal algorithms
Description:
Algorithms that minimize execution time under a specified computational model or problem setting, including sequential and parallel computing.
Related topics:
Computational Geometry and Mesh Generation (15%),
Complexity and Algorithms in Graphs (13%),
Parallel Computing and Optimization Techniques (11%),
Optimization and Search Problems (9%),
Distributed systems and fault tolerance (9%)
OpenAlex ID:
keywords/time-optimal-algorithms
Universal constructions for multi-object operations
1995
·
James H. Anderson
, Mark Moir
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
132
Optimal-time incremental semantic analysis for syntax-directed editors
1982
·
Thomas Reps
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
127
PDF
Time-optimal leader election in general networks
1990
·
David Peleg
·
Journal of Parallel and Distributed Computing
·
113
A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks
1999
·
G. Mohan
, C.S.R. Murthy
·
Journal of Lightwave Technology
·
94
Time optimal self-stabilizing spanning tree algorithms
1993
·
Sudhanshu Aggarwal
, Shay Kutten
·
Lecture notes in computer science
·
90
Space and time optimal parallel sequence alignments
2004
·
S. Rajko
, S. Aluru
·
IEEE Transactions on Parallel and Distributed Systems
·
84
Time-optimal solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position
1982
·
Helge Szwerinski
·
Theoretical Computer Science
·
80
PDF
Time-optimal message-efficient work performance in the presence of faults
1994
·
Roberto De Prisco
, Alain Mayer
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
72
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
2022
·
Soheil Behnezhad
·
Annual Symposium on Foundations of Computer Science
·
56
PDF
A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections.
1994
·
Timothy M. Chan
·
Canadian Conference on Computational Geometry
·
49
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
2010
·
Tomoko Izumi
, Taisuke Izumi
, et al.
·
Lecture notes in computer science
·
48
PDF
Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer
1997
·
Yu-Hua Lee
, Shi-Jinn Horng
, et al.
·
Computer Vision and Image Understanding
·
43
A time-optimal message-efficient distributed algorithm for depth-first-search
1987
·
K.B. Lakshmanan
, N. Meenakshi
, et al.
·
Information Processing Letters
·
42
Time-optimal uniform scattering in a grid
2019
·
Pavan Poudel
, Gokarna Sharma
·
International Conference on Distributed Computing and Networking (ICDCN)
·
41
The rectangle intersection problem revisited
1980
·
H. -W. Six
, D. Wood
·
BIT Numerical Mathematics
·
37
Tighter time bounds on fault‐tolerant broadcasting and gossiping
1992
·
Luisa Gargano
·
Networks
·
36
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
1994
·
D. Bhagavathi
, S. Olariu
, et al.
·
Journal of Parallel and Distributed Computing
·
35
Tight bound on mobile Byzantine Agreement
2015
·
François Bonnet
, Xavier Défago
, et al.
·
Theoretical Computer Science
·
34
PDF
Stabbing c-oriented polygons
1983
·
Ralf Hartmut Güting
·
Information Processing Letters
·
34
A time-optimal delaunay refinement algorithm in two dimensions
2005
·
Sariel Har-Peled
, Alper Üngör
·
Annual Symposium on Computational Geometry (SoCG)
·
33
PDF
An optimal contour algorithm for iso-oriented rectangles
1984
·
Ralf Hartmut Güting
·
Journal of Algorithms
·
33
An optimal algorithm to solve the all‐pair shortest path problem on interval graphs
1992
·
R. Ravi
, Madhav V. Marathe
, et al.
·
Networks
·
32
Synchronous counting and computational algorithm design
2015
·
Danny Dolev
, Keijo Heljanko
, et al.
·
Journal of Computer and System Sciences
·
31
An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device
2000
·
S. Olarlu
, M.C. Pinotti
, et al.
·
IEEE Transactions on Computers
·
31
Combinatorics of least-squares trees
2008
·
Radu Mihaescu
, Lior Pachter
·
Proceedings of the National Academy of Sciences
·
30
Show more works
View as search
Works count:
239
Citation count:
2,663
Year
Topic
Type