Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
O(n^2) algorithm
Description:
An algorithm whose running time grows quadratically with input size, used in computational problems across fields such as graph theory and numerical analysis.
Related topics:
Computational Geometry and Mesh Generation (18%),
Matrix Theory and Algorithms (17%),
Complexity and Algorithms in Graphs (13%),
Algorithms and Data Compression (8%)
OpenAlex ID:
keywords/o-n-2-algorithm
An efficient algorithm for the “stable roommates” problem
1985
·
Robert W Irving
·
Journal of Algorithms
·
580
Finding a Minimum Circuit in a Graph
1978
·
Alon Itai
, Michael Rodeh
·
SIAM Journal on Computing
·
487
An Estimate for the Condition Number of a Matrix
1979
·
A. K. Cline
, C. B. Moler
, et al.
·
SIAM Journal on Numerical Analysis
·
415
Efficient instruction scheduling for a pipelined architecture
2004
·
Steven S. Muchnick
, Phillip B. Gibbons
·
ACM SIGPLAN Notices
·
172
A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
1998
·
Inderjit S. Dhillon
·
UC Berkeley
·
157
Computing the three-point correlation function of galaxies in $\mathcal {O}(N^2)$ time
2015
·
Zachary Slepian
, Daniel J. Eisenstein
·
Monthly Notices of the Royal Astronomical Society
·
141
PDF
Efficient algorithms for divisive hierarchical clustering with the diameter criterion
1991
·
A. Guénoche
, P. Hansen
, et al.
·
Journal of Classification
·
140
On the maximum empty rectangle problem
1984
·
A Naamad
, D.T Lee
, et al.
·
Discrete Applied Mathematics
·
131
On a circle placement problem
1986
·
B. M. Chazelle
, D. T. Lee
·
Computing
·
116
Fast evaluation of sequence pair in block placement by longest common subsequence computation
2000
·
Xiaoping Tang
, Ruiqi Tian
, et al.
·
Design, Automation, and Test in Europe
·
107
Triangular Factorization of Structured Hermitian Matrices
1986
·
Hanoch Lev-Ari
, Thomas Kailath
·
Operator theory
·
104
An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits
1984
·
K. Kozminski
, E. Kinnen
·
ACM/IEEE Design Automation Conference (DAC)
·
91
Stability Analysis of Algorithms for Solving Confluent Vandermonde-Like Systems
1990
·
Nicholas J. Higham
·
SIAM Journal on Matrix Analysis and Applications
·
86
Efficient solution of linear systems of equations with recursive structure
1986
·
I. Gohberg
, T. Kailath
, et al.
·
Linear Algebra and its Applications
·
82
Generalized Bezoutians and families of efficient zero-location procedures
1991
·
H. Lev-Ari
, Y. Bistritz
, et al.
·
IEEE Transactions on Circuits and Systems
·
67
Computing the link center of a simple polygon
1987
·
W. Lenhart
, R. Pollack
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
64
PDF
Incremental assignment problem
2006
·
Ismail H. Toroslu
, Göktürk Üçoluk
·
Information Sciences
·
61
A simple algorithm for detecting circular permutations in proteins
1999
·
S. Uliel
, A. Fliess
, et al.
·
Bioinformatics
·
60
PDF
The 1-steiner tree problem
1987
·
George Georgakopoulos
, Christos H Papadimitriou
·
Journal of Algorithms
·
59
A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
1993
·
Stan Cabay
, Ron Meleshko
·
SIAM Journal on Matrix Analysis and Applications
·
58
Generalized left corner parsing
1977
·
Alan J. Demers
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
57
Pentium Pro Inside: I. A Treecode at 430 Gigaflops on ASCI Red II. Price/Performance of $50/Mflop on Loki and Hyglac
1997
·
Warren, Michael S.
, Salmon, John K.
, et al.
·
University of North Texas Digital Library (University of North Texas)
·
54
Comments on "Parallel algorithms for hierarchical clustering and cluster validity
1992
·
F. Murtagh
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
53
Solution of linear equations with Hankel and Toeplitz matrices
1974
·
Jorma Rissanen
·
Numerische Mathematik
·
50
A Fast Algorithm for Approximate Polynomial GCD Based on Structured Matrix Computations
2010
·
Dario A. Bini
, Paola Boito
·
Birkhäuser Basel eBooks
·
49
Show more works
View as search
Works count:
270
Citation count:
4,634
Year
Topic
Type