Algorithms and computation : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993 : proceedings /
Saved in:
| Meeting name: | ISAAC '93 (4th : 1993 : Hong Kong) |
|---|---|
| Imprint: | Berlin : New York : Springer-Verlag, c1993. |
| Description: | xiii, 542 p. : ill. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science 762 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1563625 |
Table of Contents:
- Reaching a Goal with Directional Uncertainty / Mark de Berg, Leonidas Guibas, Dan Halperin, Mark Overmars, Otfried Schwarzkopf, Micha Sharir and Monique Teillaud
- Constructing Degree-3 Spanners with Other Sparseness Properties / Gautam Das and Paul J. Heffernan
- Remembering Conflicts in History Yields Dynamic Algorithms / Katrin Dobrindt and Mariette Yvinec
- Coloring Random Graphs in Polynomial Expected Time / Martin Furer, C. R. Subramanian and C. E. Veni Madhavan
- Graphical Degree Sequence Problems with Connectivity Requirements / Takao Asano
- How to Treat Delete Requests in Semi-Online Problems / Yang Dai, Hiroshi Imai, Kazuo Iwano and Naoki Katoh
- Finding the Shortest Watchman Route in a Simple Polygon / Svante Carlsson, Hakan Jonsson and Bengt J. Nilsson
- Constructing Shortest Watchman Routes by Divide-and-Conquer / Xuehou Tan and Tomio Hirata
- A Graph Coloring Result and Its Consequences for Some Guarding Problems / Frank Hoffmann and Klaus Kriegel
- The Maximum k-Dependent and f-Dependent Set Problem / Anders Dessmark, Klaus Jansen and Andrzej Lingas
- Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions / Jun-ya Takahashi, Hitoshi Suzuki and Takao Nishizeki
- Treewidth of Circle Graphs / T. Kloks
- A Framework for Constructing Heap-like Structures In-Place / Jingsen Chen
- Double-Ended Binomial Queues / C. M. Khoong and H. W. Leong
- A Simple Balanced Search Tree with O(1) Worst-Case Update Time / Rudolf Fleischer
- Mapping Dynamic Data and Algorithm Structures into Product Networks / Sabine R. Ohring and Sajal K. Das
- Permutation Routing on Reconfigurable Meshes / J. C. Cogolludo and S. Rajasekaran
- Adaptive and Oblivious Algorithms for D-Cube Permutation Routing / Miltos D. Grammatikakis, D. Frank Hsu and Frank K. Hwang
- On Quadratic Lattice Approximations / Anand Srivastav and Peter Stangier
- A 2/3-Approximation of the Matroid Matching Problem / Toshihiro Fujito
- Using Fractal Geometry for Solving Divide-and-Conquer Recurrences / Simant Dube
- Simple Combinatorial Gray Codes Constructed by Reversing Sublists / Frank Ruskey
- Time-Space Tradeoffs / Allan Borodin
- Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA / Hing Leung
- Threshold Computation and Cryptographic Security / Yenjo Han, Lane A. Hemaspaandra and Thomas Thierauf
- On the Power of Reading and Writing Simultaneously in Parallel Computations / Rolf Niedermeier and Peter Rossmanith
- Relativizing Complexity Classes with Random Oracles / Ronald V. Book
- Perpetual Gossiping / Arthur L. Liestman and Dana Richards
- A Probabilistic Selection Network with Butterfly Networks / Takahiro Ikeda
- Optimal Group Gossiping in Hypercubes Under Wormhole Routing Model / Satoshi Fujita, Masafumi Yamashita and Tadashi Ae
- Optimal Linear Broadcast Routing with Capacity Limitations / S. Bitan and S. Zaks
- A Survey of Recent Advances in Multicommodity Flow: Algorithms and Applications / Baruch Awerbuch and Tom Leighton
- Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs / Xin He and Ming-Yang Kao
- Number Theory Helps Line Detection in Digital Images / Tetsuo Asuno and Naoki Katoh
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon / Danny Z. Chen
- Multicommodity Flows in Even, Planar Networks / Karsten Weihe
- Linear Time Algorithms for Disjoint Two-Face Paths / Heike Ripphausen-Lipa, Dorothea Wagner and Karsten Weihe
- Robot Mapping: Foot-Prints vs Tokens / Xiaotie Deng and Andy Mirzaian
- Recent Developments in the Approximability of Combinatorial Problems / Mihalis Yannakakis
- On the Relationship among Cryptographic Physical Assumptions / Tatsuaki Okamoto
- Separating Complexity Classes Related to Bounded Alternating w-Branching Programs / Christoph Meinel and Stephan Waack
- The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams / Seiichiro Tani, Kiyoharu Hamaguchi and Shuzo Yajima
- On Horn Envelopes and Hypergraph Transversals / Dimitris Kavvadias, Christos H. Papadimitriou and Martha Sideri
- Page Migration Algorithms Using Work Functions / Marek Chrobak, Lawrence L. Larmore, Nick Reingold and Jefferry Westbrook
- Memory Paging for Connectivity and Path Problems in Graphs / Esteban Feuerstein and Alberto Marchetti-Spaccamela
- Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-Adjusting Linear Lists / Lucas Chi Kwong Hui and Charles U. Martel
- Randomized On-Line Algorithms for the Page Replication Problem / Hisashi Koga
- New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction / Susanne E. Hambrusch and Hung-Yi Tony Tu
- Parallel Algorithms for Single-Layer Channel Routing / Ronald I. Greenberg, Shih-Chuan Hung and Jau-Der Shih
- Consecutive Interval Query and Dynamic Programming on Intervals / Alok Aggarwal and Takeshi Tokuyama
- An Improved Algorithm for the Traveler's Problem / Alok Aggarwal and Takeshi Tokuyama
- Vehicle Scheduling on a Tree with Release and Handling Times / Yoshiyuki Karuno, Hiroshi Nagamochi and Toshihide Ibaraki
- Scheduling Algorithms for a Chain-like Task System / Chan Chi Lok and Gilbert Young
- Weighted Independent Perfect Domination on Cocomparability Graphs / Gerard J. Chang, C. Pandu Rangan and Satyan R. Coorg
- Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications / D. P. Wang, N. F. Huang, H. S. Chao and R. C. T. Lee
- Optimal Rectilinear Steiner Tree for Extremal Point Sets / Siu-Wing Cheng, Andrew Lim and Ching-Ting Wu
- Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem / Ulrich Fossmeier, Michael Kaufmann and Alexander Zelikovsky.
