ENGLISH

Computing and Combinatorics: 6th Annual International Conference, COCOON 2000 Sydney, Australia, July 26–28, 2000 Proceedings

By Christos H. Papadimitriou (auth.) , Peter Eades , Ding-Zhu Du , Vladimir Estivill-Castro , Xuemin Lin , Arun Sharma (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2000
ISBN
978-3-540-67787-1, 978-3-540-44968-3, 3-540-67787-9
DOI
10.1007/3-540-44968-X
Language
english
Format
PDF
Filesize
12 MB (12293733 bytes)
Series
Lecture Notes in Computer Science 1858
Edition
1
Pages
478\490
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000. The 44 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 81 submissions. The book offers topical sections on computational geometry; graph drawing; graph theory and algorithms; complexity, discrete mathematics, and number theory; online algorithms; parallel and distributed computing; combinatorial optimization; data structures and computational biology; learning and cryptography; and automata and quantum computing.

Similar books