| 2002 | Intersection of Regular Languages and Star Hierarchy. | Sebastian Bala |
| 2002 | Fast Universalization of Investment Strategies with Provably Good Relative Returns. | Karhan Akcoglu, Petros Drineas, Ming-Yang Kao |
| 2002 | Complete and Tractable Local Linear Time Temporal Logics over Traces. | Bharat Adsul, Milind A. Sohoni |
| 2002 | Randomized Pursuit-Evasion in Graphs. | Micah Adler, Harald Rcke, Naveen Sivadasan, Christian Sohler, Berthold Vcking |
| 2002 | Call Control in Rings. | Udo Adamy, Christoph Ambhl, R. Sai Anand, Thomas Erlebach |
| 2002 | Quantum and Stochastic Branching Programs of Bounded Width. | Farid M. Ablayev, Cristopher Moore, Chris Pollett |
| 2001 | On the Approximability of Average Completion Time Scheduling under Precedence Constraints. | Gerhard J. Woeginger |
| 2001 | Theoretical Aspects of Evolutionary Algorithms. | Ingo Wegener |
| 2001 | Foundations for Circular Compositional Reasoning. | Mahesh Viswanathan, Ramesh Viswanathan |
| 2001 | Automata, Circuits, and Hybrids: Facets of Continuous Time. | Boris A. Trakhtenbrot |
| 2001 | All-Pairs Shortest Paths Computation in the BSP Model. | Alexandre Tiskin |
| 2001 | Quick k-Median, k-Center, and Facility Location for Sparse Graphs. | Mikkel Thorup |
| 2001 | Faster Gossiping on Butterflies. | Jop F. Sibeyn |
| 2001 | Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct. | Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan |
| 2001 | Separating Quantum and Classical Learning. | Rocco A. Servedio |
| 2001 | Lower Bounds in the Quantum Cell Probe Model. | Pranab Sen, Srinivasan Venkatesh |
| 2001 | On the Online Bin Packing Problem. | Steven S. Seiden |
| 2001 | Amalgamation in CASL via Enriched Signatures. | Lutz Schrder, Till Mossakowski, Andrzej Tarlecki |
| 2001 | A Distributed Abstract Machine for Safe Ambients. | Davide Sangiorgi, Andrea Valente |
| 2001 | Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. | Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama |
| 2001 | A New Method for Balancing Binary Search Trees. | Salvador Roura |
| 2001 | Combinatorics of Periods in Strings. | Eric Rivals, Sven Rahmann |
| 2001 | Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. | Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa |
| 2001 | Algorithms, Games, and the Internet. | Christos H. Papadimitriou |
| 2001 | Modelling with Partial Orders - Why and Why Not? | Mogens Nielsen |