This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.
Algorithms and Data Structures
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
tiered vector, optimal split tree, combinatorial neighbors, edge reorientations, elastic rectangles, correct augmented map, randomized queues, line simplification problem, accommodating ratio, fault tolerant spanner, subvector size, jagged horizontal line, tolerant spanners, induced chord, adjacency queries, accommodating function, ordinal trees, sorted matrices, centroid path, street polygon, reachable regions, resizable arrays, wildcard team, greedy edges, cheap tree Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory of Computing, Discrete Algorithms, Lecture Notes, Annual Symposium, Lazy Bureaucrat Problem, University of Waterloo, Canadian Conference, Discrete Mathematics, Ian Munro, Springer Verlag, International Symposium, John Wiley, Journal of Computing, Academic Press, Cornell University, Information Processing Letters, Journal of Algorithms, University of California, Computational Molecular Biology, Data Structures Library, Mathematics of Operations Research, Orthogonal Area Compaction, Peter Bro Miltersen, Prentice Hall New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
tiered vector, optimal split tree, combinatorial neighbors, edge reorientations, elastic rectangles, correct augmented map, randomized queues, line simplification problem, accommodating ratio, fault tolerant spanner, subvector size, jagged horizontal line, tolerant spanners, induced chord, adjacency queries, accommodating function, ordinal trees, sorted matrices, centroid path, street polygon, reachable regions, resizable arrays, wildcard team, greedy edges, cheap tree Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory of Computing, Discrete Algorithms, Lecture Notes, Annual Symposium, Lazy Bureaucrat Problem, University of Waterloo, Canadian Conference, Discrete Mathematics, Ian Munro, Springer Verlag, International Symposium, John Wiley, Journal of Computing, Academic Press, Cornell University, Information Processing Letters, Journal of Algorithms, University of California, Computational Molecular Biology, Data Structures Library, Mathematics of Operations Research, Orthogonal Area Compaction, Peter Bro Miltersen, Prentice Hall New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
