LEADER 00857nam0-2200265 --450 001 9910619397403321 005 20221107223810.0 100 $a20221107d1921----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $aConsole e pretore urbano nella Datio Tutoris$fSiro Solazzi 210 $aModena$cSoc. tip. modenese$d1921 215 $a13 p.$d24 cm 300 $aGià pubblicato in: Archivio giuridico, vol. 85, fasc. 2., (quarta serie, vol. 1., fasc. 2.) 676 $a340.54$v23$zita 700 1$aSolazzi,$bSiro$0236351 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910619397403321 952 $aBibl. Solazzi Busta S 367$b64375$fFGBC 952 $aBibl. Solazzi Busta S 368$b64375$fFGBC 959 $aFGBC 996 $aConsole e pretore urbano nella Datio Tutoris$92960663 997 $aUNINA LEADER 03609nam 22007215 450 001 996466368303316 005 20230330000214.0 010 $a3-319-98355-5 024 7 $a10.1007/978-3-319-98355-4 035 $a(CKB)4100000006374541 035 $a(DE-He213)978-3-319-98355-4 035 $a(MiAaPQ)EBC6287644 035 $a(PPN)230538231 035 $a(EXLCZ)994100000006374541 100 $a20180808d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAdventures Between Lower Bounds and Higher Altitudes$b[electronic resource] $eEssays Dedicated to Juraj Hromkovi? on the Occasion of His 60th Birthday /$fedited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XXIV, 642 p. 134 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11011 300 $aIncludes index. 311 $a3-319-98354-7 327 $aAutomata and Formal Languages -- Algorithmics -- Computer Science Education. 330 $aThis Festschrift volume is published in honor of Juraj Hromkovi? on the occasion of his 60th birthday. Juraj Hromkovi? 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 Hromkovi??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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11011 606 $aComputer science 606 $aArtificial intelligence 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aSocial sciences?Data processing 606 $aTheory of Computation 606 $aArtificial Intelligence 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Application in Social and Behavioral Sciences 615 0$aComputer science. 615 0$aArtificial intelligence. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aSocial sciences?Data processing. 615 14$aTheory of Computation. 615 24$aArtificial Intelligence. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Application in Social and Behavioral Sciences. 676 $a005.1 702 $aBöckenhauer$b Hans-Joachim$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKomm$b Dennis$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUnger$b Walter$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466368303316 996 $aAdventures Between Lower Bounds and Higher Altitudes$92263622 997 $aUNISA