default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX/ANALCO 2005: Vancouver, BC, Canada
- Camil Demetrescu, Robert Sedgewick, Roberto Tamassia:
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. SIAM 2005, ISBN 0-89871-596-2
Workshop on Algorithm Engineering and Experiments
- Bernard M. E. Moret:
Computational Challenges from the Tree of Life. 3-16 - Dorothea Wagner, Thomas Willhalm:
Drawing Graphs to Speed Up Shortest-Path Computations. 17-25 - Andrew V. Goldberg, Renato Fonseca F. Werneck:
Computing Point-to-Point Shortest Paths from External Memory. 26-40 - Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes:
An Experimental Analysis of Change Propagation in Dynamic Trees. 41-54 - Alexander Hall, Heiko Schilling:
Flows over Time: Towards a More Realistic and Computationally Tractable Model. 55-67 - Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. 68-76 - Klaus-Bernd Schürmann, Jens Stoye:
An Incomplex Algorithm for Fast Suffix Array Construction. 78-85 - Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better External Memory Suffix Array Construction. 86-97 - Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink:
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. 98-110 - Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian:
Hardware-Assisted Natural Neighbor Interpolation. 111-120 - Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret:
Approximating the True Evolutionary Distance between Two Genomes. 121-129 - Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz:
On the Adaptiveness of Quicksort. 130-140 - Gregory L. Heileman, Wenbin Luo:
How Caching Affects Hashing. 141-154 - Leonor Frias:
Extending STL Maps Using LBSTs. 155-166 - Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. 167-179 - Tanveer A. Faruquie, Hemanta Kumar Maji, Raghavendra Udupa:
A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation. 180-194
Workshop on Analytic Algorithmics and Combinatorics
- Simon Bliudze, Daniel Krob:
Performance Evaluation of Demodulation with DiversityØA Combinatorial Approach III: Threshold Analysis. 195-205 - Jennie C. Hansen, Eric Schmutz:
Comparison of Two CDS Algorithms on Random Unit Ball Graphs. 206-211 - Daniel Berend, Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi. 212-217 - Dana Randall, Peter Winkler:
Mixing Points on an Interval. 218-221 - Charles Knessl, Wojciech Szpankowski:
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. 222-229 - Yuriy A. Reznik:
On the Average Density and Selectivity of Nodes in Multi-Digit Tries. 230-239 - Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
Mixing Times for Random Walks on Geometric Random Graphs. 240-249 - Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong:
Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. 250-258 - Graham R. Brightwell, Peter Winkler:
Counting Eulerian Circuits is #P-Complete. 259-262 - Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Perfect Matchings in General Graphs. 263-272
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-04 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
