國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Adventures between lower bounds and ...

Bockenhauer, Hans-Joachim.

Adventures between lower bounds and higher altitudesessays dedicated to Juraj Hromkovic on the occasion of his 60th birthday /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Adventures between lower bounds and higher altitudesedited by Hans-Joachim Bockenhauer, Dennis Komm, Walter Unger.
其他題名:	essays dedicated to Juraj Hromkovic on the occasion of his 60th birthday /
其他作者:	Bockenhauer, Hans-Joachim.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xxiv, 642 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithms.
電子資源:	https://doi.org/10.1007/978-3-319-98355-4
ISBN:	9783319983554$q(electronic bk.)

Adventures between lower bounds and higher altitudesessays dedicated to Juraj Hromkovic on the occasion of his 60th birthday /
Adventures between lower bounds and higher altitudesessays dedicated to Juraj Hromkovic on the occasion of his 60th birthday /[electronic resource] :edited by Hans-Joachim Bockenhauer, Dennis Komm, Walter Unger. - Cham :Springer International Publishing :2018. - xxiv, 642 p. :ill., digital ;24 cm. - Lecture notes in computer science,110110302-9743 ;. - Lecture notes in computer science ;4891..

Automata and Formal Languages -- Algorithmics -- Computer Science Education.

This Festschrift volume is published in honor of Juraj Hromkovic on the occasion of his 60th birthday. Juraj Hromkovic is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education. The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovic's research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.

ISBN: 9783319983554$q(electronic bk.)

Standard No.: 10.1007/978-3-319-98355-4doiSubjects--Topical Terms:

184478
Computer algorithms.

LC Class. No.: QA76.9.A43 / A38 2018

Dewey Class. No.: 005.1

Adventures between lower bounds and higher altitudesessays dedicated to Juraj Hromkovic on the occasion of his 60th birthday /
LDR:02127nmm a2200361 a 4500 001 543756
003 DE-He213
005 20180829125546.0
006 m d
007 cr nn 008maaau
008 190430s2018 gw s 0 eng d
020 $a 9783319983554$q(electronic bk.)
020 $a 9783319983547$q(paper)
024 7 $a 10.1007/978-3-319-98355-4 $2 doi
035 $a 978-3-319-98355-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b A38 2018
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b A244 2018
245 0 0 $a Adventures between lower bounds and higher altitudes $h [electronic resource] : $b essays dedicated to Juraj Hromkovic on the occasion of his 60th birthday / $c edited by Hans-Joachim Bockenhauer, Dennis Komm, Walter Unger.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xxiv, 642 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11011
490 1 $a Theoretical computer science and general issues
505 0 $a Automata and Formal Languages -- Algorithmics -- Computer Science Education.
520 $a This Festschrift volume is published in honor of Juraj Hromkovic on the occasion of his 60th birthday. Juraj Hromkovic is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education. The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovic's research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.
650 0 $a Computer algorithms. $3 184478
650 0 $a Computer science $x Study and teaching. $3 288647
650 0 $a Formal languages. $3 214985
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer Appl. in Social and Behavioral Sciences. $3 274376
700 1 $a Bockenhauer, Hans-Joachim. $3 822029
700 1 $a Komm, Dennis. $3 761232
700 1 $a Unger, Walter. $3 822030
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-319-98355-4
950 $a Computer Science (Springer-11645)