Algorithm theory
: proceedings / SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 8 - 10, 1998. Stefan Arnborg ; Lars Ivansson (ed.). - Berlin : Springer, 1998. - IX, 346 S. : graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 1432)
ISBN 978-3-540-64682-2 / 3-540-64682-5 kart. : DM 82.00
Literaturangaben
Quelle: DNB
Algorithm theory
: proceedings / SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3 - 5, 2002. M. Penttonen ... (ed.). - Berlin : Springer, 2002. - Online-Ressource - (Lecture notes in computer science; 2368)
ISBN 978-3-540-45471-7
Lizenzpflichtig
Quelle: DNB
Algorithm theory
: proceedings / SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July 1998. Stefan Arnborg ... (ed.). - Berlin : Springer, 2002. - Online-Ressource - (Lecture notes in computer science; 1432)
ISBN 978-3-540-69106-8
Lizenzpflichtig
Quelle: DNB
Algorithm theory
: proceedings / SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 2000. Magnús M. Halldórsson (ed.). - Berlin : Springer, 2002. - Online-Ressource - (Lecture notes in computer science; 1851)
ISBN 978-3-540-44985-0
Lizenzpflichtig
Quelle: DNB
Algorithm theory
: proceedings / SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2 - 4, 2008. Joachim Gudmundsson (ed.). - Berlin : Springer, 2008. - Online-Ressource - (Lecture notes in computer science; Vol. 5124)
ISBN 978-3-540-69903-3
Lizenzpflichtig
Quelle: DNB
Gasarch, William I.: Bounded queries in recursion theory
/ William I. Gasarch ; Georgia A. Martin. - Boston : Birkhäuser, 1999. - XIII, 353 S. : graph. Darst.; 25 cm - (Progress in computer science and applied logic; Vol. 16)
ISBN 978-3-7643-3966-1 / 3-7643-3966-7 Kunststoff : sfr 88.00
Literaturverz. S. 325 - 329
Quelle: DNB
Hromkovič, Juraj: Communication comlexity and parallel computing
/ Juraj Hromkovič. - Berlin : Springer, 1997. - X, 336 S. : graph. Darst.; 25 cm - (Texts in theoretical computer science)
ISBN 978-3-540-57459-0 / 3-540-57459-X Pp. : DM 58.00
Literaturverz. S. 317 - 330
Quelle: DNB
Computability and complexity in analysis
: 4th international workshop ; selected papers / CCA 2000, Swansea, UK, September 17 - 19, 2000. J. Blanck ... (ed.). - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 2064)
ISBN 978-3-540-45335-2
Lizenzpflichtig
Quelle: DNB
Thierauf, Thomas: The computational complexity of equivalence and isomorphism problems
/ Thomas Thierauf. - Berlin : Springer, 2000. - VIII, 135 S.; 24 cm - (Lecture notes in computer science; Vol. 1852)
ISBN 978-3-540-41032-4 / 3-540-41032-5 kart. : DM 66.00
Literaturverz. S. 121 - 130
Quelle: DNB
The computational complexity of equivalence and isomorphism problems
/ Thomas Thierauf. - Berlin : Springer, 2001. - Online-Ressource - (Lecture notes in computer science; 1852)
ISBN 978-3-540-45303-1
Lizenzpflichtig
Quelle: DNB
