| 2003 | A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot |
| 2003 | A Completeness Property of Wilke's Tree Algebras. Saeed Salehi |
| 2003 | A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger |
| 2003 | A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. Zhi-Zhong Chen, Mitsuharu Kouno |
| 2003 | A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. Slawomir Lasota |
| 2003 | A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. Bas Luttik |
| 2003 | ACID-Unification Is NEXPTIME-Decidable. Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch |
| 2003 | Adversarial Models for Priority-Based Networks. Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna |
| 2003 | An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources. Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos |
| 2003 | Approximation Schemes for the Min-Max Starting Time Problem. Leah Epstein, Tamir Tassa |
| 2003 | Arithmetic Constant-Depth Circuit Complexity Classes. Hubie Chen |
| 2003 | Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs. Toshimasa Ishii, Masayuki Hagiwara |
| 2003 | Characterizations of Catalytic Membrane Computing Systems. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena |
| 2003 | Completeness in Differential Approximation Classes. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
| 2003 | Computing Average Value in Ad Hoc Networks. Miroslaw Kutylowski, Daniel Letkiewicz |
| 2003 | Constructing Infinite Graphs with a Decidable MSO-Theory. Wolfgang Thomas |
| 2003 | Denotational Testing Semantics in Coinductive Form. Michele Boreale, Fabio Gadducci |
| 2003 | Distributed Quantum Computing. Harry Buhrman, Hein Röhrig |
| 2003 | Error-Bounded Probabilistic Computations between MA and AM. Elmar Böhler, Christian Glaßer, Daniel Meister |
| 2003 | Ershov's Hierarchy of Real Numbers. Xizhong Zheng, Robert Rettinger, Romain Gengler |
| 2003 | Faster Algorithms for Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2003 | Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. Víctor Dalmau, Daniel K. Ford |
| 2003 | Generic Algorithms for the Generation of Combinatorial Objects. Conrado Martínez, Xavier Molinero |
| 2003 | Inferring Strings from Graphs and Arrays. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2003 | Inverse NP Problems. Hubie Chen |
| 2003 | LTL with Past and Two-Way Very-Weak Alternating Automata. Paul Gastin, Denis Oddoux |
| 2003 | Linear-Time Computation of Local Periods. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre |
| 2003 | Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
| 2003 | Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 2003 | Match-Bounded String Rewriting Systems. Alfons Geser, Dieter Hofbauer, Johannes Waldmann |
| 2003 | Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings Branislav Rovan, Peter Vojtás |
| 2003 | On Converting CNF to DNF. Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
| 2003 | On Matroid Properties Definable in the MSO Logic. Petr Hlinený |
| 2003 | On Optimal Merging Networks. Kazuyuki Amano, Akira Maruoka |
| 2003 | On Probabilistic Quantified Satisfability Games. Marcin Rychlik |
| 2003 | On Selection Functions that Do Not Preserve Normality. Wolfgang Merkle, Jan Reimann |
| 2003 | On the Complexity of Some Equivalence Problems for Propositional Calculi. Steffen Reith |
| 2003 | On the Complexity of Some Problems in Interval Arithmetic. Klaus Meer |
| 2003 | On the Computational Complexity of Conservative Computing. Giancarlo Mauri, Alberto Leporati |
| 2003 | On the Length of the Minimum Solution of Word Equations in One Variable. Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda |
| 2003 | Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. François Blanchard, Julien Cervelle, Enrico Formenti |
| 2003 | Probabilistic and Nondeterministic Unary Automata. Gregor Gramlich |
| 2003 | Problems with Cannot Be Reduced to Any Proper Subproblems. Klaus Ambos-Spies |
| 2003 | Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols. Roberto Gorrieri, Fabio Martinelli |
| 2003 | Quantified Mu-Calculus for Control Synthesis. Stéphane Riedweg, Sophie Pinchinat |
| 2003 | Quantum Testers for Hidden Group Properties. Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen |
| 2003 | Randomized Algorithms for Determining the Majority on Graphs. Gianluca De Marco, Andrzej Pelc |
| 2003 | Relating Hierarchy of Temporal Properties to Model Checking. Ivana Cerná, Radek Pelánek |
| 2003 | Scheduling and Traffic Allocation for Tasks with Bounded Splittability. Piotr Krysta, Peter Sanders, Berthold Vöcking |
| 2003 | Selfish Routing in Non-cooperative Networks: A Survey. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode |
| 2003 | Semantic and Syntactic Approaches to Simulation Relations. Jo Erskine Hannay, Shin-ya Katsumata, Donald Sannella |
| 2003 | Smoothed Analysis of Three Combinatorial Problems. Cyril Banderier, René Beier, Kurt Mehlhorn |
| 2003 | Solving the Sabotage Game Is PSPACE-Hard. Christof Löding, Philipp Rohde |
| 2003 | Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| 2003 | Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. Michele Boreale, Maria Grazia Buscemi |
| 2003 | Symbolic Topological Sorting with OBDDS. Philipp Woelfel |
| 2003 | The Approximate Well-Founded Semantics for Logic Programs with Uncertainty. Yann Loyer, Umberto Straccia |
| 2003 | The Minimal Graph Model of Lambda Calculus. Antonio Bucciarelli, Antonino Salibra |
| 2003 | Towards a Theory of Randomized Search Heuristics. Ingo Wegener |
| 2003 | Two Dimensional Packing: The Power of Rotation. Leah Epstein |
| 2003 | Unambiguous Automata on Bi-infinite Words. Olivier Carton |
| 2003 | Using Transitive-Closure Logic for Deciding Linear Properties of Monoids. Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas |
| 2003 | Which Is the Worst-Case Nash Equilibrium? Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |