| 1994 | Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract). | Gaston H. Gonnet |
| 1994 | Optimization Algorithms For Large Networks. | Andrew V. Goldberg |
| 1994 | Work-Time Optimal Parallel Prefix Matching (Extended Abstract). | Leszek Gasieniec, Kunsoo Park |
| 1994 | Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract). | Ashim Garg, Roberto Tamassia |
| 1994 | On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. | Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni |
| 1994 | Incremental Text Editing: A New Data Structure. | Paolo Ferragina |
| 1994 | An o(n) Work EREW Parallel Algorithm for Updating MST. | Sajal K. Das, Paolo Ferragina |
| 1994 | Approximation Algorithm on Multi-Way Maxcut Partitioning. | Jun Dong Cho, Salil Raje, Majid Sarrafzadeh |
| 1994 | PRAM Computations Resilient to Memory Faults. | Bogdan S. Chlebus, Anna Gambin, Piotr Indyk |
| 1994 | Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract). | Yi-Jen Chiang, Roberto Tamassia |
| 1994 | A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph. | Victor Chepoi, Feodor F. Dragan |
| 1994 | An Optimal Algorithm for Preemptive On-line Scheduling. | Bo Chen, Andr van Vliet, Gerhard J. Woeginger |
| 1994 | Some Lower Bounds for Comparison-Based Algorithms. | Svante Carlsson, Jingsen Chen |
| 1994 | How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. | Christoph Burnikel, Kurt Mehlhorn, Stefan Schirra |
| 1994 | Membership in Constant Time and Minimum Space. | Andrej Brodnik, J. Ian Munro |
| 1994 | On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). | Dany Breslauer, Livio Colussi, Laura Toniolo |
| 1994 | Convex Tours on Bounded Curvature. | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec |
| 1994 | An Area Lower Bound for a Class of Fat-Trees (Extended Abstract). | Gianfranco Bilardi, Paul Bay |
| 1994 | A Better Heuristic for Orthogonal Graph Drawings. | Therese Biedl, Goos Kant |
| 1994 | Approaching the 5/4-Approximation for Rectilinear Steiner Trees. | Piotr Berman, Ulrich Fmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky |
| 1994 | Greedy Hot-Potato Routing on the Mesh. | Ishai Ben-Aroya, Assaf Schuster |
| 1994 | A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. | Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama |
| 1994 | Efficient Construction of a Bounded Degree Spanner with Low Weight. | Sunil Arya, Michiel H. M. Smid |
| 1994 | Hamilton Triangulations for Fast Rendering. | Esther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena |
| 1994 | Faster Searching in Tries and Quadtrees - An Analysis of Level Compression. | Arne Andersson, Stefan Nilsson |