The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithm Engineering and Experimentation (ALENEX) (alenex)
2004 (conf/alenex/2004)

  1. Dan Halperin
    Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk). [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:3- [Conf]
  2. Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
    Engineering a Cache-Oblivious Sorting Algorith. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:4-17 [Conf]
  3. Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt
    The Robustness of the Sum-of-Squares Algorithm for Bin Packing. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:18-30 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:31-38 [Conf]
  5. Andrew Leaver-Fay, Yuanxin Liu, Jack Snoeyink
    Faster Placement of Hydrogens in Protein Structures by Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:39-48 [Conf]
  6. Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
    An Experimental Analysis of a Compact Graph Representation. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:49-61 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:62-69 [Conf]
  8. Hans L. Bodlaender, Arie M. C. A. Koster
    Safe Seperators for Treewidth. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:70-78 [Conf]
  9. Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
    Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:79-87 [Conf]
  10. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
    Experimental Comparison of Shortest Path Approaches for Timetable Information. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:88-99 [Conf]
  11. Ronald J. Gutman
    Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:100-111 [Conf]
  12. Jean Cardinal, David Eppstein
    Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:112-119 [Conf]
  13. Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
    Approximating the Visible Region of a Point on a Terrain. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:120-128 [Conf]
  14. Leonidas J. Guibas, Menelaos I. Karavelas, Daniel Russel
    A Computational Framework for Handling Motion. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:129-141 [Conf]
  15. Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders
    Engineering a Sorted List Data Structure for 32 Bit Key. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:142-151 [Conf]
  16. Philippe Flajolet
    Theory and Practice of Probabilistic Counting Algorithms (Abstract of Invited Talk). [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:152- [Conf]
  17. Mark Daniel Ward, Wojciech Szpankowski
    Analysis of Randomized Selection Algorithm Motivated by the LZ'77 Scheme. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:153-160 [Conf]
  18. Gill Barequet, Micha Moffie
    The Complexity of Jensen's Algorithm for Counting Polyominoes. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:161-169 [Conf]
  19. Viviane Baladi, Brigitte Vallée
    Distribuional Analyses of Euclidean Algorithms. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:170-184 [Conf]
  20. Daniel Panario, L. Bruce Richmond, Martha Yip
    A Simple Primality Test and th rth Smallest Prime Factor. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:185-193 [Conf]
  21. Pawel Hitczenko, Arnold Knopfmacher
    Gap-Free Samples of Geometric Random Variables. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:194-198 [Conf]
  22. Loïck Lhote
    Computation of a Class of COntinued Fraction Constants. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:199-210 [Conf]
  23. Helmut Prodinger
    Compositions and Patricia Tries: No Fluctuations in the Variance! [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:211-215 [Conf]
  24. Martin Fürer
    Quadratic Convergence for Scaling of Matrices. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:216-223 [Conf]
  25. Conrado Martínez
    Patial Quicksort. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:224-228 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002