Jos C.M. Baeten; Jan Karel Lenstra; Joachim Parrow; Gerhard J. Woeginger Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2003) Pehmeäkantinen kirja
Magdalena Holzhey; Katharina Neuburger; Kornelia Röder; Hans Dickel; Antje von Graevenitz; Gerhard Graulich; C Lerm Hayes Hatje Cantz (2021) Kovakantinen kirja
Gerhard Höhler; Atsushi Fujimori; Johann Kühn; Thomas Müller; Frank Steiner; William C. Stwalley; Joachim E. Trümper; Wöl Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2013) Pehmeäkantinen kirja
Gerhard Höhler; Atsushi Fujimori; Johann Kühn; Thomas Müller; Frank Steiner; William C. Stwalley; Joachim E. Trümper; Wöl Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2013) Pehmeäkantinen kirja
Gerhard Höhler; Atsushi Fujimori; Johann Kühn; Thomas Müller; Frank Steiner; William C. Stwalley; Joachim E. Trümper; Wöl Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2014) Pehmeäkantinen kirja
Erich C. Wittmann; Gerhard N. Müller; Marcus Nührenbörger; Ralph Schwarzkopf; Melanie Bischoff; Daniela Götze; Brgit Heß Klett Ernst /Schulbuch (2018) Pehmeäkantinen kirja
Gerhard Höhler; Atsushi Fujimori; Johann Kühn; Thomas Müller; Frank Steiner; William C. Stwalley; Joachim E. Trümper; Wöl Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2013) Pehmeäkantinen kirja
The refereed proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, held in Eindhoven, The Netherlands in June/July 2003. The 84 revised full papers presented together with six invited papers were carefully reviewed and selected from 212 submissions. The papers are organized in topical sections on algorithms, process algebra, approximation algorithms, languages and programming, complexity, data structures, graph algorithms, automata, optimization and games, graphs and bisimulation, online problems, verification, the Internet, temporal logic and model checking, graph problems, logic and lambda-calculus, data structures and algorithms, types and categories, probabilistic systems, sampling and randomness, scheduling, and geometric problems.