| Counterexamples for Directed and Node Capacitated Cut-Trees | 1995/06/01 | English | |
| Tree Reconstruction from Partial Orders | 1995/06/01 | English | |
| Automatic Asymptotic and Big-O Calculations via Computer Algebra | 1979/08/01 | English | |
| On the Selection of Test Data for Vector-Valued Recursive Subroutines | 1983/08/01 | English | |
| On Optimal Processor Scheduling for Multiprogramming | 1973/12/01 | English | |
| Tree-Adjoining Language Parsing in $O(n^6 )$ Time | 1996/08/01 | English | |
| Amortized Communication Complexity | 1995/08/01 | English | |
| Scheduling Jobs with Temporal Distance Constraints | 1995/10/01 | English | |
| The Serial Transitive Closure Problem for Trees | 1995/02/01 | English | |
| Deterministic Simulations of PRAMs on Bounded Degree Networks | 1994/04/01 | English | |
| Interactive Computation of Homology of Finite Partially Ordered Sets | 1975/09/01 | English | |
| When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? | 1995/06/01 | English | |
| A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed | 1994/12/01 | English | |
| A Density Theorem for Purely Iterative Zero Finding Methods | 1990/02/01 | English | |
| Strongly Competitive Algorithms for Paging with Locality of Reference | 1996/06/01 | English | |
| A Priori Bounds on the Euclidean Traveling Salesman | 1995/06/01 | English | |
| On “Axiomatising Finite Concurrent Processes” | 1994/08/01 | English | |
| Private Computations over the Integers | 1995/04/01 | English | |
| Fault-Tolerant Scheduling | 2005/01/01 | English | |
| Nonmigratory Online Deadline Scheduling on Multiprocessors | 2005/01/01 | English | |
| Abstract Combinatorial Programs and Efficient Property Testers | 2005/01/01 | English | |
| Top-Down Analysis of Path Compression | 2005/01/01 | English | |
| A Faster, Better Approximation Algorithm for the Minimum Latency Problem | 2008/01/01 | English | |
| Making the Most of Your Samples | 2018/01/01 | English | |
| The Submodular Secretary Problem Goes Linear | 2018/01/01 | English | |
| Eigenvectors of Orthogonally Decomposable Functions | 2018/01/01 | English | |
| $(2+\varepsilon)$-Sat Is NP-hard | 2017/01/01 | English | |
| A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes | 2017/01/01 | English | |
| On Clustering Induced Voronoi Diagrams | 2017/01/01 | English | |
| Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013) | 2016/01/01 | English | |