Proceedings of the Second Symposium on Discrete Algorithms
Home > Science, Technology & Agriculture > Technology: general issues > Maths for engineers > Proceedings of the Second Symposium on Discrete Algorithms
Proceedings of the Second Symposium on Discrete Algorithms

Proceedings of the Second Symposium on Discrete Algorithms

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

Table of Contents:
Finding stabbing lines in 3-dimensional space, M.Pellegrini and P.Shor; space-efficient ray-shooting and intersection searching - algorithms, dynamization and applications, Siu Wing Cheng and Ravi Janardan; edge coloring planar graphs with two outerplanar subgraphs, Lenwood S.Heath; efficient sequential and parallel algorithms for computing recovery points in trees and paths (extended abstract), Marek Chrobak, et al; on-line caching as cache size varies (extended abstract), Neal Young; time-work tradeoffs for parallel graph algorithms, Thomas H.Spencer; offline maintence of planar configurations, John Hershberger and Subhash Suri; circular hulls and obiforms of simple polygons, V.Chandru and R. Venkataraman; dynamic expression trees and their applications (extended abstract), Robert F.Cohen and Roberto Tamassia; a sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs, Farod Alizadeh; improved approximation algorithms for shop scheduling problems, David B.Shmoys, et al; the analysis of multidimensional searching in quad-trees, Philippe Flajolet, et al; matching points into noise regions - combinatorial bounds and algorithms, Ester M.Arkin, et al; triangulating three-colored graphs, Sampath K. Kannan and Tandy J.Warnow; recognizing strong connectivity in (dynamic) periodic graphs and its relation in integer programmin g (extended abstract), Muralidharan Kodialam and James B.Orlin; tight bounds on the number of minimum-mean cycle cancellations and related results, Tomasz Radzik and Andrew V.Goldberg; tight bounds on the complexity of the Boyer-Moore string matching algorithm (extended abstract), Richard Cole; computing a face in an arrangement of line segments, Bernard Chazelle, et al; approximation algorithms for planar travelling salesman tours and minimum-length triangulations, Kenneth L.Clarkson; on 0-2 time algorithms for the 2-chain cover problem and related problems, Tze-heng Ma and Jeremy Spinrad; denisty graphs and separators, Gary L.Miller and Stephen A. Vavasis; optimal algorithms for tree partitioning (detailed abstract), Greg N.Frederickson; adaptive heuristics for binary search trees and constant linkage cost, Tony W.Lai and Derick Wood; algorithms and complexity analysis for some flow problems, Edith Cohen and Nimrod Megiddo; a new lower bound techniques and its application - tight lower bound for a polygon triangulation problem, Prakash Ramanan; maintaining the minimal distance of a point set in polylogarithmic time, Michiel Smid; planar geometric location problems and maintaining the width of a planar set, Pankaj K.Agarwal and Micha sharir, Efficient 2 -dimensional approximate matching of non-rectangular figures, Amihood Amir and Martin Farach.


Best Sellers


Product Details
  • ISBN-13: 9780898712711
  • Publisher: Society for Industrial & Applied Mathematics,U.S.
  • Publisher Imprint: Society for Industrial & Applied Mathematics,U.S.
  • Height: 260 mm
  • Returnable: N
  • ISBN-10: 0898712718
  • Publisher Date: 01 Jan 1991
  • Binding: Paperback
  • Language: English
  • Width: 180 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Proceedings of the Second Symposium on Discrete Algorithms
Society for Industrial & Applied Mathematics,U.S. -
Proceedings of the Second Symposium on Discrete Algorithms
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.

Proceedings of the Second Symposium on Discrete Algorithms

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!