| 1997 | Polynominal Time Algorithms for Some Self-Duality Problems. | Carlos Domingo |
| 1997 | Finding Optimum | Yefim Dinitz, Zeev Nutov |
| 1997 | An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. | Amitava Datta, Kamala Krithivasan, Thomas Ottmann |
| 1997 | Maintaining Maxima under Boundary Updates. | Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo |
| 1997 | The Algorithmic Complexity of Chemical Threshold Testing. | Peter Damaschke |
| 1997 | Topological Chaos for Elementary Cellular Automata. | Gianpiero Cattaneo, Michele Finelli, Luciano Margara |
| 1997 | Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. | Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino |
| 1997 | Algorithms and Data Structures for Control Dependence and Related Compiler Problems. | Gianfranco Bilardi |
| 1997 | On the Complexity of Balanced Boolean Functions. | Anna Bernasconi |
| 1997 | An Improved Deterministic Algorithms for Generalized Random Sampling. | Amihood Amir, Emanuel Dar |
| 1997 | Hardness of Approximating Problems on Cubic Graphs. | Paola Alimonti, Viggo Kann |
| 1994 | Some Open Problems in Approximation. | Mihalis Yannakakis |
| 1994 | On a Parallel-Algorithms Method for String Matching Problems. | Sleyman Cenk Sahinalp, Uzi Vishkin |
| 1994 | Lower Bounds for Merging on the Hypercube. | Christine Rb |
| 1994 | On Self-Reducible Sets of Low Information Content. | Martin Mundhenk |
| 1994 | On the Complexity of Some Reachability Problems. | Angelo Monti, Alessandro Roncato |
| 1994 | On Set Equality-Testing. | Tak Wah Lam, Ka Hing Lee |
| 1994 | Time-Message Trade-Offs for the Weak Unison Problem. | Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro |
| 1994 | Efficient Reorganization of Binary Search Trees. | Micha Hofri, Hadas Shachnai |
| 1994 | On the Intellectual Terrain Around NP. | Juris Hartmanis, Suresh Chari |
| 1994 | Advances in Graph Drawing. | Ashim Garg, Roberto Tamassia |
| 1994 | Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. | Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1994 | A Unified Scheme for Routing in Expander Based Networks. | Shimon Even, Ami Litman |
| 1994 | Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs. | Eliezer Dekel, Jie Hu |
| 1994 | A Non-Iterative Electronic Cash System. | Giovanni Di Crescenzo |