| 2001 | A Characterization of Temporal Locality and Its Portability across Memory Hierarchies. Gianfranco Bilardi, Enoch Peserico |
| 2001 | A Distributed Abstract Machine for Safe Ambients. Davide Sangiorgi, Andrea Valente |
| 2001 | A Framework for Index Bulk Loading and Dynamization. Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2001 | A New Method for Balancing Binary Search Trees. Salvador Roura |
| 2001 | A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. Chandra Chekuri, Sanjeev Khanna |
| 2001 | A Set-Theoretic Framework for Assume-Guarantee Reasoning. Patrick Maier |
| 2001 | Algorithms, Games, and the Internet. Christos H. Papadimitriou |
| 2001 | All-Pairs Shortest Paths Computation in the BSP Model. Alexandre Tiskin |
| 2001 | Amalgamation in CASL via Enriched Signatures. Lutz Schröder, Till Mossakowski, Andrzej Tarlecki |
| 2001 | An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS. Furio Honsell, Marino Miculan, Ivan Scagnetto |
| 2001 | Approximating the Minimum Spanning Tree Weight in Sublinear Time. Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan |
| 2001 | Approximation Algorithms for Partial Covering Problems. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
| 2001 | Approximation Hardness of TSP with Bounded Metrics. Lars Engebretsen, Marek Karpinski |
| 2001 | Automata, Circuits, and Hybrids: Facets of Continuous Time. Boris A. Trakhtenbrot |
| 2001 | Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen |
| 2001 | Axiomatizations for Probabilistic Bisimulation. Emanuele Bandini, Roberto Segala |
| 2001 | Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama |
| 2001 | Combinatorics of Periods in Strings. Eric Rivals, Sven Rahmann |
| 2001 | Combinatorics of Three-Interval Exchanges. Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni |
| 2001 | Communication Gap for Finite Memory Devices. Tomasz Jurdzinski, Miroslaw Kutylowski |
| 2001 | Decidable Properties of Graphs of All-Optical Networks. Luciano Margara, Janos Simon |
| 2001 | Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa |
| 2001 | Distributed Controller Synthesis for Local Specifications. P. Madhusudan, P. S. Thiagarajan |
| 2001 | Division Is in Uniform TC William Hesse |
| 2001 | Effective Lossy Queue Languages. Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani |
| 2001 | Efficient Generation of Plane Triangulations without Repetitions. Zhangjian Li, Shin-Ichi Nakano |
| 2001 | Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. Kousha Etessami, Thomas Wilke, Rebecca A. Schuller |
| 2001 | Faster Gossiping on Butterflies. Jop F. Sibeyn |
| 2001 | Finite-State Dimension. Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo |
| 2001 | Foundations for Circular Compositional Reasoning. Mahesh Viswanathan, Ramesh Viswanathan |
| 2001 | Fractional Path Coloring with Applications to WDM Networks. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano |
| 2001 | From Finite State Communication Protocols to High-Level Message Sequence Charts. Anca Muscholl, Doron A. Peled |
| 2001 | Hidden Pattern Statistics. Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée |
| 2001 | Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Georg Gottlob, Reinhard Pichler |
| 2001 | Improved Lower Bounds on the Randomized Complexity of Graph Properties. Amit Chakrabarti, Subhash Khot |
| 2001 | Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical. Markus Bläser |
| 2001 | Information-Theoretic Private Information Retrieval: A Unified Construction. Amos Beimel, Yuval Ishai |
| 2001 | Integrating Semantics for Object-Oriented System Models. Martin Große-Rhode |
| 2001 | Knuth-Bendix Constraint Solving Is NP-Complete. Konstantin Korovin, Andrei Voronkov |
| 2001 | Languages, Rewriting Systems, and Verification of Infinite-State Systems. Ahmed Bouajjani |
| 2001 | Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban |
| 2001 | Lower Bounds in the Quantum Cell Probe Model. Pranab Sen, Srinivasan Venkatesh |
| 2001 | Majority Consensus and the Local Majority Rule. Nabil H. Mustafa, Aleksandar Sasa Pekec |
| 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 | Model Checking of Unrestricted Hierarchical State Machines. Michael Benedikt, Patrice Godefroid, Thomas W. Reps |
| 2001 | Modelling with Partial Orders - Why and Why Not? Mogens Nielsen |
| 2001 | New Imperfect Random Source with Applications to Coin-Flipping. Yevgeniy Dodis |
| 2001 | Noninterference for Concurrent Programs. Gérard Boudol, Ilaria Castellani |
| 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 | On Interactive Proofs with a Laconic Prover. Oded Goldreich, Salil P. Vadhan, Avi Wigderson |
| 2001 | On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab |
| 2001 | On the Approximability of Average Completion Time Scheduling under Precedence Constraints. Gerhard J. Woeginger |
| 2001 | On the Completeness of Arbitrary Selection Strategies for Paramodulation. Miquel Bofill, Guillem Godoy |
| 2001 | On the Online Bin Packing Problem. Steven S. Seiden |
| 2001 | Online Packet Routing on Linear Arrays and Rings. Jessen T. Havill |
| 2001 | Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds. Birgit Baum-Waidner |
| 2001 | Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems. Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | Performance Aspects of Distributed Caches Using TTL-Based Consistency. Edith Cohen, Eran Halperin, Haim Kaplan |
| 2001 | Permutation Editing and Matching via Embeddings. Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp |
| 2001 | Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Peter Høyer, Jan Neerbek, Yaoyun Shi |
| 2001 | Quick k-Median, k-Center, and Facility Location for Sparse Graphs. Mikkel Thorup |
| 2001 | Rational Transformations of Formal Power Series. Manfred Droste, Guo-Qiang Zhang |
| 2001 | Realizability and Verification of MSC Graphs. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis |
| 2001 | Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. P. Madhusudan |
| 2001 | Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently. Joel Friedman, Andreas Goerdt |
| 2001 | Routing in Trees. Pierre Fraigniaud, Cyril Gavoille |
| 2001 | Secure Games with Polynomial Expressions. Aggelos Kiayias, Moti Yung |
| 2001 | Secure Multiparty Computation of Approximations. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin Strauss, Rebecca N. Wright |
| 2001 | Separating Quantum and Classical Learning. Rocco A. Servedio |
| 2001 | Solvability of Equations in Free Partially Commutative Groups Is Decidable. Volker Diekert, Anca Muscholl |
| 2001 | Subexponential Parameterized Algorithms Collapse the W-Hierarchy. Liming Cai, David W. Juedes |
| 2001 | Symbolic Trace Analysis of Cryptographic Protocols. Michele Boreale |
| 2001 | Testing Hypergraph Coloring. Artur Czumaj, Christian Sohler |
| 2001 | The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger |
| 2001 | The Complexity of Computing the Size of an Interval. Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner |
| 2001 | The Complexity of Constructing Evolutionary Trees Using Experiments. Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin |
| 2001 | The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen |
| 2001 | The RPR Uriel Feige, Michael Langberg |
| 2001 | The Star Problem in Trace Monoids: Reductions Beyond C4. Daniel Kirsten |
| 2001 | The Trace Coding Problem Is Undecidable. Michal Kunc |
| 2001 | Theoretical Aspects of Evolutionary Algorithms. Ingo Wegener |
| 2001 | Time and Space Bounds for Reversible Simulation. Harry Buhrman, John Tromp, Paul M. B. Vitányi |
| 2001 | Total Colorings of Degenerated Graphs. Shuji Isobe, Xiao Zhou, Takao Nishizeki |
| 2001 | Towards Quantitative Verification of Probabilistic Transition Systems. Franck van Breugel, James Worrell |
| 2001 | Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. Hubert Comon, Véronique Cortier, John Mitchell |
| 2001 | Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher. Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa |
| 2001 | Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations. Martin Fürer |