000 | 02879nam a22005175i 4500 | ||
---|---|---|---|
001 | u376583 | ||
003 | SIRSI | ||
005 | 20160812084420.0 | ||
007 | cr nn 008mamaa | ||
008 | 110809s2011 gw | s |||| 0|eng d | ||
020 |
_a9783642229930 _9978-3-642-22993-0 |
||
040 | _cMX-MeUAM | ||
050 | 4 | _aQA76.9.A43 | |
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 |
_aMurlak, Filip. _eeditor. |
|
245 | 1 | 0 |
_aMathematical Foundations of Computer Science 2011 _h[recurso electrónico] : _b36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings / _cedited by Filip Murlak, Piotr Sankowski. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
300 |
_aXV, 618 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6907 |
|
520 | _aThis volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence. | ||
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. _eeditor. |
|
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 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-22993-0 |
596 | _a19 | ||
942 | _cLIBRO_ELEC | ||
999 |
_c204463 _d204463 |