Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Algorithms and Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 Lecture Notes in Computer Science)
Algorithms and Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 Lecture Notes in Computer Science)

Algorithms and Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 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

th This volume contains the proceedings of the 10 ISAAC conference (Tenth - nual International Symposium on Algorithms And Computation) held in Ch- nai, India. This year's conference attracted 71 submissions from as many as 17 di erent countries. Each submission was reviewed by at least three independent referees. After a week-long e-mail discussion, the program committee agreed to include 40 papers in the conference program. The high acceptance rate is clearly an indication of the quality of the papers received. We thank the program c- mittee members and the reviewers for their sincere e orts. We were fortunate to have three invited speakers this year, providing for a very attractive program: Kurt Mehlhorn (MPI, Saarbruck .. en, Germany), Eva T- dos (Cornell University, U.S.A.), and Kokichi Sugihara (Univ. of Tokyo, Japan). Moreover, the conference was preceded by a tutorial on a cutting-edge area, Web Algorithmics by Monika Henzinger (Compaq Systems Research Center, Palo Alto, U.S.A.) as a joint event with FST&TCS 99 (Foundations of Software Te- nology and Theoretical Computer Science, December 13-15, 1999, Chennai).Asa post conference event, a two-day workshop on Approximate Algorithms by R. Ravi (CMU, U.S.A.) and Naveen Garg (IIT, Delhi) was organized. We thank all the in- ted speakers and special event speakers for agreeing to participate in ISAAC'99.

Table of Contents:
Invited Talk.- The Engineering of Some Bipartite Matching Programs.- Session 1(a) - Data Structure I.- General Splay: A Basic Theory and Calculus.- Static Dictionaries Supporting Rank.- Session 1(b) - Parallel & Distributed Computing I.- Multiple Spin-Block Decisions.- Asynchronous Random Polling Dynamic Load Balancing.- Session 2(a) - Approximate Algorithm I.- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability.- Hardness of Approximating Independent Domination in Circle Graphs.- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs.- Session 2(b) - Computational Intelligence.- Ordered Binary Decision Diagrams as Knowledge-Bases.- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.- Session 3(a) - Online Algorithm.- On-Line Load Balancing of Temporary Tasks Revisited.- Online Routing in Triangulations.- Session 3(b) - Complexity Theory I.- The Query Complexity of Program Checking by Constant-Depth Circuits.- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle.- Session 4(a) - Approximate Algorithm II.- Efficient Approximation Algorithms for Multi-label Map Labeling.- Approximation Algorithms in Batch Processing.- Session 4(b) - Graph Algorithm I.- LexBFS-Ordering in Asteroidal Triple-Free Graphs.- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs.- Invited Talk.- Approximation Algorithms for Some Clustering and Classification Problems.- Session 5(a) - Computational Geometry I.- How Many People Can Hide in a Terrain?.- Carrying Umbrellas: An Online Relocation Problem on Graphs.- Session 5(b) - Parallel & Distributed Computing II.- Survivable Networks with Bounded Delay: The Edge FailureCase.- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks.- Session 6(a) - Data Structure II.- Constructing the Suffix Tree of a Tree with a Large Alphabet.- An O(1) Time Algorithm for Generating Multiset Permutations.- Session 6(b) - Complexity Theory II.- Upper Bounds for MaxSat: Further Improved.- A Linear Time Algorithm for Recognizing Regular Boolean Functions.- Session 7(a) - Computational Geometry II.- Station Layouts in the Presence of Location Constraints.- Reverse Center Location Problem.- Session 7(b) - Algorithms in Practice.- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields.- External Memory Algorithms for Outerplanar Graphs.- Session 8(a) - Approximate Algorithm III.- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.- Approximation Algorithms for Channel Assignment with Constraints.- Session 8(b) - Graph Algorithm II.- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs.- A Linear Algorithm for Finding Total Colorings of Partial k-Trees.- Invited Talk.- Topology-Oriented Approach to Robust Geometric Computation.- Session 9(a) - Approximate Algorithm IV.- Approximating Multicast Congestion.- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.- Session 9(b) - Parallel & Distributed Computing III.- Online Scheduling of Parallel Communications with Individual Deadlines.- A Faster Algorithm for Finding Disjoint Paths in Grids.- Session 10(a) - Computational Geometry III.- Output-Sensitive Algorithms for Uniform Partitions of Points.- Convexifying Monotone Polygons.- Session 10(b) - Graph Algorithm III.- Bisecting Two Subsets in 3-Connected Graphs.- Generalized Maximum Independent Sets for Trees in Subquadratic Time.


Best Sellers


Product Details
  • ISBN-13: 9783540669166
  • 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: 454
  • Returnable: Y
  • Spine Width: 24 mm
  • Weight: 648 gr
  • ISBN-10: 3540669167
  • Publisher Date: 01 Dec 1999
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Series Title: 1741 Lecture Notes in Computer Science
  • Sub Title: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 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 Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Algorithms and Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 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 Computations: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings(1741 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