Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings /
Saved in:
| Meeting name: | COCOON '99 (1999 : Tokyo, Japan) |
|---|---|
| Imprint: | Berlin ; Heidelberg ; New York : Springer, [1999] ©1999 |
| Description: | 1 online resource (xiv, 494 pages) : illustrations (some color). |
| Language: | English |
| Series: | Lecture Notes in Computer Science ; 1627 Lecture notes in computer science ; 1627. |
| Subject: | Computer science -- Congresses. Combinatorial analysis -- Congresses. Computer software -- Congresses. Computational complexity -- Congresses. Computer graphics -- Congresses. Computer networks -- Congresses. Computer science -- Mathematics -- Congresses. Computer science. Combinatorial analysis. Computer software Computational complexity Computer graphics Computer networks Computer science -- Mathematics Combinatieleer. Computermethoden. Computer Science. Engineering & Applied Sciences. Conference papers and proceedings. Congressen (vorm) |
| Format: | E-Resource Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/11076487 |
Table of Contents:
- Invited Talks
- The Web as a Graph: Measurements, Models and Methods / Jon M. Kleinberg, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins
- Some Observations on the Computational Complexity of Graph Accessibility Problem / Jun Tarui and Seinosuke Toda
- Hao Wang Award Paper
- An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree / Hiroshi Nagamochi, Toshihide Ibaraki
- Data Structures
- Theory of 2-3 Heaps / Tadao Takaoka
- An External Memory Data Structure for Shortest Path Queries / David Hutchinson, Anil Maheshwari, and Norbert Zeh
- Computational Biology
- Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees / Wing-Kai Hon and Tak-Wah Lam
- Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations / Guo-Hui Lin and Guoliang Xue
- Graph Drawing
- An Approximation Algorithm for the Two-Layered Graph Drawing Problem / Atsuko Yamaguchi and Akihiro Sugimoto
- Area Minimization for Grid Visibility Representation of Hierachically Planar Graphs / Xuemin Lin and Peter Eades
- Layout Problems on Lattice Graphs / Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna
- Discrete Mathematics
- A New Transference Theorem in the Geometry of Numbers / Jin-Yi Cai
- On Covering and Rank Problems for Boolean Matrices and Their Applications / Carsten Damm, Ki Hang Kim, and Fred Roush
- A Combinatorial Algorithm for Pfaffians / Meena Mahajan, P.R. Subramanya, and V. Vinay
- Graph Algorithms 1
- How to Swap a Failing Edge of a Single Source Shortest Paths Tree / Enrico Nardelli, Guido Proietti, and Peter Widmayer
- On Bounds for the k-Partitioning of Graphs / S.L. Bezrukov, R. Elsässer, and U.-P. Schroeder
- A Faster Algorithm for Computing Minimum 5-way and 6-way Cuts / Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki.
- Automata and Language
- Probabilities to Accept Languages by Quantum Finite Automata / Andris Ambainis, Richard Bonner, Rūsiņš Freivalds, and Arnolds Ķikusts
- Distributionally-Hard Languages / Lance Fortnow, A. Pavan, and Alan L. Selman
- Circuits and Context-Free Languages / Pierre McKenzie, Klaus Reinhardt, and V. Vinay
- Complexity Theory and Learning
- On the Negation-Limited Circuit Complexity of Merging / Kazuyuki Amano, Akira Maruoka, and Jun Tarui
- Super-Polynomial versus Half-Exponential Circuit Size in the Exponential Hierarchy / Peter Bro Miltersen, N.V. Vinodchandran, and Osamu Watanabe
- Efficient Learning of Some Linear Matrix Languages / Henning Fernau
- Combinatorial Optimization 1
- Minimizing Mean Resoponse Time in Batch Processing System / Xiaotie Deng and Yuzhong Zhang
- Approximation Algoirthms for Bounded Facility Location / Piotr Krysta and Roberto Solis-Oba
- Scheduling Trees onto Hypercubes and Grids Is NP Complete / Satoshi Tayu
- Graph Algorithms 2
- Approximations of Weighted Independent Set and Hereditary Subset Problems / Magnús M. Halldórsson
- Multi-Coloring Trees / Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Teller
- On the Complexity of Approximating Colored-Graph Problems / Andrea E.F. Clementi, Pierluigi Crescenzi, and Gianluca Rossi
- Number Theory
- On the Average Sensitivity of Testing Square-Free Numbers / Anna Bernasconi, Carsten Damm and Igor Shparlinski
- Binary Enumerability of Real Numbers / Xizhong Zheng
- GCD of Many Integers / Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
- Distributed Computing
- Multi-party Finite Computations / Tomasz Jurdziński, Mirosław Kutyłowski, and Krzysztof Loryś
- Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs / Toshio Nakata, Hiroshi Imahayashi, and Masafumi Yamashita.
- Combinatorial Optimization 2
- A Dynamic Programming Bound for the Quadratic Assignment Problem / Ambros Marzetta and Adrian Brüngger
- A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases / Takeaki Uno
- Network Routing Problems
- On Routing in Circulant Graphs / Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, and Igor Shparlinski
- Minimum Congestion Embedding of Complete Binary Trees into Tori / Akira Matsubayashi and Ryo Takasu
- Computational Geometry
- Maximum Stabbing Line in 2D Plane / Francis Y.L. Chin, Cao An Wang, and Fu Lee Wang
- Generalized Shooter Location Problem / Jeet Chaudhuri and Subhas C. Nandy
- Online Algorithms
- A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory / Sung-Pil Hong
- Using Generalized Forecasts for Online Currency Conversion / Kazuo Iwama and Kouki Yonezawa
- Rewriting Systems
- On S-regular Prefix-Rewriting Systems and Automatic Structures / Friedrich Otto
- Tractable and Intractable Second-Order Matching Problems / Kouichi Hirata, Keizo Yamada, and Masateru Harao
- Parallel Computing
- Efficient Fixed-Size Systolic Arrays for the Modular Multiplication / Sung-Woo Lee, Hyun-Sung Kim, Jung-Joon Kim, Tae-Geun Kim and Kee-Young Yoo
- Improving Parallel Computation with Fast Integer Sorting / Ka Wong Chong, Yijie Han, Yoshihide Igarashi, and Tak Wah Lam
- A Combinatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor / Sajal K. Das, Bhabani P. Sinha, Rajarshi Chaudhuri
- Combinatorial Optimization 3
- A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation / Joachim Gudmundsson and Christos Levcopoulos
- The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set / H.Y. Lau and H.F. Ting.