Get started
Keyword

linear-time algorithms

Description: Algorithms whose running time grows at most proportionally to input size, studied in computer science and computational mathematics.
Wikidata ID: wiki/Q1826448
OpenAlex ID: keywords/linear-time-algorithms
Finding community structure in very large networks
2004 · Aaron Clauset, M. E. J. Newman, et al. · Physical Review E · 7,377
PDF
Depth-First Search and Linear Graph Algorithms
1972 · Robert Tarjan · SIAM Journal on Computing · 6,167
Guided Image Filtering
2012 · Kaiming He, Jian Sun, et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 5,464
Automatic verification of finite-state concurrent systems using temporal logic specifications
1986 · E. M. Clarke, E. A. Emerson, et al. · ACM Transactions on Programming Languages and Systems · 3,605
PDF
The String-to-String Correction Problem
1974 · Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 3,034
PDF
Fast Pattern Matching in Strings
1977 · Donald E. Knuth, James H. Morris, Jr., et al. · SIAM Journal on Computing · 2,943
A Linear-Time Heuristic for Improving Network Partitions
1982 · C.M. Fiduccia, R.M. Mattheyses · Proceedings - ACM IEEE Design Automation Conference · 2,539
Universal classes of hash functions
1979 · J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 2,526
Efficiently computing static single assignment form and the control dependence graph
1991 · Ron Cytron, Jeanne Ferrante, et al. · ACM Transactions on Programming Languages and Systems · 2,269
PDF
LSD: A Fast Line Segment Detector with a False Detection Control
2009 · R.G. von Gioi, J. Jakubowicz, et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1,947
The feature selection problem: traditional methods and a new algorithm
1992 · Kenji Kira, Larry Rendell · National Conference on Artificial Intelligence · 1,900
Algorithms on strings, trees, and sequences
1997 · Dan Gusfield · 1,703
Weisfeiler-Lehman Graph Kernels
2010 · Nino Shervashidze, Pascal Schweitzer, et al. · Max Planck Digital Library · 1,611
PDF
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
1996 · Hans L. Bodlaender · SIAM Journal on Computing · 1,544
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
1976 · Kellogg S. Booth, George S. Lueker · Journal of Computer and System Sciences · 1,485
On-line construction of suffix trees
1995 · E. Ukkonen · Algorithmica · 1,474
A Separator Theorem for Planar Graphs
1979 · Richard J. Lipton, Robert Endre Tarjan · SIAM Journal on Applied Mathematics · 1,363
Time bounds for selection
1973 · Manuel Blum, Robert W. Floyd, et al. · Journal of Computer and System Sciences · 1,246
Algorithmic Aspects of Vertex Elimination on Graphs
1976 · Donald J. Rose, R. Endre Tarjan, et al. · SIAM Journal on Computing · 1,204
Distance-based outliers: algorithms and applications
2000 · Edwin M. Knorr, Raymond T. Ng, et al. · The VLDB Journal · 1,194
Points-to analysis in almost linear time
1996 · Bjarne Steensgaard · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1,092
PDF
A Linear-Time Algorithm for Gaussian and Non-Gaussian Trait Evolution Models
2014 · Lam si Tung Ho, Cécile Ané · Systematic Biology · 1,091
Efficient Planarity Testing
1974 · John Hopcroft, Robert Tarjan · Journal of the ACM · 1,082
PDF
The Rapid Evaluation of Potential Fields in Particle Systems
1988 · Leslie F. Greengard · The MIT Press eBooks · 1,067
Streaming fragment assignment for real-time analysis of sequencing experiments
2012 · Adam Roberts, Lior Pachter · Nature Methods · 1,059
Works count: 12,050
Citation count: 273,800
Year
Topic
Type