Computing and combinatorics : 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings / edited by Zhipeng Cai, Alex Zelikovsky, Anu Bourgeois.
By: (20th : COCOON (Conference) (20th : 2014 : Atlanta, Ga.)
Contributor(s): Cai, Zhipeng [editor.] | Zelikovsky, Alex [editor.] | Bourgeois, Anu G [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 8591.; LNCS sublibrary: Publisher: Cham : Springer, 2014Description: 1 online resource (xvi, 688 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319087832; 3319087835Other title: COCOON 2014Subject(s): Combinatorial analysis -- Data processing -- Congresses | Computer science -- Congresses | Combinatorial analysis -- Data processing | Computer scienceGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 003/.56 LOC classification: QA164Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
International conference proceedings.
Includes author index.
Online resource; title from PDF title page (SpringerLink, viewed July 15, 2014).
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.
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.