|
|
|
|
| LEADER |
03293nam a22005895i 4500 |
| 001 |
978-3-319-08783-2 |
| 003 |
DE-He213 |
| 005 |
20151030091220.0 |
| 007 |
cr nn 008mamaa |
| 008 |
140705s2014 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319087832
|9 978-3-319-08783-2
|
| 024 |
7 |
|
|a 10.1007/978-3-319-08783-2
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 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
|
| 245 |
1 |
0 |
|a Computing and Combinatorics
|h [electronic resource] :
|b 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings /
|c edited by Zhipeng Cai, Alex Zelikovsky, Anu Bourgeois.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2014.
|
| 300 |
|
|
|a XVI, 692 p. 126 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,
|x 0302-9743 ;
|v 8591
|
| 505 |
0 |
|
|a Sampling and Randomized Methods -- Logic, Algebra and Automata -- Database and Data Structures -- Parameterized Complexity and Algorithms.- Computational Complexity.-Computational Biology and Computational Geometry -- Approximation Algorithm -- Graph Theory and Algorithms -- Theory and Cryptography -- Scheduling Algorithms and Circuit Complexity -- CSoNet.
|
| 520 |
|
|
|a This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer communication systems.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 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 Computer Communication Networks.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 700 |
1 |
|
|a Cai, Zhipeng.
|e editor.
|
| 700 |
1 |
|
|a Zelikovsky, Alex.
|e editor.
|
| 700 |
1 |
|
|a Bourgeois, Anu.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319087825
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8591
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-08783-2
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
