| 1994 | A Better Algorithm for an Ancient Scheduling Problem. David R. Karger, Steven J. Phillips, Eric Torng |
| 1994 | A Las Vegas O(n Joseph Cheriyan |
| 1994 | A Near-Linear Algorithm for the Planar Segment Center Problem. Alon Efrat, Micha Sharir |
| 1994 | A Scaling Technique for Better Network Design. Manica Aggarwal, Naveen Garg |
| 1994 | A Sublinear Parallel Algorithm for Stable Matching. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin |
| 1994 | An Effective Additive Basis for the Integers. Mihail N. Kolountzakis |
| 1994 | An Efficient Algorithm for Dynamic Text Indexing. Ming Gu, Martin Farach, Richard Beigel |
| 1994 | An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. Vijaya Ramachandran, Honghua Yang |
| 1994 | An Optimal Algorithm for Approximate Nearest Neighbor Searching. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu |
| 1994 | An Optimal RAM Implementation of Catenable Min Double-ended Queues. S. Rao Kosaraju |
| 1994 | Approximate Data Structures with Applications. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young |
| 1994 | Approximately Counting Hamilton Cycles in Dense Graphs. Martin E. Dyer, Alan M. Frieze, Mark Jerrum |
| 1994 | Approximating Maximum Independent Set in Bounded Degree Graphs. Piotr Berman, Martin Fürer |
| 1994 | Approximating the Minimum Equivalent Diagraph. Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1994 | Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth |
| 1994 | Average Case Analysis of Dynamic Geometric Optimization. David Eppstein |
| 1994 | Clustering for Faster Network Simplex Pivots. David Eppstein |
| 1994 | Comparing Point Sets Under Projection. Daniel P. Huttenlocher, Jon M. Kleinberg |
| 1994 | Competitive Non-Preemptive Call Control. Baruch Awerbuch, Yair Bartal, Amos Fiat, Adi Rosén |
| 1994 | Competitive Routing of Virtual Circuits with Unknown Duration. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts |
| 1994 | Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. David P. Williamson, Michel X. Goemans |
| 1994 | Computing the Covers of a String in Linear Time. Dennis W. G. Moore, William F. Smyth |
| 1994 | Derandomizing Algorithms for Routing and Sorting on Meshes. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel |
| 1994 | Design of On-line Algorithms Using Hitting Times. Prasad Tetali |
| 1994 | Dynamic Algebraic Algorithms. John H. Reif, Stephen R. Tate |
| 1994 | Dynamic Two-Connectivity with Backtracking. Johannes A. La Poutré, Jeffery R. Westbrook |
| 1994 | Efficient Routing and Scheduling Algorithms for Optical Networks. Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan |
| 1994 | Exact Analysis of a Priority Queue Algorithm for Random Variate Generation. Eric Bach |
| 1994 | Fast Comparison of Evolutionary Trees. Martin Farach, Mikkel Thorup |
| 1994 | Generating Low-Degree 2-Spanners. Guy Kortsarz, David Peleg |
| 1994 | Improved Approximation Algorithms for Network Design Problems. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson |
| 1994 | Learning Binary Matroid Ports. Lisa Hellerstein, Collette R. Coullard |
| 1994 | Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. Amihood Amir, Gary Benson, Martin Farach |
| 1994 | Linear Programs for Randomized On-Line Algorithms. Carsten Lund, Nick Reingold |
| 1994 | Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours. Samuel R. Buss, Peter N. Yianilos |
| 1994 | Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. Ross M. McConnell, Jeremy P. Spinrad |
| 1994 | Low-degree Tests. Katalin Friedl, Zsolt Hátsági, Alexander Shen |
| 1994 | Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time. Kurt Mehlhorn, R. Sundar, Christian Uhrig |
| 1994 | Matching Nuts and Bolts. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky |
| 1994 | Maximal Empty Ellipsoids. Rex A. Dwyer, William F. Eddy |
| 1994 | Minimizing Channel Density by Lateral Shifting of Components. David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter |
| 1994 | Moments of Inertia and Graph Separators. Keith D. Gremban, Gary L. Miller, Shang-Hua Teng |
| 1994 | Neighborhood Preserving Hashing and Approximate Queries. Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas |
| 1994 | New Results on the Old k-Opt Algorithm for the TSP. Barun Chandra, Howard J. Karloff, Craig A. Tovey |
| 1994 | New Techniques for Approximating Complex Polynomial Zeros. Victor Y. Pan |
| 1994 | On Degeneracy in Geometric Computations. Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra |
| 1994 | On Optimal Strategies for Searching in Presence of Errors. S. Muthukrishnan |
| 1994 | On the Greedy Heuristic for Matchings. Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen |
| 1994 | On-line Search in a Simple Polygon. Jon M. Kleinberg |
| 1994 | Online Interval Scheduling. Richard J. Lipton, Andrew Tomkins |
| 1994 | Optimal Construction of Edge-Disjoint Paths in Random Graphs. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal |
| 1994 | Optimal Constructions of Hybrid Algorithms. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin |
| 1994 | Optimal Parallel Approximation for Prefix Sums and Integer Sorting. Michael T. Goodrich, Yossi Matias, Uzi Vishkin |
| 1994 | Optimal Parallel Sorting in Multi-Level Storage. Alok Aggarwal, C. Greg Plaxton |
| 1994 | Optimal Prediction for Prefetching in the Worst Case. P. Krishnan, Jeffrey Scott Vitter |
| 1994 | Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. Rajeev Raman, Uzi Vishkin |
| 1994 | Optimum Parallel Computations with Banded Matrices. Victor Y. Pan, Isdor Sobze, Antoine Atinkpahoun |
| 1994 | Path Problems in Skew-Symmetric Graphs. Andrew V. Goldberg, Alexander V. Karzanov |
| 1994 | Physical Mapping of Chromosomes Using Unique Probes. Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig |
| 1994 | Polynomial Time Algorithms for Some Evacuation Problems. Bruce Hoppe, Éva Tardos |
| 1994 | Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA. Daniel Dominic Sleator |
| 1994 | Queueing Analysis of Oblivious Packet-Routing Networks. Mor Harchol-Balter, Paul E. Black |
| 1994 | Recognizing Balanced 0, +/- Matrices. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic |
| 1994 | Reconstructing a History of Recombinations from a Set of Sequences. John D. Kececioglu, Dan Gusfield |
| 1994 | Reliable Benchmarks Using Numerical Instability. Sigal Ar, Jin-Yi Cai |
| 1994 | Roots of a Polynomial and its Derivatives. Don Coppersmith, C. Andrew Neff |
| 1994 | Scheduling Malleable and Nonmalleable Parallel Tasks. Walter Ludwig, Prasoon Tiwari |
| 1994 | Scheduling Parallel Tasks to Minimize Average Response Time. John Turek, Uwe Schwiegelshohn, Joel L. Wolf, Philip S. Yu |
| 1994 | Selection in the Presence of Noise: The Design of Playoff Systems. Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon |
| 1994 | Shallow Excluded Minors and Improved Graph Decompositions. Serge A. Plotkin, Satish Rao, Warren D. Smith |
| 1994 | Shortest Paths Algorithms: Theory and Experimental Evaluation. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik |
| 1994 | Spanning Trees Short or Small. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi |
| 1994 | Surface Approximation and Geometric Partitions. Pankaj K. Agarwal, Subhash Suri |
| 1994 | Testable Algorithms for Self-Avoiding Walks. Dana Randall, Alistair Sinclair |
| 1994 | The Complexity of Resolvent Resolved. Giovanni Gallo, Bhubaneswar Mishra |
| 1994 | The QRQW PRAM: Accounting for Contention in Parallel Algorithms. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran |
| 1994 | The Subtree Max Gap Problem with Application to Parallel String Covering. Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park |
| 1994 | Tight Bounds for Dynamic Storage Allocation. Michael Luby, Joseph Naor, Ariel Orda |
| 1994 | Two and Higher Dimensional Pattern Matching in Optimal Expected Time. Juha Kärkkäinen, Esko Ukkonen |
| 1994 | Using Randomized Sparsification to Approximate Minimum Cuts. David R. Karger |