ALENEX/ANALCO

Keyphrases

Publications

2005

Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO (2005)
Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO (2005)
Klaus-Bernd Schürmann, Jens Stoye
An Incomplex Algorithm for Fast Suffix Array Construction. ALENEX/ANALCO (2005)
Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders
Better External Memory Suffix Array Construction. ALENEX/ANALCO (2005)
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 ALENEX/ANALCO (2005)
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
On the Adaptiveness of Quicksort. ALENEX/ANALCO (2005)
Tanveer A. Faruquie, Hemanta Kumar Maji, Raghavendra Udupa
A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation. ALENEX/ANALCO (2005)
Dorothea Wagner, Thomas Willhalm
Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO (2005)
Charles Knessl, Wojciech Szpankowski
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types. ALENEX/ANALCO (2005)
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO (2005)
Andrew V. Goldberg, Renato Fonseca F. Werneck
Computing Point-to-Point Shortest Paths from External Memory. ALENEX/ANALCO (2005)
Daniel Berend, Amir Sapir
Complexity of the Path Multi-Peg Tower of Hanoi. ALENEX/ANALCO (2005)
Simon Bliudze, Daniel Krob
Performance Evaluation of Demodulation with DiversityØA Combinatorial Approach III: Threshold Analysis. ALENEX/ANALCO (2005)
Graham R. Brightwell, Peter Winkler
Counting Eulerian Circuits is #P-Complete. ALENEX/ANALCO (2005)
Gregory L. Heileman, Wenbin Luo
How Caching Affects Hashing. ALENEX/ANALCO (2005)
Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes
An Experimental Analysis of Change Propagation in Dynamic Trees. ALENEX/ANALCO (2005)
Alexander Hall, Heiko Schilling
Flows over Time: Towards a More Realistic and Computationally Tractable Model. ALENEX/ANALCO (2005)
Yuriy A. Reznik
On the Average Density and Selectivity of Nodes in Multi-Digit Tries. ALENEX/ANALCO (2005)
Jennie C. Hansen, Eric Schmutz
Comparison of Two CDS Algorithms on Random Unit Ball Graphs. ALENEX/ANALCO (2005)
Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret
Approximating the True Evolutionary Distance between Two Genomes. ALENEX/ANALCO (2005)
Dana Randall, Peter Winkler
Mixing Points on an Interval. ALENEX/ANALCO (2005)
Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO (2005)
Leonor Frias
Extending STL Maps Using LBSTs. ALENEX/ANALCO (2005)
Quanfu Fan, Alon Efrat, Vladlen Koltun, Shankar Krishnan, Suresh Venkatasubramanian
Hardware-Assisted Natural Neighbor Interpolation. ALENEX/ANALCO (2005)
Bernard M. E. Moret
Computational Challenges from the Tree of Life. ALENEX/ANALCO (2005)
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. ALENEX/ANALCO (2005)
Martin Fürer, Shiva Prasad Kasiviswanathan
Approximately Counting Perfect Matchings in General Graphs. ALENEX/ANALCO (2005)