000 01603nom a2200397 u 4500
001 10091466
003 upatras
005 20210117202852.0
008 110802s2010 eng
020 _a9783642151552
040 _aGR-PaULI
_cGR-PaULI
041 0 _aeng
100 1 _aHlinΔ›nΓ½, Petr
_996012
245 1 0 _aMathematical Foundations of Computer Science 2010
_h[electronic resource]
_b35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings
_cedited by Petr HlinΔ›nΓ½, AntonΓ­n KuΔera
260 _aBerlin, Heidelberg
_bSpringer-Verlag Berlin Heidelberg
_c2010
300 _bv.: digital
490 0 _aLecture Notes in Computer Science
_v6281
_x0302-9743
650 4 _aComputer science
_913995
650 4 _aData structures (Computer science)
_920006
650 4 _aComputer software
_924488
650 4 _aLogic design
_964563
650 4 _aComputational complexity
_920484
650 4 _aComputer Science
_964565
650 4 _aAlgorithm Analysis and Problem Complexity
_964576
650 4 _aDiscrete Mathematics in Computer Science
_964594
650 4 _aComputation by Abstract Devices
_964592
650 4 _aData Structures
_920006
650 4 _aMathematical Logic and Formal Languages
_967086
650 4 _aLogics and Meanings of Programs
_964567
700 1 _aKuΔera, AntonΓ­n
_996013
710 2 _aSpringerLink (Online service)
_968735
760 1 _aLecture notes in computer science
_g6281
_x0302-9743
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-15155-2
942 _2ddc
999 _c67166
_d67166