|
|
|
|
| LEADER |
02970nam a22005415i 4500 |
| 001 |
11100 |
| 003 |
DE-He213 |
| 005 |
20130725201507.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100814s2010 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642151552
|9 978-3-642-15155-2
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-15155-2
|2 doi
|
| 050 |
# |
4 |
|a QA76.9.A43
|
| 072 |
# |
7 |
|a UMB
|2 bicssc
|
| 072 |
# |
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 100 |
1 |
# |
|a Hlinn<U+00fd>, Petr.
|e editor.
|
| 245 |
1 |
0 |
|a Mathematical Foundations of Computer Science 2010
|b 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings /
|c edited by Petr Hlinn<U+00fd>, Antonn̕ Ku era.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
# |
# |
|a XVII, 714p. 71 illus.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 6281
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This volume constitutes the refereed proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, held in Brno, Czech Republic, in August 2010. The 56 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 149 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 |
|a Computer science.
|
| 650 |
# |
0 |
|a Data structures (Computer science).
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Logic design.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 700 |
1 |
# |
|a Ku era, Antonn̕.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642151545
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6281
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-15155-2
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|