Get started
Keyword

deterministic algorithms

Description: Deterministic algorithms are computational procedures that produce the same output whenever they are given the same input and execution conditions.
Wikidata ID: wiki/Q1064349
OpenAlex ID: keywords/deterministic-algorithms
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
1984 · Manuel Blum, Silvio Micali · SIAM Journal on Computing · 1,322
A Simple Parallel Algorithm for the Maximal Independent Set Problem
1986 · Michael Luby · SIAM Journal on Computing · 1,174
PRIMES is in P
2004 · Manindra Agrawal, Neeraj Kayal, et al. · Annals of Mathematics · 931
PDF
Triangulating a simple polygon in linear time
1991 · Bernard Chazelle · Discrete & Computational Geometry · 640
PDF
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
1988 · Prabhakar Raghavan · Journal of Computer and System Sciences · 544
PDF
Elliptic curves over finite fields and the computation of square roots mod 𝑝
1985 · René Schoof · Mathematics of Computation · 515
PDF
Factoring polynomials over large finite fields
1970 · E. R. Berlekamp · Mathematics of Computation · 507
PDF
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
2001 · Jacob Holm, Kristian de Lichtenberg, et al. · Journal of the ACM · 456
Undirected single-source shortest paths with positive integer weights in linear time
1999 · Mikkel Thorup · Journal of the ACM · 437
Deterministic memory-efficient string matching algorithms for intrusion detection
2005 · N. Tuck, T. Sherwood, et al. · IEEE Conference on Computer Communications (INFOCOM) · 395
An optimal convex hull algorithm in any fixed dimension
1993 · Bernard Chazelle · Discrete & Computational Geometry · 361
PDF
Incremental clustering and dynamic information retrieval
1997 · Moses Charikar, Chandra Chekuri, et al. · ACM Symposium on Theory of Computing (STOC) · 355
PDF
A simple parallel algorithm for the maximal independent set problem
1985 · M Luby · 350
PDF
Approximate counts and quantiles over sliding windows
2004 · Arvind Arasu, Gurmeet Singh Manku · ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS) · 342
A minimum spanning tree algorithm with inverse-Ackermann type complexity
2000 · Bernard Chazelle · Journal of the ACM · 328
PDF
A deterministic algorithm for sparse multivariate polynomial interpolation
1988 · Michael Ben-Or · 308
PDF
Network decomposition and locality in distributed computation
1989 · B. Awerbuch, M. Luby, et al. · Annual Symposium on Foundations of Computer Science · 303
A new approach to dynamic all pairs shortest paths
2004 · Camil Demetrescu, Giuseppe F. Italiano · Journal of the ACM · 271
Cutting hyperplanes for divide-and-conquer
1993 · Bernard Chazelle · Discrete & Computational Geometry · 270
PDF
The power of parallel prefix
1985 · Clyde P. Kruskal, Larry Rudolph, et al. · IEEE Transactions on Computers · 254
How to generate cryptographically strong sequences of pseudo random bits
1982 · Manuel Blum, Silvio Micali · Annual Symposium on Foundations of Computer Science · 252
The Competitiveness of On-Line Assignments
1995 · Y. Azar, J. Naor, et al. · Journal of Algorithms · 241
Incremental Clustering and Dynamic Information Retrieval
2004 · Moses Charikar, Chandra Chekuri, et al. · SIAM Journal on Computing · 233
Minimum covariance determinant and extensions
2017 · Mia Hubert, Michiel Debruyne, et al. · Wiley Interdisciplinary Reviews Computational Statistics · 211
PDF
CrowdScreen
2012 · Aditya G. Parameswaran, Hector Garcia-Molina, et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 207
Works count: 4,150
Citation count: 54,520
Year
Topic
Type