Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDALENEX/ANALCO 2004: New Orleans, Louisiana, USA
- Lars Arge, Giuseppe F. Italiano, Robert Sedgewick:
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004. SIAM 2004, ISBN 0-89871-564-4
Workshop on Algorithm Engineering and Experiments
- Dan Halperin:
Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). ALENEX/ANALC 2004: 3 - Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther:
Engineering a Cache-Oblivious Sorting Algorith. ALENEX/ANALC 2004: 4-17 - Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt:
The Robustness of the Sum-of-Squares Algorithm for Bin Packing. ALENEX/ANALC 2004: 18-30 - Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, Siu-Ming Yiu:
Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences. ALENEX/ANALC 2004: 31-38 - Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink:
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. ALENEX/ANALC 2004: 39-48 - Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash:
An Experimental Analysis of a Compact Graph Representation. ALENEX/ANALC 2004: 49-61 - Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons:
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. ALENEX/ANALC 2004: 62-69 - Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78 - Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza:
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC 2004: 79-87 - Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Experimental Comparison of Shortest Path Approaches for Timetable Information. ALENEX/ANALC 2004: 88-99 - Ronald J. Gutman:
Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. ALENEX/ANALC 2004: 100-111 - Jean Cardinal, David Eppstein:
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. ALENEX/ANALC 2004: 112-119 - Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz:
Approximating the Visible Region of a Point on a Terrain. ALENEX/ANALC 2004: 120-128 - Leonidas J. Guibas, Menelaos I. Karavelas, Daniel Russel:
A Computational Framework for Handling Motion. ALENEX/ANALC 2004: 129-141 - Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders:
Engineering a Sorted List Data Structure for 32 Bit Key. ALENEX/ANALC 2004: 142-151
Workshop on Analytic Algorithms and Combinatorics
- Philippe Flajolet:
Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk). ALENEX/ANALC 2004: 152 - Mark Daniel Ward, Wojciech Szpankowski:
Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. ALENEX/ANALC 2004: 153-160 - Gill Barequet, Micha Moffie:
The Complexity of Jensen's Algorithm for Counting Polyominoes. ALENEX/ANALC 2004: 161-169 - Viviane Baladi, Brigitte Vallée:
Distribuional Analyses of Euclidean Algorithms. ALENEX/ANALC 2004: 170-184 - Daniel Panario, L. Bruce Richmond, Martha Yip:
A Simple Primality Test and th rth Smallest Prime Factor. ALENEX/ANALC 2004: 185-193 - Pawel Hitczenko, Arnold Knopfmacher:
Gap-Free Samples of Geometric Random Variables. ALENEX/ANALC 2004: 194-198 - Loïck Lhote:
Computation of a Class of COntinued Fraction Constants. ALENEX/ANALC 2004: 199-210 - Helmut Prodinger:
Compositions and Patricia Tries: No Fluctuations in the Variance! ALENEX/ANALC 2004: 211-215 - Martin Fürer:
Quadratic Convergence for Scaling of Matrices. ALENEX/ANALC 2004: 216-223 - Conrado Martínez:
Patial Quicksort. ALENEX/ANALC 2004: 224-228
a service of 
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 2024-04-22 20:01 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:
