Advertisement

Table of contents

  1. Front Matter
  2. Uri Zwick, Michael S. Paterson
    Pages 1-10
  3. Kazuo Iwama, Shuichi Miyazaki
    Pages 11-20
  4. Qing -Wen Feng, Robert F. Cohen, Peter Eades
    Pages 21-30
  5. Tiziana Calamoneri, Rossella Petreschi
    Pages 31-40
  6. V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
    Pages 71-80
  7. Edward P. F. Chan, Ron van der Meyden
    Pages 81-90
  8. Seung Jin Lim, Yiu-Kai Ng
    Pages 101-110
  9. Andrzej Lingas
    Pages 121-130
  10. Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
    Pages 141-150
  11. Jianer Chen
    Pages 151-160
  12. Divyakant Agrawal, Ömer Eğecioğlu, Amr El Abbadi
    Pages 161-170
  13. Guoxiang Huang
    Pages 181-190
  14. Yoshinobu Kawabe, Naohiro Ishii
    Pages 191-202
  15. S. Rengarajan, C. E. Veni Madhavan
    Pages 203-212
  16. Scott K. Walley, Harry H. Tan
    Pages 213-222
  17. Xiao Zhou, Takao Nishizeki
    Pages 223-228
  18. Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
    Pages 229-234
  19. John Tromp, Louxin Zhang, Ying Zhao
    Pages 235-243
  20. Julien Cassaigne, Juhani Karhumäki
    Pages 244-253
  21. Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
    Pages 254-263
  22. J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, J. Toran
    Pages 313-323
  23. Jean Hardouin Duparc, Philippe Rolland
    Pages 366-371
  24. You Zhaoyong, Wang Chuanglong
    Pages 372-378
  25. Zhang Xiangde
    Pages 379-383
  26. Cheng-Xu Xu, Zhun-Wei Lu
    Pages 388-391
  27. Hua Wang, Zhao-yong You
    Pages 392-395
  28. C. F. Chang, J. X. Chang, X. C. Lu, Peter C. B. Lam, J. F. Wang
    Pages 396-399
  29. Rainer Schuler, Tomoyuki Yamakami
    Pages 400-409
  30. Lane A. Hemaspaandra, Jörg Rothe
    Pages 430-435

About these proceedings

Introduction

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.

Keywords

Combinatorics Erfüllbarkeitsproblem der Aussagenlogik Layout algorithm algorithms automata complexity complexity theory computational geometry data structure distributed computing distributed programming logic optimization programming

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0030813
  • Copyright Information Springer-Verlag Berlin Heidelberg 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60216-3
  • Online ISBN 978-3-540-44733-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering