Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Mathematical modelling > Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)
27%
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)

          
5
4
3
2
1

Out of Stock


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.
Notify me when this book is in stock
Add to Wishlist

About the Book

The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. The ANALCO workshop presents a collection of original research in the analysis of algorithms and associated combinatorial structures. The papers study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and address the precise analysis of algorithms for processing such structures, including average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. This proceedings collects extended versions of the 14 papers that were selected for presentation from the ALENEX workshop and 10 papers selected for presentation from the ANALCO workshop.

Table of Contents:
Preface to the Workshop on Algorithm Engineering and Experiments; Preface to the Workshop on Analytic Algorithmics and Combinatorics; Workshop on Algorithm Engineering and Experiments; Engineering Geometric Algorithms; Persistent Problems and Some Solutions (Abstract of Invited Talk); Dan Halperin; Engineering a Cache-Oblivious Sorting Algorithm; Gerth Stolting Brodal, Rolf Fagerberg, and Kristoffer Vinther; The Robustness of the Sum-of-Squares Algorithm for Bin Packing; Michael A. Bender, Bryan Bradley, Geetha Jagannathan, and Krishnan Pillaipakkamnatt; Practical Aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences; Wing-Kal Hon, Tak-Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, and Slu-Ming Yiu; Faster Placement of Hydrogens in Protein Structures by Dynamic Programming Andrew Leaver-Fay, Yuanxin Liu, and Jack Snoeyink; An Experimental Analysis of a Compact Graph Representation Daniel K. Blandford, Guy E. Blelloch, and lan A. Kash; Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, and Christopher T. Symons; Safe Separators for Treewidth Hans L. Bodiaender and Arie M.C.A. Koster; Efficient Implementation of a Hotlink Assignment Algorithm for Web Sites Artur Alves Pessoa, Eduardo Sany Laber, and Criston de Souza; Experimental Comparison of Shortest Path Approaches for Timetable Information; Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis; Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks Ron Gutman; Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures Jean Cardinal and David Eppstein; Approximating the Visible Region of a Point on a Terrain Boaz Ben-Moshe, Paz Carmi, and Matthew J. Katz; A Computational Framework for Handling Motion Leonidas Guibas, Menelaos I. Karavelas, and Daniel Russel; Engineering a Sorted List Data Structure for 32 Bit Keys Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders; Workshop on Analytic Algorithmics and Combinatorics; Theory and Practice of Probabllistic Counting Algorithms (Abstract of Invited Talk) Phllippe Flajolet; Analysis of a Randomized Selection Algorithm Motivated by the LZ'77 Scheme Mark Daniel Ward and Wojciech Szpankowski; The Complexity of Jensen's Algorithm for Counting Polyominoes Gill Barequet and Micha Moffie; Distributional Analyses of Euclidean Algorithms Viviane Baladi and Brigitte Vallee; A Simple Primality Test and the rth Smallest Prime Factor; Daniel Panario, Bruce Richmond, and Martha Yip; Gap-Free Samples of Geometric Random Variables; Pawel Hitczenko and Arnold Knopfmacher; Computation of a Class of Continued Fraction Constants Loick Lhote; Compositions and Patricia Tries: No Fluctuations in the Variancel; Helmut Prodinger; Quadratic Convergence for Scaling of Matrices; Martin Furer; Partial Quicksort; Conrado Martinez


Best Sellers


Product Details
  • ISBN-13: 9780898715644
  • Publisher: Society for Industrial & Applied Mathematics,U.S.
  • Publisher Imprint: Society for Industrial & Applied Mathematics,U.S.
  • Height: 0 mm
  • No of Pages: 229
  • Series Title: No. 115 Proceedings in Applied Mathematics S.
  • Width: 0 mm
  • ISBN-10: 0898715644
  • Publisher Date: 20 Oct 2004
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Weight: 700 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
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)
Society for Industrial & Applied Mathematics,U.S. -
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)
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 Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO): (No. 115 Proceedings in Applied Mathematics S.)

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