Computing and Combinatorics (Record no. 58157)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03294nam a22006015i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-319-08783-2 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20200421112234.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 140705s2014 gw | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783319087832 |
-- | 978-3-319-08783-2 |
082 04 - CLASSIFICATION NUMBER | |
Call Number | 005.1 |
245 10 - TITLE STATEMENT | |
Title | Computing and Combinatorics |
Sub Title | 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings / |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XVI, 692 p. 126 illus. |
490 1# - SERIES STATEMENT | |
Series statement | Lecture Notes in Computer Science, |
505 0# - FORMATTED CONTENTS NOTE | |
Remark 2 | 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 ## - SUMMARY, ETC. | |
Summary, etc | 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 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
General subdivision | Mathematics. |
700 1# - AUTHOR 2 | |
Author 2 | Cai, Zhipeng. |
700 1# - AUTHOR 2 | |
Author 2 | Zelikovsky, Alex. |
700 1# - AUTHOR 2 | |
Author 2 | Bourgeois, Anu. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-08783-2 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Cham : |
-- | Springer International Publishing : |
-- | Imprint: Springer, |
-- | 2014. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer communication systems. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computers. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithms. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer logic. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Artificial intelligence. |
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer Science. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Algorithm Analysis and Problem Complexity. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Discrete Mathematics in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer Communication Networks. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computation by Abstract Devices. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Logics and Meanings of Programs. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Artificial Intelligence (incl. Robotics). |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 0302-9743 ; |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-LNC |
No items available.