Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 Lecture Notes in Computer Science)
Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 Lecture Notes in Computer Science)

Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 Lecture Notes in Computer Science)

          
5
4
3
2
1

International Edition


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 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.

Table of Contents:
A case study in comparison based complexity: Finding the nearest value(s).- On the zone of a surface in a hyperplane arrangement.- Ray-shooting and isotopy classes of lines in 3-dimensional space.- Finding level-ancestors in dynamic trees.- Treewidth of circular-arc graphs+.- Fully dynamic delaunay triangulation in logarithmic expected time per operation.- On computing the voronoi diagram for restricted planar figures.- The MINSUMCUT problem.- Efficient algorithms for the minimum range cut problems.- Memory access in models of parallel computation: From folklore to synergy and beyond.- Farthest neighbors, maximum spanning trees and related problems in higher dimensions.- Shallow interdistance selection and interdistance enumeration.- Sharing memory in asynchronous message passing systems.- A linear-time scheme for version reconstruction.- The interval skip list: A data structure for finding all intervals that overlap a point.- Geometric knapsack problems.- A fast derandomization scheme and its applications.- Unstructured path problems and the making of semirings.- Neighborhood graphs and geometric embedding.- Finding optimal bipartitions of points and polygons.- Immobilizing a polytope.- What can we learn about suffix trees from independent tries?.- Competitive algorithms for the weighted list update problem.- An optimal algorithm for the rectilinear link center of a rectilinear polygon.- Geometric searching and link distance.- Representing and enumerating edge connectivity cuts in RNC.- Planar graph augmentation problems.- Parametric search and locating supply centers in trees.- On bends and lengths of rectilinear paths: A graph-theoretic approach.- Computing minimum length paths of a given homotopy class.- Approximation algorithms for selecting network centers.- Facility dispersion problems: Heuristics and special cases.- Optimum guard covers and m-watchmen routes for restricted polygons.- Applications of a new space partitioning technique.- Offline algorithms for dynamic minimum spanning tree problems.- An empirical analysis of algorithms for constructing a minimum spanning tree.- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible.- Dynamically maintaining the visibility graph.- An optimal algorithm for computing visibility in the plane.- Fully persistent data structures for disjoint set union problems.- Algorithms for generating all spanning trees of undirected, directed and weighted graphs.- Sorting multisets and vectors in-place.- Probabilistic leader election on rings of known size.


Best Sellers


Product Details
  • ISBN-13: 9783540543435
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 502
  • Series Title: 519 Lecture Notes in Computer Science
  • Sub Title: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings
  • Width: 155 mm
  • ISBN-10: 3540543430
  • Publisher Date: 24 Jul 1991
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Spine Width: 26 mm
  • Weight: 716 gr


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: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 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: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings(519 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