Coverart for item
The Resource Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings, Takano Asano, Hideki Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama (Eds.)

Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings, Takano Asano, Hideki Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama (Eds.)

Label
Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings
Title
Computing and Combinatorics
Title remainder
5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings
Statement of responsibility
Takano Asano, Hideki Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama (Eds.)
Creator
Contributor
Editor
Editor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 5th Annual International Conference on Computing and Combinatorics, COCOON'99, held in Tokyo, Japan in July 1999. The 46 revised papers presented were carefully reviewed and selected from a total of 88 submissions; also included are two invited survey papers. The papers are organized in topical sections on data structures, computational biology, graph drawing, discrete mathematics, graph algorithms, automata and languages, complexity theory and learning, combinatorial optimization, number theory, distributed computing, network routing, computational geometry, online algorithms, rewriting systems, and parallel computing
Member of
Cataloging source
DKDLA
Dewey number
004
Illustrations
illustrations
Index
index present
LC call number
QA75.5
LC item number
.C549 1999
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1999
http://bibfra.me/vocab/lite/meetingName
COCOON '99
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1949-
http://library.link/vocab/relatedWorkOrContributorName
  • Asano, Takao
  • Imai, Hideki.
  • Lee, Der-Tsai
  • Nakano, Shin-ichi.
  • Tokuyama, Takeshi
Series statement
Lecture Notes in Computer Science
Series volume
1627
http://library.link/vocab/subjectName
  • Computer science
  • Combinatorial analysis
  • Computer software
  • Computational complexity
  • Computer graphics
  • Computer networks
  • Computer science
  • Computer science
  • Combinatorial analysis
  • Computer software
  • Computational complexity
  • Computer graphics
  • Computer networks
  • Computer science
  • Combinatieleer
  • Computermethoden
Label
Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings, Takano Asano, Hideki Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama (Eds.)
Link
http://dx.doi.org/10.1007/3-540-48686-0
Instantiates
Publication
Copyright
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • 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
  • Invited Talks
  • Graph Drawing
  • An Approximation Algorithm for the Two-Layered Graph Drawing Problem
  • Atsuko Yamaguchi and Akihiro Sugimoto
  • Area Minimization for Grid Visibility Representation of Hierarchically 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
  • The Web as a Graph: Measurements, Models and Methods
  • 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
  • Jon M. Kleinberg, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins
  • Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki --
  • 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
  • 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
  • Automata and Language
  • 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
  • Probabilities to Accept Languages by Quantum Finite Automata
  • 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ś
  • Andris Ambainis, Richard Bonner, Rūsiņš Freivalds, and Arnolds Ķikusts
  • Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
  • Toshio Nakata, Hiroshi Imahayashi, and Masafumi Yamashita --
  • 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
  • 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
  • Combinatorial Optimization 2
  • 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
  • A Dynamic Programming Bound for the Quadratic Assignment Problem
  • 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
  • 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
Extent
1 online resource (xiv, 494 pages)
Form of item
online
Isbn
9783540486862
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations (some color)
Specific material designation
remote
System control number
  • (OCoLC)771187673
  • (OCoLC)ocn771187673
Label
Computing and Combinatorics : 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999 : Proceedings, Takano Asano, Hideki Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama (Eds.)
Link
http://dx.doi.org/10.1007/3-540-48686-0
Publication
Copyright
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • 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
  • Invited Talks
  • Graph Drawing
  • An Approximation Algorithm for the Two-Layered Graph Drawing Problem
  • Atsuko Yamaguchi and Akihiro Sugimoto
  • Area Minimization for Grid Visibility Representation of Hierarchically 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
  • The Web as a Graph: Measurements, Models and Methods
  • 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
  • Jon M. Kleinberg, S. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew S. Tomkins
  • Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki --
  • 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
  • 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
  • Automata and Language
  • 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
  • Probabilities to Accept Languages by Quantum Finite Automata
  • 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ś
  • Andris Ambainis, Richard Bonner, Rūsiņš Freivalds, and Arnolds Ķikusts
  • Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
  • Toshio Nakata, Hiroshi Imahayashi, and Masafumi Yamashita --
  • 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
  • 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
  • Combinatorial Optimization 2
  • 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
  • A Dynamic Programming Bound for the Quadratic Assignment Problem
  • 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
  • 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
Extent
1 online resource (xiv, 494 pages)
Form of item
online
Isbn
9783540486862
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other physical details
illustrations (some color)
Specific material designation
remote
System control number
  • (OCoLC)771187673
  • (OCoLC)ocn771187673

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...