Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings > Average-Case Communication-Optimal Parallel Parenthesis Matching
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings |
Prosenjit K. Bose; Pat Morin
Springer Berlin Heidelberg
Algorithms and Computation: 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings
Average-Case Communication-Optimal Parallel Parenthesis Matching
Authors

Chun-Hsi Huang; Xin He

ARI Id

1664491809638_1913437

Access

Not Available Free

Pages

308-319

DOI

10.1007/3-540-36136-7_28

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-36136-7_28

Table of Contents of Book
Showing 1 to 20 of 59 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XIII
Biased Skip Lists
Amitabha Bagchi; Adam L. Buchsbaum; Michael T. Goodrich
1-13
Space-Efficient Data Structures for Flexible Text Retrieval Systems
Kunihiko Sadakane
14-24
Key Independent Optimality
John Iacono
25-31
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
Seth Pettie
32-43
On the Clique-Width of Graphs in Hereditary Classes
Rodica Boliac; Vadim Lozin
44-54
The Probability of a Rendezvous Is Minimal in Complete Graphs
Martin Dietzfelbinger
55-66
On the Minimum Volume of a Perturbed Unit Cube
Jin-Yi Cai
67-78
Non-Delaunay-Based Curve Reconstruction
Sumanta Guha; Paula Josiah; Anoop Mittal; Son Dinh Tran
79-90
Cutting a Country for Smallest Square Fit
Marc van Kreveld; Bettina Speckmann
91-102
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
Zhe Dang; Oscar H. Ibarra; Zhi-Wei Sun
103-114
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
Hirotada Kobayashi; Keiji Matsumoto
115-127
Some Remarks on the L-Conjecture
Qi Cheng
128-136
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
Thomas Wolle
137-149
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
Anna Galluccio; Guido Proietti
150-162
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
A. Brandstädt; F.F. Dragan; H.-O. Le; V.B. Le
163-174
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
Klaus Jansen; Roberto Solis-Oba
175-186
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
Markus Bläser; Bodo Manthey
187-198
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage
Yoshiyuki Karuno; Hiroshi Nagamochi
199-210
Queaps
John Iacono; Stefan Langerman2
211-218
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 59 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings