Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Freivalds' algorithm
OpenAlex ID:
C38506071
A fast algorithm for finding dominators in a flowgraph
1979
·
Thomas Lengauer
, Robert Endre Tarjan
·
ACM Transactions on Programming Languages and Systems
·
779
Convergence Properties of the K-Means Algorithms
1994
·
Léon Bottou
, Yoshua Bengio
·
neural information processing systems
·
517
Maximum Matchings via Gaussian Elimination
2004
·
M. Mucha
, P. Sankowski
·
Annual Symposium on Foundations of Computer Science
·
347
Fast sparse matrix multiplication
2005
·
Raphael Yuster
, Uri Zwick
·
ACM Transactions on Algorithms
·
310
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
1991
·
Raimund Seidel
·
Computational Geometry
·
278
PDF
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
2010
·
Raimund Seidel
·
Computational Geometry
·
230
PDF
A Faster Deterministic Maximum Flow Algorithm
1994
·
V. King
, S. Rao
, et al.
·
Journal of Algorithms
·
227
Faster Algorithms for Rectangular Matrix Multiplication
2012
·
Francois Le Gall
·
Annual Symposium on Foundations of Computer Science
·
209
PDF
Locality of Reference in LU Decomposition with Partial Pivoting
1997
·
Sivan Toledo
·
SIAM Journal on Matrix Analysis and Applications
·
170
A sublinear-time randomized approximation algorithm for matrix games
1995
·
Michael D. Grigoriadis
, Leonid G. Khachiyan
·
Operations Research Letters
·
161
A Primal-Dual Randomized Algorithm for Weighted Paging
2012
·
Nikhil Bansal
, Niv Buchbinder
, et al.
·
Journal of the ACM
·
121
Randomized competitive algorithms for the list update problem
1994
·
Nick Reingold
, Jeffery Westbrook
, et al.
·
Algorithmica
·
118
Bphspace(s)⊆dspace(s3/2)
1999
·
Michael Saks
, Shiyu Zhou
·
Journal of Computer and System Sciences
·
114
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph
1991
·
Hillel Gazit
·
SIAM Journal on Computing
·
114
A Probabilistic 3—SAT Algorithm Further Improved
2002
·
Thomas Hofmeister
, Uwe Schöning
, et al.
·
Lecture notes in computer science
·
109
A Kiefer-Wolfowitz algorithm with randomized differences
1999
·
H.F. Chen
, T.E. Duncan
, et al.
·
IEEE Transactions on Automatic Control
·
105
Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths
2009
·
Ran Duan
, Seth Pettie
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
97
A fast hierarchical algorithm for three-dimensional capacitance extraction
2002
·
Weiping Shi
, Jianguo Liu
, et al.
·
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
·
97
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
2004
·
Raphael Yuster
, Uri Zwick
·
Symposium on Discrete Algorithms
·
94
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
2002
·
Tadao Takaoka
·
Electronic Notes in Theoretical Computer Science
·
86
PDF
Optimization of Queues Using an Infinitesimal Perturbation Analysis-Based Stochastic Algorithm with General Update Times
1993
·
Edwin K. P. Chong
, Peter J. Ramadge
·
SIAM Journal on Control and Optimization
·
83
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
1995
·
S. Khuller
, Y. Matias
·
Information and Computation
·
82
On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplication
1978
·
Hans F. de Groote
·
Theoretical Computer Science
·
78
PDF
A Simple and Efficient Randomized Byzantine Agreement Algorithm
1985
·
B. Chor
, B.A. Coan
·
IEEE Transactions on Software Engineering
·
76
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
2004
·
Igor Kaporin
·
Theoretical Computer Science
·
74
PDF
Show more works
View as search
Works count:
239
Citation count:
6,446
Year
Topic
Type