Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almahu_9948153767902882
    Format: PDFs (pages 169-256) : , illustrations
    ISBN: 9781611972986
    Content: The fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO08), will be held in San Francisco on January 19, 2008, at the Holiday Inn Golden Gateway. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; probabilistic analysis of randomized algorithms, and so on. Submissions that present significant new information about classic algorithms are welcome, as are new analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational.
    Note: On the convergence of upper bound techniques for the average length of longest common subsequences / George S. Lueker -- Markovian embeddings of general random strings / Manuel E. Lladser -- Nearly tight bounds on the encoding length of the Burrows-Wheeler transform / Ankur Gupta, Roberto Grossi, and Jeffrey Scott Vitter -- Bloom maps / David Talbot and John Talbot -- Augmented graph models for small-world analysis with geographical factors / Van Nguyen and Chip Martel -- Exact analysis of the recurrence relations generalized from the Tower of Hanoi / Akihiro Matsuura -- Generating random derangements / Conrado Martínez, Alois Panholzer, and Helmut Prodinger -- On the number of Hamilton cycles in bounded degree graphs / Heidi Gebauer -- Analysis of the expected number of bit comparisons required by Quickselect / James Allen Fill and Takéhiko Nakama. , Mode of access: World Wide Web. , System requirements: Adobe Acrobat Reader.
    Language: English
    Keywords: Konferenzschrift
    URL: SIAM
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages