ENGLISH

Computing and Combinatorics: 8th Annual International Conference, COCOON 2002 Singapore, August 15–17, 2002 Proceedings

By Oscar H. Ibarra , Gene Myers Ph.D (auth.) , Louxin Zhang (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2002
ISBN
978-3-540-43996-7, 978-3-540-45655-1, 3-540-43996-X
DOI
10.1007/3-540-45655-4
Language
english
Format
PDF
Filesize
8 MB (8001801 bytes)
Series
Lecture Notes in Computer Science 2387
Edition
1
Pages
614\619
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 8th Annual International Computing and Combinatorics Conference, COCOON 2002, held in Singapore in August 2002. The 60 revised full papers presented together with three invited contributions were carefully reviewed and selected from 106 submissions. The papers are organized in topical sections on complexity theory, discrete algorithms, computational biology and learning theory, radio networks, automata and formal languages, Internet networks, computational geometry, combinatorial optimization, and quantum computing.

Similar books