000 | 01775nam a22004815i 4500 | ||
---|---|---|---|
001 | 978-3-642-22993-0 | ||
003 | DE-He213 | ||
005 | 20130515022235.0 | ||
007 | cr nn 008mamaa | ||
008 | 110809s2011 gw | s |||| 0|eng d | ||
020 |
_a9783642229930 _9978-3-642-22993-0 |
||
024 | 7 |
_a10.1007/978-3-642-22993-0 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 | _aMurlak, Filip. | |
245 | 1 | 0 |
_aMathematical Foundations of Computer Science 2011 _h[electronic resource] : _b36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings / _cedited by Filip Murlak, Piotr Sankowski. |
260 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
||
300 | _bdigital. | ||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6907 |
|
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aComputational complexity. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
700 | 1 | _aSankowski, Piotr. | |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642229923 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6907 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-22993-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 |
_c85501 _d85501 |