| 1999 | Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. | Sergio Cabello, Carles Padr, Germn Sez |
| 1999 | Iterative Arrays with a Wee Bit Alternation. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 1999 | Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars. | Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini |
| 1999 | An Interpretation of Extensible Objects. | Grard Boudol, Silvano Dal-Zilio |
| 1999 | Grammar Systems as Language Analyzers and Recursively Enumerable Languages. | Henning Bordihn, Jrgen Dassow, Gyrgy Vaszil |
| 1999 | Restrictive Acceptance Suffices for Equivalence Problems. | Bernd Borchert, Lane A. Hemaspaandra, Jrg Rothe |
| 1999 | Interpretations of Extensible Objects and Types. | Viviana Bono, Michele Bugliesi |
| 1999 | Decidable Classes of the Verification Problem in a Timed Predicate Logic. | Danile Beauquier, Anatol Slissenko |
| 1999 | A Polynomial Time Approximation Scheme for Dense MIN 2SAT. | Cristina Bazgan, Wenceslas Fernandez de la Vega |
| 1997 | Behavioural Characterizations of Partial Order Logics. | Irina B. Virbitskaite, Anzhelika Votintseva |
| 1997 | Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps. | Rakesh M. Verma |
| 1997 | Stochastic Analysis of Dynamic Processes. | Eli Upfal |
| 1997 | Synchronization of 1-Way Connected Processors. | Salvatore La Torre, Margherita Napoli, Mimmo Parente |
| 1997 | The Complexity of Universal Text-Learners. | Frank Stephan, Sebastiaan Terwijn |
| 1997 | The Complexity of Error-Correcting Codes. | Daniel A. Spielman |
| 1997 | Lower Bounds in On-Line Geometric Searching. | Sven Schuierer |
| 1997 | On an Optimal Quantified Propositional Proof System and a Complete Language for NP cap co-NP. | Zenon Sadowski |
| 1997 | From Finite Automata toward Hybrid Systems (Extended Abstract). | Alexander Moshe Rabinovich, Boris A. Trakhtenbrot |
| 1997 | The Equivalence of Pebbles and Sensing Heads for Finite Automata. | Holger Petersen |
| 1997 | FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems. | Friedrich Otto, Andrea Sattler-Klein |
| 1997 | On the Hierarchy of Nondeterministic Branching k-Programs. | Elizaveta A. Okol'nishnikova |
| 1997 | Towards Optimal Locality in Mesh-Indexings. | Rolf Niedermeier, Klaus Reinhardt, Peter Sanders |
| 1997 | On the Average Complexity of the Membership Problem for a Generalized Dyck Language. | Markus E. Nebel |
| 1997 | Locally Computable Enumerations. | Antoni W. Mazurkiewicz |
| 1997 | Trade-Off Results for Connection Management. | Marios Mavronicolas, Nikos Papadakis |