Berthold Vöcking; Helmut Alt; Martin Dietzfelbinger; Rüdiger Reischuk; Christian Scheideler; Heribert Vollmer; Dor Wagner Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2008) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Nicolò Cesa-Bianchi; Masayuki Numao; Rüdiger Reischuk Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2002) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Berthold Vöcking; Helmut Alt; Martin Dietzfelbinger; Rüdiger Reischuk; Christian Scheideler; Heribert Vollmer; Dor Wagner Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2011) Saatavuus: Tilaustuote Kovakantinen kirja
Andreas Brandstädt; Klaus Jansen; Rüdiger Reischuk Springer-Verlag Berlin and Heidelberg GmbH & Co. KG (2013) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Herbert Fiedler; Oliver Günther; Werner Grass; Steffen Hölldobler; Günter Hotz; K. Rüdiger Reischuk; Bernhard Seeger; Wag Springer Fachmedien Wiesbaden (2000) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Berthold Vöcking (ed.); Helmut Alt (ed.); Martin Dietzfelbinger (ed.); Rüdiger Reischuk (ed.); Christian Scheideler (ed.) Springer (2016) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Wolfgang Bibel; H. Fiedler; W. Grass; Peter Gorny; Otto Kerner; K. Rüdiger Reischuk; Friedrich Roithmayr Springer Fachmedien Wiesbaden (1998) Saatavuus: Tilaustuote Pehmeäkantinen kirja
Springer Sivumäärä: 621 sivua Asu: Pehmeäkantinen kirja Painos: 1997 Julkaisuvuosi: 1997, 21.02.1997 (lisätietoa) Kieli: Englanti
This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference.