Algorithms and computation : 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25-27, 1994 : proceedings /
Saved in:
| Meeting name: | ISAAC '94 (1994 : Beijing) |
|---|---|
| Imprint: | Berlin : New York : Springer-Verlag, c1994. |
| Description: | xiii, 688 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science 834 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1691572 |
Table of Contents:
- Polynomial Equations-Solving and its Applications / Wen-Tsun Wu
- Quasi-Random Combinatorial Structures / Ronald L. Graham
- Hamiltonian Abstract Voronoi Diagrams in Linear Time / Rolf Klein and Andrzej Lingas
- Every Set of Disjoint Line Segments Admits a Binary Tree / Prosenjit Bose, Michael E. Houle and Godfried Toussaint
- The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection / Kazuo Iwano, Prabhakar Raghavan and Hisao Tamaki
- On Determining the Congruity of Point Sets in Higher Dimensions / Tatsuya Akutsu
- On Random Hard Sets for NP / Ronald V. Book and Osamu Watanabe
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy / Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara and Alan L. Selman
- Verifying the Determinant in Parallel / Miklos Santha and Sovanna Tan
- Hardness of Approximating Graph Transformation Problem / Chih-Long Lin
- Randomized Wait-Free Naming / Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas and Paul Vitanyi
- Unifying Themes for Network Selection / Sanguthevar Rajasekaran, Wang Chen and Shibu Yooseph
- Robust Asynchronous Algorithms in Networks with a Fault Detection Ring / M. Molcho and S. Zaks
- Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks / Esther Jennings and Lenka Motyckova
- A Neural Network Model for Quadratic Programming with Simple Upper and Lower Bounds and its Application to Linear Programming / Xiang-Sun Zhang and Hui-Can Zhu
- Analysis of the Convergency of Topology Preserving Neural Networks on Learning / Daming Zhu, Shaohan Ma and Hongze Qiu
- On Helping and Interactive Proof Systems / V. Arvind, J. Kobler and R. Schuler
- Average Time Complexity of the SAT 1.2 Algorithm / Jun Gu and Qian-Ping Gu
- Average Cost to Produce Partial Orders / Jingsen Chen
- Two Notes on Low-Density Subset Sum Algorithms / Daxing Li and Shaohan Ma
- Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry / Jin-Yi Cai and Michael D. Hirsch
- Finitely Representable Spatial Objects and Efficient Computation / Yongmao Chen and Terence R. Smith
- Computing All Small Cuts in Undirected Networks / Hiroshi Nagamochi, Kazuhiro Nishimura and Toshihide Ibaraki
- Edge-Coloring and f-Coloring for Various Classes of Graphs / Xiao Zhou and Takao Nishizeki
- Edge-Disjoint Paths in Permutation Graphs / C. P. Gopalakrishnan and C. Pandu Rangan
- Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph / Satoshi Taoka and Toshimasa Watanabe
- Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming / Anand Srivastav and Peter Stangier
- Approximate Pattern Matching with Samples / Tadao Takaoka
- An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management / Xuemin Lin and Maria E. Orlowska
- Multispace Search: A New Optimization Approach / Jun Gu
- Realizing Degree Sequences in Parallel / Srinivasa Arikati and Anil Maheshwari
- Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem / Dimitris Kavvadias, Grammati E. Pantziou, Paul G. Spirakis and Christos D. Zaroliagis
- Fast and Efficient Operations on Parallel Priority Queues / Danny Z. Chen and Xiaobo Hu
- Heaps with Bits / Svante Carlsson, Jingsen Chen and Christer Mattsson
- Components and Projections of Curves over Finite Fields / Joachim von zur Gathen and Igor Shparlinski
- On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences / Martin Middendorf
- A Linear-Time Algorithm for Computing Characteristic Strings / Michio Nakanishi, Morio Hasidume, Minoru Ito and Akihiro Hashimoto
- The Maximum Latency and Identification of Positive Boolean Functions / Kazuhisa Makino and Toshihide Ibaraki
- Fast Deterministic Hot-Potato Routing on Processor Arrays / Michael Kaufmann, Harald Lauer and Heiko Schroder
- k-Pairwise Cluster Fault Tolerant Routing in Hypercubes / Qian-Ping Gu and Shietung Peng
- On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing / Michael Kaufmann, Shaodi Gao and K. Thulasiraman
- Optimal Routing of Permutations on Rings / Xiaojun Shen, Qing Hu, Hao Dai and Xiangzu Wang
- Resource Bounded Randomness and Weakly Complete Problems / Klaus Ambos-Spies, Sebastiaan A. Terwijn and Xizhong Zheng
- Deterministic [omega] Automata vis-a-vis Deterministic Buchi Automata / Sriram C. Krishnan, Anuj Puri and Robert K. Brayton
- Quantum Computation and NP-Complete Problems / Takashi Mihara and Tetsuro Nishino
- Separability and One-Way Functions / Lance Fortnow and John Rogers
- On the Approximation of Largest Common Subtrees and Largest Common Point Sets / Tatsuya Akutsu and Magnus M. Halldorsson
- An Approximation Scheme for Some Steiner Tree Problems in the Plane / Tao Jiang and Lusheng Wang
- A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations / Bo-Ting Yang, Yin-Feng Xu and Zhao-Yong You
- The Generating Algorithm for Quasi-Full Steiner Trees / Jiyu Ding
- Analysing Deletions in Competitive Self-Adjusting Linear List Algorithms / Lucas Chi Kwong Hui and Charles U. Martel
- Are Fibonacci Heaps Optimal? / Diab Abuaiadh and Jeffrey H. Kingston
- Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs / Ming-Yang Kao and Shang-Hua Teng
- Improved Algorithms for Coloring Random Graphs / C. R. Subramanian
- On the Parallel Complexity of Solving Recurrence Equations / Oscar H. Ibarra and Nicholas Q. Tran
- Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity / Chuzo Iwamoto and Kazuo Iwama
- Parallel h-v Drawings of Binary Trees / Panagiotis T. Metaxas, Grammati E. Pantziou and Antonis Symvonis
- An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs / Sun-Yuan Hsieh and Chin-Wen Ho
- Orthogonal Queries in Segments and Triangles / Takeshi Tokuyama
- Further Computational Geometry in Secondary Memory / Binhai Zhu
- Shortest Safari Routes in Simple Polygon / Xuehou Tan and Tomio Hirata
- On Greedy Tetrahedralization of Points in 3D / Francis Y. Chin and Cao An Wang
- The Totally-Perfect Bipartite Graph and Its Construction / Kunihiro Fujiyoshi, Yoji Kajitani and Hiroshi Niitsu
- k-Best Cuts for Circular-Arc Graphs / K.-H. Tsai and D. T. Lee
- Revisiting Circular Arc Graphs / Lin Chen
- Weighted Irredundance of Interval Graphs / C. Pandu Rangan and Maw-Shang Chang
- A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs / Seeichiro Tani and Hiroshi Imai
- On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions / Kazuhisa Hosaka, Yasuhiko Takenaga and Shuzo Yajima
- Nonuniform Lowness and Strong Nonuniform Lowness / Hong-Zhou Li and Guan-Ying Li
- Definition and Existence of Super Complexity Cores / Ingrid Biehl
- Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer / Gilbert H. Young and Chi-Lok Chan
- Manpower Scheduling with Shift Change Constraints / Hoong Chuin Lau
- Fast Algorithms for Transversal Matroid Intersection Problems / Ying Xu and Harold N. Gabow
- A Convex Hull Algorithm on Coarse-Grained Multiprocessors / Xiaotie Deng
- A Multiway Merging Network / De-Lei Lee and Kenneth E. Batcher
- Reporting and Counting Intersections of Lines within a Polygon / Tetsuo Asano
- A New Problem in String Searching / George Havas and Jin Xian Lian
- Achieving the Shortest Clock Period by Inserting the Minimum Amount of Delay / Shangzhi Sun, David H. C. Du and Guoliang Xue
- A Randomized Algorithm to Finite Automata Public Key Cryptosystem / Feng Bao and Yoshihide Igarashi.
