Skip to main content
SpringerLink
Log in

Algorithms and Computation

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

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Ding-Zhu Du
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Xiang-Sun Zhang
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: ISAAC 1994.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (79 papers)

  1. Front Matter

    Download chapter PDF

  2. Polynomial equations-solving and its applications

    • Wu Wen-tsun
    Pages 1-9

  3. Quasi-random combinatorial structures

    • Ronald L. Graham
    Pages 10-10

  4. Hamiltonian abstract Voronoi diagrams in linear time

    • Rolf Klein, Andrzej Lingas
    Pages 11-19

  5. Every set of disjoint line segments admits a binary tree

    • Prosenjit Bose, Michael E. Houle, Godfried Toussaint
    Pages 20-28

  6. The traveling cameraman problem, with applications to automatic optical inspection

    • Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
    Pages 29-37

  7. On determining the congruity of point sets in higher dimensions

    • Tatsuya Akutsu
    Pages 38-46

  8. On random hard sets for NP

    • Ronald V. Book, Osamu Watanabe
    Pages 47-55

  9. Computing solutions uniquely collapses the polynomial hierarchy

    • Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
    Pages 56-64

  10. Verifying the determinant in parallel

    • Miklos Santha, Sovanna Tan
    Pages 65-73

  11. Hardness of approximating graph transformation problem

    • Chih-Long Lin
    Pages 74-82

  12. Randomized wait-free naming

    • Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
    Pages 83-91

  13. Unifying themes for network selection

    • Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
    Pages 92-100

  14. Robust asynchronous algorithms in networks with a fault detection ring

    • M. Molcho, S. Zaks
    Pages 101-109

  15. Distributed algorithms for finding small cycle covers in arbitrary networks

    • Esther Jennings, Lenka Motyčková
    Pages 110-118

  16. A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming

    • Xiang-sun Zhang, Hui-can Zhu
    Pages 119-127

  17. Analysis of the convergency of topology preserving neural networks on learning

    • Zhu Daming, Ma Shaohan, Qiu Hongze
    Pages 128-136

  18. On helping and interactive proof systems

    • V. Arvind, J. Köbler, R. Schuler
    Pages 137-145

  19. Average time complexity of the SAT 1.2 algorithm

    • Jun Gu, Qian-Ping Gu
    Pages 146-154

  20. Average cost to produce partial orders

    • Jingsen Chen
    Pages 155-163
Back to top

Other volumes

  1. Algorithms and Computation

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation