| 1999 | Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types. | Jerzy Tiuryn |
| 1999 | Approximating Weak Bisimulation on Basic Process Algebras. | Jitka Strbrn |
| 1999 | The Complexity of Minimizing FBDDs. | Detlef Sieling |
| 1999 | Fooling Rebound Automata. | Holger Petersen |
| 1999 | Average State Complexity of Operations on Unary Automata. | Cyril Nicaud |
| 1999 | A New Space Bound for the Modal Logics K4, KD4 and S4. | Linh Anh Nguyen |
| 1999 | Real-Time Language Recognition by One-Way and Two-Way Cellular Automata. | Katsuhiko Nakamura |
| 1999 | Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces. | Anca Muscholl, Doron A. Peled |
| 1999 | Foundations of Modular SOS. | Peter D. Mosses |
| 1999 | Query Languages for Real Number Databases Based on Descriptive Complexity over R. | Klaus Meer |
| 1999 | On Some Topological Properties of Linear Cellular Automata. | Luciano Margara |
| 1999 | Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice. | Giovanni Manzini |
| 1999 | Multiparty Communication Complexity: Very Hard Functions. | Jn Manuch |
| 1999 | On Minimum Edge Ranking Spanning Trees. | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
| 1999 | Computing and Comparing Semantics of Programs in Four-Valued Logics. | Yann Loyer, Nicolas Spyratos, Daniel Stamate |
| 1999 | Complexity Results for Confluence Problems. | Markus Lohrey |
| 1999 | Unique Fixed Point Induction for McCarthy's Amb. | Sren B. Lassen, Andrew Moran |
| 1999 | Language-Based Security. | Dexter Kozen |
| 1999 | On the Structure of the Monadic Logic of the Binary Tree. | David Janin, Giacomo Lenzi |
| 1999 | Model Checking and Higher-Order Recursion. | Hardi Hungar |
| 1999 | Generalized Regular Counting Classes. | Ulrich Hertrampf |
| 1999 | New Perspectives in Distributed Computing. | Maurice Herlihy, Sergio Rajsbaum |
| 1999 | The Complexity of the Extended GCD Problem. | George Havas, Jean-Pierre Seifert |
| 1999 | An Improved Disjunctive Strictness Analysis for Lazy Functional Languages. | Grzegorz Grudzinski |
| 1999 | Lower and Upper Bounds for the Problem of Page Replication in Ring Networks. | Wlodzimierz Glazek |