| 1999 | A Foundation of Programming a Multi-tape Quantum Turing Machine. Tomoyuki Yamakami |
| 1999 | A New Space Bound for the Modal Logics K4, KD4 and S4. Linh Anh Nguyen |
| 1999 | A Type Discipline for Solving Year 2000 Problems in COBOL Programs. Mads Tofte |
| 1999 | An Algebraic Approach to Knowledge Representation. Janis Cirulis |
| 1999 | An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover. Henning Fernau, Rolf Niedermeier |
| 1999 | An Improved Disjunctive Strictness Analysis for Lazy Functional Languages. Grzegorz Grudzinski |
| 1999 | Approximating Weak Bisimulation on Basic Process Algebras. Jitka Stríbrná |
| 1999 | Average State Complexity of Operations on Unary Automata. Cyril Nicaud |
| 1999 | Clausal Resolution for CTL Alexander Bolotov, Clare Dixon, Michael Fisher |
| 1999 | Complexity Results for Confluence Problems. Markus Lohrey |
| 1999 | Computing and Comparing Semantics of Programs in Four-Valued Logics. Yann Loyer, Nicolas Spyratos, Daniel Stamate |
| 1999 | Edge Coloring of Bipartite Graphs with Constraints. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano |
| 1999 | Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. Leszek Gasieniec, Alan Gibbons, Wojciech Rytter |
| 1999 | Efficient Strongly Universal and Optimally Universal Hashing. Philipp Woelfel |
| 1999 | Fooling Rebound Automata. Holger Petersen |
| 1999 | Football Elimination Is Hard to Decide Under the 3-Point-Rule. Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt |
| 1999 | Foundations of Modular SOS. Peter D. Mosses |
| 1999 | Generalized Regular Counting Classes. Ulrich Hertrampf |
| 1999 | Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice. Giovanni Manzini |
| 1999 | Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics. Luca Aceto, François Laroussinie |
| 1999 | Language-Based Security. Dexter Kozen |
| 1999 | Lower and Upper Bounds for the Problem of Page Replication in Ring Networks. Wlodzimierz Glazek |
| 1999 | Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki |
| 1999 | Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. Anca Muscholl, Doron A. Peled |
| 1999 | Model Checking and Higher-Order Recursion. Hardi Hungar |
| 1999 | Multiparty Communication Complexity: Very Hard Functions. Ján Manuch |
| 1999 | New Perspectives in Distributed Computing. Maurice Herlihy, Sergio Rajsbaum |
| 1999 | On Approximating the Number of Bases of Exchange Preserving Matroids. Anna Gambin |
| 1999 | On Minimum Edge Ranking Spanning Trees. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 1999 | On Plain and Hereditary History-Preserving Bisimulation. Sibylle B. Fröschle, Thomas T. Hildebrandt |
| 1999 | On Some Topological Properties of Linear Cellular Automata. Luciano Margara |
| 1999 | On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. Arnaud Durand, Miki Hermann, Laurent Juban |
| 1999 | On the Structure of the Monadic Logic of the Binary Tree. David Janin, Giacomo Lenzi |
| 1999 | On-Line Addition in Real Base. Christiane Frougny |
| 1999 | Query Languages for Real Number Databases Based on Descriptive Complexity over R. Klaus Meer |
| 1999 | Real-Time Language Recognition by One-Way and Two-Way Cellular Automata. Katsuhiko Nakamura |
| 1999 | The Arithmetical Hierarchy of Real Numbers. Xizhong Zheng, Klaus Weihrauch |
| 1999 | The Complexity of Minimizing FBDDs. Detlef Sieling |
| 1999 | The Complexity of the Extended GCD Problem. George Havas, Jean-Pierre Seifert |
| 1999 | The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes. Frank S. de Boer, Willem P. de Roever, Ulrich Hannemann |
| 1999 | Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. Jerzy Tiuryn |
| 1999 | Unique Fixed Point Induction for McCarthy's Amb. Søren B. Lassen, Andrew Moran |