Computing and Combinatorics 5th Annual International Conference, COCOON'99, Tokyo, Japan, July 2628, 1999, Proceedings
The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON ’99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computi...
Other Authors:  , , , 

Format:  eBook 
Language:  English 
Published: 
Berlin, Heidelberg
Springer Berlin Heidelberg
1999, 1999

Edition:  1st ed. 1999 
Series:  Lecture Notes in Computer Science

Subjects:  
Online Access:  
Collection:  Springer Book Archives 2004  Collection details see MPG.ReNa 
Table of Contents:
 On Covering and Rank Problems for Boolean Matrices and Their Applications
 A Combinatorial Algorithm for Pfaffians
 Graph Algorithms 1
 How to Swap a Failing Edge of a Single Source Shortest Paths Tree
 On Bounds for the kPartitioning of Graphs
 A Faster Algorithm for Computing Minimum 5Way and 6Way Cuts in Graphs
 Automata and Language
 Probabilities to Accept Languages by Quantum Finite Automata
 DistributionallyHard Languages
 Circuits and ContextFree Languages
 Complexity Theory and Learning
 On the NegationLimited Circuit Complexity of Merging
 SuperPolynomial Versus HalfExponential Circuit Size in the Exponential Hierarchy
 Efficient Learning of Some Linear Matrix Languages
 Combinatorial Optimization 1
 Minimizing Mean Response Time in Batch Processing System
 Approximation Algorithms for Bounded Facility Location
 Scheduling Trees onto Hypercubes and Grids Is NPcomplete
 Graph Algorithms 2
 Approximations of Weighted Independent Set and Hereditary Subset Problems
 Multicoloring Trees
 On the Complexity of Approximating ColoredGraph Problems Extended Abstract
 Number Theory
 On the Average Sensitivity of Testing SquareFree Numbers
 Binary Enumerability of Real Numbers (Extended Abstract)
 GCD of Many Integers (Extended Abstract)
 Distributed Computing
 Multiparty Finite Computations
 Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs
 Combinatorial Optimization 2
 A DynamicProgramming Bound for the Quadratic Assignment Problem
 A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
 Network Routing Problems
 On Routing in Circulant Graphs
 Minimum Congestion Embedding of Complete Binary Trees into Tori
 Computational Geometry
 Maximum Stabbing Line in 2D Plane
 Generalized Shooter Location Problem
 Online Algorithms
 A Competitive Online Algorithm for the Paging Problem with “Shelf” Memory
 Using Generalized Forecasts for Online Currency Conversion
 Rewriting Systems
 On SRegular PrefixRewriting Systems and Automatic Structures
 Tractable and Intractable SecondOrder Matching Problems
 Parallel Computing
 Efficient FixedSize Systolic Arrays for the Modular Multiplication
 Improving Parallel Computation with Fast Integer Sorting
 A Combinatorial Approach to Performance Analysis of a SharedMemory Multiprocessor
 Combinatorial Optimization 3
 A Fast Approximation Algorithm for TSP with Neighborhoods and RedBlue Separation
 The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
 Invited Talks
 The Web as a Graph: Measurements, Models, and Methods
 Some Observations on the Computational Complexity of Graph Accessibility Problem (Extended Abstract)
 Hao Wang Award Paper
 An Approximation for Finding a Smallest 2EdgeConnected Subgraph Containing a Specified Spanning Tree
 Data Structures
 Theory of 23 Heaps
 An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
 Computational Biology
 Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Nonuniform Degrees
 Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations
 Graph Drawing
 An Approximation Algorithm for the TwoLayered Graph Drawing Problem
 Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
 Layout Problems on Lattice Graphs
 Discrete Mathematics
 A New Transference Theorem in the Geometry of Numbers