| 2004 | A Hierarchy of Irreducible Sofic Shifts. | Marie-Pierre Bal, Francesca Fiorenzi, Dominique Perrin |
| 2004 | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times. | Nadine Baumann, Ekkehard Khler |
| 2004 | One Query Reducibilities Between Partial Information Classes. | Sebastian Bab, Arfst Nickelsen |
| 2004 | Extraction and Implication of Path Constraints. | Yves Andre, Anne-Ccile Caron, Denis Debarbieux, Yves Roos, Sophie Tison |
| 2004 | Computational Aspects of Disjunctive Sequences. | Klaus Ambos-Spies, Edgar Busse |
| 2003 | Ershov's Hierarchy of Real Numbers. | Xizhong Zheng, Robert Rettinger, Romain Gengler |
| 2003 | Symbolic Topological Sorting with OBDDS. | Philipp Woelfel |
| 2003 | Towards a Theory of Randomized Search Heuristics. | Ingo Wegener |
| 2003 | Constructing Infinite Graphs with a Decidable MSO-Theory. | Wolfgang Thomas |
| 2003 | A Completeness Property of Wilke's Tree Algebras. | Saeed Salehi |
| 2003 | On Probabilistic Quantified Satisfability Games. | Marcin Rychlik |
| 2003 | Quantified Mu-Calculus for Control Synthesis. | Stphane Riedweg, Sophie Pinchinat |
| 2003 | On the Complexity of Some Equivalence Problems for Propositional Calculi. | Steffen Reith |
| 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 | On Converting CNF to DNF. | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
| 2003 | On Selection Functions that Do Not Preserve Normality. | Wolfgang Merkle, Jan Reimann |
| 2003 | An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources. | Carlo Meghini, Yannis Tzitzikas, Nicolas Spyratos |
| 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 | Generic Algorithms for the Generation of Combinatorial Objects. | Conrado Martnez, Xavier Molinero |
| 2003 | Randomized Algorithms for Determining the Majority on Graphs. | Gianluca De Marco, Andrzej Pelc |
| 2003 | A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory. | Bas Luttik |
| 2003 | Which Is the Worst-Case Nash Equilibrium? | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
| 2003 | The Approximate Well-Founded Semantics for Logic Programs with Uncertainty. | Yann Loyer, Umberto Straccia |
| 2003 | Solving the Sabotage Game Is PSPACE-Hard. | Christof Lding, Philipp Rohde |