| 2003 | A Discrete Subexponential Algorithm for Parity Games. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov |
| 2003 | Adaptive Sorting and the Information Theoretic Lower Bound. Amr Elmasry, Michael L. Fredman |
| 2003 | Algebraic Characterizations of Small Classes of Boolean Functions. Ricard Gavaldà, Denis Thérien |
| 2003 | Algebras of Minimal Rank over Arbitrary Fields. Markus Bläser |
| 2003 | Algorithms for Transposition Invariant String Matching. Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen |
| 2003 | Alternative Algorithms for Counting All Matchings in Graphs. Piotr Sankowski |
| 2003 | An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2003 | Analysis of the Harmonic Algorithm for Three Servers. Marek Chrobak, Jirí Sgall |
| 2003 | Approximating Geometric Bottleneck Shortest Paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
| 2003 | Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. Petr Hlinený |
| 2003 | Cake-Cutting Is Not a Piece of Cake. Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy |
| 2003 | Colouring Random Graphs in Expected Polynomial Time. Amin Coja-Oghlan, Anusch Taraz |
| 2003 | Competing Provers Yield Improved Karp-Lipton Collapse Results. Jin-Yi Cai, Venkatesan T. Chakaravarthy, Lane A. Hemaspaandra, Mitsunori Ogihara |
| 2003 | Complete Classifications for the Communication Complexity of Regular Languages. Pascal Tesson, Denis Thérien |
| 2003 | Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. Beate Bollig |
| 2003 | Computing Shortest Paths with Uncertainty. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
| 2003 | Cryptographically Sound and Machine-Assisted Verification of Security Protocols. Michael Backes, Christian Jacobi |
| 2003 | Decidable Theories of Cayley-Graphs. Dietrich Kuske, Markus Lohrey |
| 2003 | Distributed Soft Path Coloring. Peter Damaschke |
| 2003 | Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. Véronique Bruyère, Emmanuel Dall'Olio, Jean-François Raskin |
| 2003 | Evolutionary Algorithms and the Maximum Matching Problem. Oliver Giel, Ingo Wegener |
| 2003 | Fast Algorithms for Extended Regular Expression Matching and Searching. Lucian Ilie, Baozhen Shan, Sheng Yu |
| 2003 | Faster Deterministic Broadcasting in Ad Hoc Radio Networks. Dariusz R. Kowalski, Andrzej Pelc |
| 2003 | Finding Large Independent Sets in Polynomial Expected Time. Amin Coja-Oghlan |
| 2003 | How Does Computer Science Change Molecular Biology? Alain Viari |
| 2003 | Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun |
| 2003 | Lattice Reduction by Random Sampling and Birthday Methods. Claus-Peter Schnorr |
| 2003 | Logic as a Query Language: From Frege to XML. Victor Vianu |
| 2003 | Non-clairvoyant Scheduling for Minimizing Mean Slowdown. Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha |
| 2003 | On Sand Automata. Julien Cervelle, Enrico Formenti |
| 2003 | On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. Thomas Erlebach, Stamatis Stefanakos |
| 2003 | On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets. Anton Mityagin |
| 2003 | On the Confluence of Linear Shallow Term Rewrite Systems. Guillem Godoy, Ashish Tiwari, Rakesh M. Verma |
| 2003 | On the Difficulty of Some Shortest Path Problems. John Hershberger, Subhash Suri, Amit M. Bhosle |
| 2003 | On the Effective Jordan Decomposability. Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl |
| 2003 | On the Representation of Boolean Predicates of the Diffie-Hellman Function. Eike Kiltz |
| 2003 | On the Ultimate Complexity of Factorials. Qi Cheng |
| 2003 | One Bit of Advice. Harry Buhrman, Richard Chang, Lance Fortnow |
| 2003 | Optimization in Arrangements. Stefan Langerman, William L. Steiger |
| 2003 | Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen |
| 2003 | Private Computations in Networks: Topology versus Randomness. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
| 2003 | Quantum Circuits with Unbounded Fan-out. Peter Høyer, Robert Spalek |
| 2003 | Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. Hervé Brönnimann, Frédéric Cazals, Marianne Durand |
| 2003 | Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs. Martin Sauerhoff |
| 2003 | Rectangle Visibility Graphs: Characterization, Construction, and Compaction. Ileana Streinu, Sue Whitesides |
| 2003 | Representing Graph Metrics with Fewest Edges. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy |
| 2003 | STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings Helmut Alt, Michel Habib |
| 2003 | Solving Order Constraints in Logarithmic Space. Andrei A. Krokhin, Benoît Larose |
| 2003 | Some Results on Derandomization. Harry Buhrman, Lance Fortnow, Aduri Pavan |
| 2003 | Space Efficient Hash Tables with Worst Case Constant Access Time. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis |
| 2003 | Strong Reductions and Immunity for Exponential Time. Marcus Schaefer, Frank Stephan |
| 2003 | Strong Stability in the Hospitals/Residents Problem. Robert W. Irving, David F. Manlove, Sandy Scott |
| 2003 | The Commutation with Codes and Ternary Sets of Words. Juhani Karhumäki, Michel Latteux, Ion Petre |
| 2003 | The Complexity of Membership Problems for Circuits over Sets of Natural Numbers. Pierre McKenzie, Klaus W. Wagner |
| 2003 | The Complexity of Resolution with Generalized Symmetry Rules. Stefan Szeider |
| 2003 | The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. Arnaud Durand, Miki Hermann |
| 2003 | The Intrinsic Universality Problem of One-Dimensional Cellular Automata. Nicolas Ollinger |
| 2003 | The Inversion Problem for Computable Linear Operators. Vasco Brattka |
| 2003 | The Price of Truth: Frugality in Truthful Mechanisms. Kunal Talwar |
| 2003 | Untameable Timed Automata! Patricia Bouyer |
| 2003 | Wadge Degrees of omega-Languages of Deterministic Turing Machines. Victor L. Selivanov |