Computers and games
: first international conference ; proceedings / CG '98, Tsukuba, Japan, November 11 - 12, 1998. H. Jaap van den Herik ; Hiroyuki Iida (ed.). - Berlin : Springer, 1999. - XVIII, 335 S. : Ill., graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 1558)
ISBN 978-3-540-65766-8 / 3-540-65766-5 kart. : DM 86.00
Literaturangaben
Quelle: DNB
Computers and games
: second international conference ; revised papers / CG 2000, Hamamatsu, Japan, October 26 - 28, 2000. Tony Marsland ; Ian Frank (ed.). - Berlin : Springer, 2002. - XIII, 442 S. : graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 2063)
ISBN 978-3-540-43080-3 / 3-540-43080-6 kart. : EUR 55.64
Literaturangaben
Quelle: DNB
Computer science logic
: 13th international workshop ; proceedings / CSL '99, Madrid, Spain, September 20 - 25, 1999. Jörg Flum ; Mario Rodríguez-Artalejo (ed.). - Berlin : Springer, 1999. - XI, 580 S. : graph. Darst.; 24 cm - (Annual conference of the EACSL; 8)
ISBN 978-3-540-66536-6 / 3-540-66536-6 kart. : DM 118.00
Literaturangaben
Quelle: DNB
Computing and combinatorics
: 5th annual international conference ; proceedings / COCOON '99, Tokyo, Japan, July 1999. T. Asano ... (ed.). - Berlin : Springer, 1999. - Online-Ressource - (Lecture notes in computer science; 1627)
ISBN 978-3-540-48686-2
Lizenzpflichtig
Quelle: DNB
Computing and combinatorics
: 5th annual international conference ; proceedings / COCOON '99, Tokyo, Japan, July 26 - 28, 1999. Takao Asano ... (ed.). - Berlin : Springer, 1999. - XIV, 494 S. : graph. Darst.; 24 cm - (Lecture notes in computer science; Vol. 1627)
ISBN 978-3-540-66200-6 / 3-540-66200-6 kart. : DM 110.00
Literaturangaben
Quelle: DNB
Hopcroft, John E.: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie
/ John E. Hopcroft ; Jeffrey D. Ullman. - 3., korrigierte Aufl. - Bonn : Addison-Wesley, 1994. - IX, 461 S. : graph. Darst.; 21 cm
ISBN 978-3-89319-744-6 / 3-89319-744-3 kart. : DM 58.00, sfr 56.00, S 453.00
Literaturverz. S. 435 - 452
Quelle: DNB
Hopcroft, John E.: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie
/ John E. Hopcroft ; Jeffrey Ullman. - 2. Aufl. - Bonn : Addison-Wesley, 1990. - IX, 461 S. graph. Darst.; 21 cm - (Internationale Computer-Bibliothek)
ISBN 978-3-89319-181-9 / 3-89319-181-X kart. : DM 58.00
Literaturverz. S. 437 - 452
Quelle: DNB
Entropy, search, complexity
/ Imre Csiszár ... (ed.). - Berlin : Springer, 2007. - Online-Ressource - (Bolyai Society mathematical studies; 16)
ISBN 978-3-540-32777-6
Lizenzpflichtig
Quelle: DNB
Straubing, Howard: Finite automata, formal logic, and circuit complexity
/ Howard Straubing. - Boston : Birkhäuser, 1994. - XII, 226 S.; 25 cm - (Progress in theoretical computer science; 11)
ISBN 978-3-7643-3719-3 / 3-7643-3719-2 Pp. : sfr 78.00
Literaturverz. S. 217 - 222
Quelle: DNB
Fun with algorithms
: 4th international conference, FUN 2007, Castiglioncello, Italy, June 3 - 5, 2007 ; proceedings / [Fourth International Conference on Fun with Algorithms]. Pierluigi Crescenzi ... (ed.). - Berlin : Springer, 2007. - Online-Ressource - (Lecture notes in computer science; 4475)
ISBN 978-3-540-72914-3
Lizenzpflichtig
Quelle: DNB
