| 1993 | A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. Roberto Di Cosmo, Delia Kesner |
| 1993 | A Partial Solution for D-Unification Based on a Reduction to AC1-Unification. Evelyne Contejean |
| 1993 | A Simple Method for Resolving Degeneracies in Delaunay Triangulations. Michael B. Dillencourt, Warren D. Smith |
| 1993 | A Theory of Even Functionals and Their Algorithmic Applications. Jerzy W. Jaromczyk, Grzegorz Swiatek |
| 1993 | Algebraic Aspects of B-regular Series. Philippe Dumas |
| 1993 | Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability. Thomas Wilke |
| 1993 | An Effective Version of Stallings' Theorem in the Case of Context-Free Groups. Géraud Sénizergues |
| 1993 | Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson |
| 1993 | Cobham's Ttheorem seen through Büchi's Theorem. Christian Michaux, Roger Villemaire |
| 1993 | Computational Depth and Reducibility (Extended Abstract). David W. Juedes, James I. Lathrop, Jack H. Lutz |
| 1993 | Computing on Structures. Serge Abiteboul, Victor Vianu |
| 1993 | Constructing Competitive Tours From Local Information. Bala Kalyanasundaram, Kirk Pruhs |
| 1993 | Decidability of a Partial Order Based Temporal Logic. Kamal Lodaya, P. S. Thiagarajan |
| 1993 | Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). Lalita Jategaonkar, Albert R. Meyer |
| 1993 | Dynamic Interpolation Search in o(log log n) Time. Arne Andersson, Christer Mattsson |
| 1993 | Efficient Analysis of Concurrent Constraint Logic Programs. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
| 1993 | Exact Asymptotics of Divide-and-Conquer Recurrences. Philippe Flajolet, Mordecai J. Golin |
| 1993 | Extended Transition Systems for Parametric Bisimulation. Paola Inverardi, Corrado Priami, Daniel Yankelevich |
| 1993 | Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic. Arnold Schönhage |
| 1993 | Fast Parallel Constraint Satisfaction. Lefteris M. Kirousis |
| 1993 | Fault-Tolerance and Complexity (Extended Abstract). Lane A. Hemachandra |
| 1993 | Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract). Arvind Gupta |
| 1993 | From Domains to Automata with Concurrency. Felipe Bracho, Manfred Droste |
| 1993 | If a D0L Language is k-Power Free then it is Circular. Filippo Mignosi, Patrice Séébold |
| 1993 | Inclusion is Undecidable for Pattern Languages. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu |
| 1993 | Learnability: Admissible, Co-finite, and Hypersimple Languages. Ganesh R. Baliga, John Case |
| 1993 | Local Model Checking for Context-Free Processes. Hardi Hungar, Bernhard Steffen |
| 1993 | Logical Definability on Infinite Traces. Werner Ebinger, Anca Muscholl |
| 1993 | Lower Bounds for One-way Probabilistic Communication Complexity. Farid M. Ablayev |
| 1993 | Maintaining Discrete Probability Distributions Optimally. Torben Hagerup, Kurt Mehlhorn, J. Ian Munro |
| 1993 | Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega. Franco Barbanera, Maribel Fernández |
| 1993 | New Decidability Results Concerning Two-way Counter Machines and Applications. Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang |
| 1993 | On Distributed Algorithms in a Broadcast Domain. Danny Dolev, Dalia Malki |
| 1993 | On Randomized Versus Deterministic Computation. Marek Karpinski, Rutger Verbeek |
| 1993 | On Regular Compatibility of Semi-Commutations. Edward Ochmanski, Pierre-André Wacrenier |
| 1993 | On the Computational Power of Discrete Hopfield Nets. Pekka Orponen |
| 1993 | On the Power of Periodic Iteration of Morphisms. Arto Lepistö |
| 1993 | Optimal Bounds for the Change-Making Problem. Dexter Kozen, Shmuel Zaks |
| 1993 | Polynomially Bounded Minimization Problems which are Hard to Approximate. Viggo Kann |
| 1993 | Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis |
| 1993 | Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. Artur Czumaj, Alan Gibbons |
| 1993 | Products of Finite State Machines with Full Coverage. David M. Cohen, Michael L. Fredman |
| 1993 | Program Result Checking: A New Approach to Making Programs More Reliable. Manuel Blum |
| 1993 | Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines. Hiroaki Yamamoto |
| 1993 | Searching among Intervals and Compact Routing Tables. Greg N. Frederickson |
| 1993 | Secure and Efficient Off-Line Digital Money (Extended Abstract). Matthew K. Franklin, Moti Yung |
| 1993 | Sparse Networks Supporting Efficient Reliable Broadcasting. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc |
| 1993 | Strongly Adaptive Token Distribution. Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka |
| 1993 | Temporal Logic and Categories of Petrie Nets. Carolyn Brown, Doug Gurr |
| 1993 | The Approximation of Maximum Subgraph Problems. Carsten Lund, Mihalis Yannakakis |
| 1993 | The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi |
| 1993 | The Complexity of N-body Simulation. John H. Reif, Stephen R. Tate |
| 1993 | The Fork Calculus. Klaus Havelund, Kim Guldstrand Larsen |
| 1993 | The Product of Rational Languages. Imre Simon |
| 1993 | Timed Testing of Concurrent Systems. Walter Vogler |
| 1993 | Treewidth and Pathwidth of Permutation Graphs. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch |
| 1993 | What is a Universal Higher-Order Programming Language? Ramarao Kanneganti, Robert Cartwright |