Skip to main content
  • Conference proceedings
  • © 1994

Algorithms and Computation

5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 834)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 1994.

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (79 papers)

  1. Front Matter

  2. Quasi-random combinatorial structures

    • Ronald L. Graham
    Pages 10-10
  3. Hamiltonian abstract Voronoi diagrams in linear time

    • Rolf Klein, Andrzej Lingas
    Pages 11-19
  4. Every set of disjoint line segments admits a binary tree

    • Prosenjit Bose, Michael E. Houle, Godfried Toussaint
    Pages 20-28
  5. The traveling cameraman problem, with applications to automatic optical inspection

    • Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
    Pages 29-37
  6. On random hard sets for NP

    • Ronald V. Book, Osamu Watanabe
    Pages 47-55
  7. Computing solutions uniquely collapses the polynomial hierarchy

    • Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Pages 56-64
  8. Verifying the determinant in parallel

    • Miklos Santha, Sovanna Tan
    Pages 65-73
  9. Randomized wait-free naming

    • Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
    Pages 83-91
  10. Unifying themes for network selection

    • Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
    Pages 92-100
  11. Distributed algorithms for finding small cycle covers in arbitrary networks

    • Esther Jennings, Lenka Motyčková
    Pages 110-118
  12. On helping and interactive proof systems

    • V. Arvind, J. Köbler, R. Schuler
    Pages 137-145
  13. Average time complexity of the SAT 1.2 algorithm

    • Jun Gu, Qian-Ping Gu
    Pages 146-154
  14. Average cost to produce partial orders

    • Jingsen Chen
    Pages 155-163

Other Volumes

  1. Algorithms and Computation

About this book

This volume is the proceedings of the fifth International Symposium on Algorithms and Computation, ISAAC '94, held in Beijing, China in August 1994.
The 79 papers accepted for inclusion in the volume after a careful reviewing process were selected from a total of almost 200 submissions. Besides many internationally renowned experts, a number of excellent Chinese researchers present their results to the international scientific community for the first time here. The volume covers all relevant theoretical and many applicational aspects of algorithms and computation.

Bibliographic Information

Buy it now

Buying options

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access