# | Title | Journal | Year | Citations |
---|
1 | Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment | Journal of the ACM | 1973 | 7,074 |
2 | Authoritative sources in a hyperlinked environment | Journal of the ACM | 1999 | 6,521 |
3 | Robust principal component analysis? | Journal of the ACM | 2011 | 4,536 |
4 | `` Direct Search'' Solution of Numerical and Statistical Problems | Journal of the ACM | 1961 | 3,455 |
5 | Impossibility of distributed consensus with one faulty process | Journal of the ACM | 1985 | 3,214 |
6 | A Machine-Oriented Logic Based on the Resolution Principle | Journal of the ACM | 1965 | 2,951 |
7 | Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming | Journal of the ACM | 1995 | 2,443 |
8 | The String-to-String Correction Problem | Journal of the ACM | 1974 | 2,288 |
9 | A threshold of ln n for approximating set cover | Journal of the ACM | 1998 | 2,240 |
10 | Open, Closed, and Mixed Networks of Queues with Different Classes of Customers | Journal of the ACM | 1975 | 2,130 |
11 | Fibonacci heaps and their uses in improved network optimization algorithms | Journal of the ACM | 1987 | 2,024 |
12 | A Computing Procedure for Quantification Theory | Journal of the ACM | 1960 | 1,986 |
13 | Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems | Journal of the ACM | 1972 | 1,922 |
14 | An optimal algorithm for approximate nearest neighbor searching fixed dimensions | Journal of the ACM | 1998 | 1,875 |
15 | Unreliable failure detectors for reliable distributed systems | Journal of the ACM | 1996 | 1,830 |
16 | Reaching Agreement in the Presence of Faults | Journal of the ACM | 1980 | 1,720 |
17 | An Algorithm for Subgraph Isomorphism | Journal of the ACM | 1976 | 1,696 |
18 | A Technique for the Numerical Solution of Certain Integral Equations of the First Kind | Journal of the ACM | 1962 | 1,689 |
19 | A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures | Journal of the ACM | 1970 | 1,544 |
20 | Sequential Operations in Digital Picture Processing | Journal of the ACM | 1966 | 1,524 |
21 | A new approach to the maximum-flow problem | Journal of the ACM | 1988 | 1,452 |
22 | Integer Programming Formulation of Traveling Salesman Problems | Journal of the ACM | 1960 | 1,421 |
23 | How to construct random functions | Journal of the ACM | 1986 | 1,417 |
24 | P-Complete Approximation Problems | Journal of the ACM | 1976 | 1,379 |
25 | Learnability and the Vapnik-Chervonenkis dimension | Journal of the ACM | 1989 | 1,358 |
26 | A Theorem on Boolean Matrices | Journal of the ACM | 1962 | 1,321 |
27 | How bad is selfish routing? | Journal of the ACM | 2002 | 1,317 |
28 | A Space-Economical Suffix Tree Construction Algorithm | Journal of the ACM | 1976 | 1,206 |
29 | Consensus in the presence of partial synchrony | Journal of the ACM | 1988 | 1,164 |
30 | The Semantics of Predicate Logic as a Programming Language | Journal of the ACM | 1976 | 1,162 |
31 | Alternation | Journal of the ACM | 1981 | 1,162 |
32 | On lattices, learning with errors, random linear codes, and cryptography | Journal of the ACM | 2009 | 1,138 |
33 | On Communicating Finite-State Machines | Journal of the ACM | 1983 | 1,130 |
34 | Fast Probabilistic Algorithms for Verification of Polynomial Identities | Journal of the ACM | 1980 | 1,129 |
35 | Software protection and simulation on oblivious RAMs | Journal of the ACM | 1996 | 1,109 |
36 | A Transformation System for Developing Recursive Programs | Journal of the ACM | 1977 | 1,079 |
37 | Proof verification and the hardness of approximation problems | Journal of the ACM | 1998 | 1,079 |
38 | Efficient dispersal of information for security, load balancing, and fault tolerance | Journal of the ACM | 1989 | 1,075 |
39 | The complexity of propositional linear temporal logics | Journal of the ACM | 1985 | 1,072 |
40 | Parallel Prefix Computation | Journal of the ACM | 1980 | 1,068 |
41 | Private information retrieval | Journal of the ACM | 1998 | 1,059 |
42 | Algebraic laws for nondeterminism and concurrency | Journal of the ACM | 1985 | 1,054 |
43 | Efficiency of a Good But Not Linear Set Union Algorithm | Journal of the ACM | 1975 | 1,052 |
44 | Some optimal inapproximability results | Journal of the ACM | 2001 | 1,009 |
45 | The well-founded semantics for general logic programs | Journal of the ACM | 1991 | 1,004 |
46 | New Constructive Aspects of the Lovász Local Lemma | Journal of the ACM | 2011 | 993 |
47 | New Methods in Automatic Extracting | Journal of the ACM | 1969 | 971 |
48 | Mean-Value Analysis of Closed Multichain Queuing Networks | Journal of the ACM | 1980 | 971 |
49 | Alternating-time temporal logic | Journal of the ACM | 2002 | 954 |
50 | A Theory of Communicating Sequential Processes | Journal of the ACM | 1984 | 926 |