Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2518)
Included in the following conference series:
Conference proceedings info: ISAAC 2002.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Keywords
Table of contents (57 papers)
-
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
-
On the Clique-Width of Graphs in Hereditary Classes
-
The Probability of a Rendezvous Is Minimal in Complete Graphs
-
On the Minimum Volume of a Perturbed Unit Cube
-
Non-Delaunay-Based Curve Reconstruction
-
Cutting a Country for Smallest Square Fit
-
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
-
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
-
Some Remarks on the L-Conjecture
-
Session 4A
Other volumes
-
Algorithms and Computation
Editors and Affiliations
Bibliographic Information
Book Title: Algorithms and Computation
Book Subtitle: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
Editors: Prosenjit Bose, Pat Morin
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-36136-7
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Softcover ISBN: 978-3-540-00142-3Published: 08 November 2002
eBook ISBN: 978-3-540-36136-7Published: 02 August 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 662
Topics: Applications of Mathematics, Theory of Computation, Programming Techniques, Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Structures