Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)
36%
Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)

Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.

Table of Contents:
Efficient text searching of regular expressions.- Efficient spatial point location.- Constructing the Voronoi diagram of a set of line segments in parallel.- Analysis of kdt-trees: Kd-trees improved by local reorganisations.- Optimal algorithms for List Indexing and Subset Rank.- The Delaunay triangulation closely approximates the complete Euclidean graph.- Computing the furthest site voronoi diagram for a set of discs.- Fully persistent arrays.- String searching algorithms revisited.- Optimal channel placement for multi-terminal nets.- Computing the minimum visible vertex distance between two polygons.- Computing the kernel of a point set in a polygon.- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs.- Linear time algorithms for computing reachability regions from polygonal figures.- Computing the center of area of a polygon.- Weighted orthogonal linear L ?-approximation and applications.- Discs and other related data structures.- Digital data structures and order statistics.- On the performance of orthogonal range queries in multiattribute and doubly chained trees.- Probabilistic analysis of algorithms and data structures.- Stabbing parallel segments with a convex polygon.- Selecting the Kth largest-area convex polygon.- Finding All Shortest Path Edge Sequences on a convex polyhedron.- Linear algorithms for parity path and two path problems on circular-arc graph.- NC algorithms for circular-arc graphs.- Parallel algorithms for the subgraph homeomorphism problem.- Galleries, light matchings and visibility graphs.- Weighted visibility graphs of bars and related flow problems.- Parallel algorithms for cographs recognition and applications.- Dynamic data structures for series parallel digraphs.- Motion planning in theCL-environment.- Self-adjusting k-ary search trees.- Improving partial rebuilding by using simple balance criteria.- An efficient all-parses systolic algorithm for general context-free parsing.- A polynomial time algorithm for the local testability problem of deterministic finite automata.- Skip lists: A probabilistic alternative to balanced trees.- A fast algorithm for melding splay trees.- An efficient algorithm for finding all maximal square blocks in a matrix.- Complexity issues in tree-based version control.- Structured NC.- Heapsort—Adapted for presorted files.- The distribution of keys in a binary heap.- Optimal hypercube algorithms for labeled images.- On the complexity of single row routing problems.- A new search time update time tradeoff for the implicit dictionary.- Sorting with minimum data movement (preliminary draft).- Augmentation problems on hierarchically defined graphs.- On linear time minor tests and depth first search.- Combinatorial and computational results for line arrangements in space.


Best Sellers


Product Details
  • ISBN-13: 9783540515425
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 244
  • Returnable: Y
  • Spine Width: 14 mm
  • Weight: 371 gr
  • ISBN-10: 3540515429
  • Publisher Date: 02 Aug 1989
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Series Title: 382 Lecture Notes in Computer Science
  • Sub Title: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989. Proceedings(382 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA