Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
linear space algorithms
Description:
Algorithms whose memory use grows linearly with the size of the input in computational complexity analysis.
Primary topic:
Algorithms and Data Compression (41%)
Related topics:
Algorithms and Data Compression (41%),
Complexity and Algorithms in Graphs (15%),
Computational Geometry and Mesh Generation (9%)
OpenAlex ID:
keywords/linear-space-algorithms
Optimal alignments in linear space
1988
·
Eugene W. Myers
, Webb Miller
·
Computer applications in the biosciences
·
1,419
A linear space algorithm for computing maximal common subsequences
1975
·
D. S. Hirschberg
·
Communications of the ACM
·
1,260
PDF
A time-efficient, linear-space local similarity algorithm
1991
·
Xiaoqiu Huang
, Webb Miller
·
Advances in Applied Mathematics
·
1,132
Undirected single-source shortest paths with positive integer weights in linear time
1999
·
Mikkel Thorup
·
Journal of the ACM
·
519
Preserving order in a forest in less than logarithmic time and linear space
1977
·
P. van Emde Boas
·
Information Processing Letters
·
471
Polynomial-time approximation schemes for packing and piercing fat objects
2003
·
Timothy M Chan
·
Journal of Algorithms
·
230
Parallel algorithms for geometric graph problems
2014
·
Alexandr Andoni
, Aleksandar Nikolov
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
220
Topologically sweeping visibility complexes via pseudotriangulations
1996
·
M. Pocchiola
, G. Vegter
·
Discrete & Computational Geometry
·
136
PDF
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
2004
·
Joseph JaJa
, Christian W. Mortensen
, et al.
·
Lecture notes in computer science
·
132
Multi-Way Number Partitioning
·
Richard E. Korf
·
119
Finding All Common Intervals of k Permutations
2001
·
Steffen Heber
, Jens Stoye
·
Lecture notes in computer science
·
114
Shortest paths in directed planar graphs with negative lengths: A linear-space O ( n log 2 n )-time algorithm
2010
·
Philip N. Klein
, Shay Mozes
, et al.
·
ACM Transactions on Algorithms
·
108
Improved Shortest Paths on the Word RAM
2000
·
Torben Hagerup
·
Lecture notes in computer science
·
108
Parametric search and locating supply centers in trees
2005
·
Greg N. Frederickson
·
Springer eBooks
·
92
The Algorithmic of Gene Teams
2002
·
Anne Bergeron
, Sylvie Corteel
, et al.
·
Lecture notes in computer science
·
92
Finding Extremal Polygons
1985
·
James E. Boyce
, David P. Dobkin
, et al.
·
SIAM Journal on Computing
·
87
Undirected single source shortest paths in linear time
2002
·
M. Thorup
·
Annual Symposium on Foundations of Computer Science
·
85
Fast Transformation of Temporal Plans for Efficient Execution
1998
·
Ioannis Tsamardinos
, Nicola Muscettola
, et al.
·
NASA Technical Reports Server (NASA)
·
83
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
2004
·
Thomas Schmidt
, Jens Stoye
·
Lecture notes in computer science
·
72
A linear space algorithm for computing the hermite normal form
2001
·
Daniele Micciancio
, Bogdan Warinschi
·
International Symposium on Symbolic and Algebraic Computation
·
71
Algorithms for the Relaxed Online Bin-Packing Model
2000
·
Giorgio Gambosi
, Alberto Postiglione
, et al.
·
SIAM Journal on Computing
·
67
How to search in history
1985
·
Bernard Chazelle
·
Information and Control
·
67
PDF
Fast linear-space computations of longest common subsequences
1992
·
A. Apostolico
, S. Browne
, et al.
·
Theoretical Computer Science
·
64
Two-Guard Walkability of Simple Polygons
1998
·
L. H. Tseng
, P. Heffernan
, et al.
·
International Journal of Computational Geometry & Applications
·
58
Faster Regular Expression Matching
2009
·
Philip Bille
, Mikkel Thorup
·
Lecture notes in computer science
·
54
Show more works
View as search
Works count:
260
Citation count:
8,735
Year
Topic
Type