ENGLISH

Computing and Combinatorics: First Annual International Conference, COCOON '95 Xi'an, China, August 24–26, 1995 Proceedings

By Ding-Zhu Du , Uri Zwick , Michael S. Paterson (auth.) , Ming Li (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1995
ISBN
354060216X, 9783540602163
DOI
10.1007/BFb0030813
LCC
QA75.5 .I5443 1995
Open Library ID
OL792246M
Language
english
Format
DJVU
Filesize
6 MB (6265737 bytes)
Series
Lecture Notes in Computer Science 959
Edition
1
Pages
662\668
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Computa

Description

This book constitutes the proceedings of the First Annual International Conference on Computing and Combinatorics, COCOON '95, held in Xi'an, China in August 1995. The 52 thoroughly refereed full papers and the 22 short presentations included in this volume were selected from a total of 120 submissions. All current aspects of theoretical computer science and combinatorial mathematics related to computing are addressed; in particular, there are sections on complexity theory, graph drawing, computational geometry, databases, graph algorithms, distributed programming and logic, combinatorics, machine models, combinatorial designs, algorithmic learning, algorithms, distributed computing, and scheduling.

Similar books