| 1997 | Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties. | Pascal Koiran |
| 1997 | Storage Management for Evolving Databases. | Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian |
| 1997 | Computing Integral Points in Convex Semi-algebraic Sets. | Leonid Khachiyan, Lorant Porkolab |
| 1997 | A 7/8-Approximation Algorithm for MAX 3SAT? | Howard J. Karloff, Uri Zwick |
| 1997 | Minimizing Flow Time Nonclairvoyantly. | Bala Kalyanasundaram, Kirk Pruhs |
| 1997 | Deterministic Superimposed Coding with Applications to Pattern Matching. | Piotr Indyk |
| 1997 | The Minimization Problem for Boolean Formulas. | Edith Hemaspaandra, Gerd Wechsung |
| 1997 | Computable Obstructions to Wait-free Computability. | John Havlicek |
| 1997 | The Computational Complexity of Knot and Link Problems. | Joel Hass, J. C. Lagarias, Nicholas Pippenger |
| 1997 | New Directions in Cryptography: Twenty Some Years Later. | Shafi Goldwasser |
| 1997 | Flows in Undirected Unit Capacity Networks. | Andrew V. Goldberg, Satish Rao |
| 1997 | Beyond the Flow Decomposition Barrier. | Andrew V. Goldberg, Satish Rao |
| 1997 | Contention Resolution with Guaranteed Constant Expected Delay. | Leslie Ann Goldberg, Philip D. MacKenzie |
| 1997 | Reliable Cellular Automata with Self-Organization. | Pter Gcs |
| 1997 | Optimal Resilience Proactive Public-Key Cryptosystems. | Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung |
| 1997 | Lower Bounds for the Signature Size of Incremental Schemes. | Marc Fischlin |
| 1997 | Truly Online Paging with Locality of Reference. | Amos Fiat, Manor Mendel |
| 1997 | Optimal Suffix Tree Construction with Large Alphabets. | Martin Farach |
| 1997 | Improved Bounds on Planar k-sets and k-levels. | Tamal K. Dey |
| 1997 | Randomized Allocation Processes. | Artur Czumaj, Volker Stemann |
| 1997 | Finding an Even Hole in a Graph. | Michele Conforti, Grard Cornujols, Ajai Kapoor, Kristina Vuskovic |
| 1997 | Learning Noisy Perceptrons by a Perceptron in Polynomial Time. | Edith Cohen |
| 1997 | A Faster Deterministic Algorithm for Minimum Spanning Trees. | Bernard Chazelle |
| 1997 | Constant Depth Circuits and the Lutz Hypothesis. | Jin-yi Cai, D. Sivakumar, Martin Strauss |
| 1997 | An Improved Worst-Case to Average-Case Connection for Lattice Problems. | Jin-yi Cai, Ajay Nerurkar |