| 2001 | Towards Quantitative Verification of Probabilistic Transition Systems. | Franck van Breugel, James Worrell |
| 2001 | Noninterference for Concurrent Programs. | Grard Boudol, Ilaria Castellani |
| 2001 | Languages, Rewriting Systems, and Verification of Infinite-State Systems. | Ahmed Bouajjani |
| 2001 | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2001 | Symbolic Trace Analysis of Cryptographic Protocols. | Michele Boreale |
| 2001 | On the Completeness of Arbitrary Selection Strategies for Paramodulation. | Miquel Bofill, Guillem Godoy |
| 2001 | Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical. | Markus Blser |
| 2001 | A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. | Gianfranco Bilardi, Enoch Peserico |
| 2001 | Model Checking of Unrestricted Hierarchical State Machines. | Michael Benedikt, Patrice Godefroid, Thomas W. Reps |
| 2001 | Information-Theoretic Private Information Retrieval: A Unified Construction. | Amos Beimel, Yuval Ishai |
| 2001 | Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds. | Birgit Baum-Waidner |
| 2001 | Axiomatizations for Probabilistic Bisimulation. | Emanuele Bandini, Roberto Segala |
| 2001 | Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. | Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban |
| 2001 | Realizability and Verification of MSC Graphs. | Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
| 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | A Framework for Index Bulk Loading and Dynamization. | Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2001 | Effective Lossy Queue Languages. | Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani |
| 2000 | Introduction: Workshop on Intersection Types and Related Systems (ITRS'00). | J. B. Wells |
| 2000 | OpenSESAME: A Tool's Concept. | M. Walter |
| 2000 | Temporal Rewards for Performance Evaluation. | Jeroen Voeten |
| 2000 | Introduction: Approximation and Randomized Algorithms in Communication Networks. | Ugo Vaccaro |
| 2000 | On Deciding if Deterministic Rabin Language Is in Bchi Class. | Tomasz Fryderyk Urbanski |
| 2000 | Approximating Variance in Non-product Form Decomposed Models. | Nigel Thomas, Jeremy T. Bradley |
| 2000 | Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph. | Edyta Szymanska |
| 2000 | Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and Algorithms. | Detlef Sieling |