Proceedings of the sixth workshop on algorithm engineering and experiments and the first workshop on analytic algorithmics and combinatorics
著者
書誌事項
Proceedings of the sixth workshop on algorithm engineering and experiments and the first workshop on analytic algorithmics and combinatorics
Society for Industrial and Applied Mathematics, c2004
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
Proceedings of the sixth workshop on algorithm engineering and experiments New Orleans, La., January 10, 2004
Proceedings of the first workshop on analytic algorithmics and combinatorics, New Orleans, La., January 10, 2004
内容説明・目次
内容説明
The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. The ANALCO workshop presents a collection of original research in the analysis of algorithms and associated combinatorial structures. The papers study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and address the precise analysis of algorithms for processing such structures, including average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms.
This proceedings collects extended versions of the 14 papers that were selected for presentation from the ALENEX workshop and 10 papers selected for presentation from the ANALCO workshop.
目次
- Preface to the Workshop on Algorithm Engineering and Experiments
- Preface to the Workshop on Analytic Algorithmics and Combinatorics
- Workshop on Algorithm Engineering and Experiments
- Engineering Geometric Algorithms
- Persistent Problems and Some Solutions (Abstract of Invited Talk)
- Dan Halperin
- Engineering a Cache-Oblivious Sorting Algorithm
- Gerth Stolting Brodal, Rolf Fagerberg, and Kristoffer Vinther
- The Robustness of the Sum-of-Squares Algorithm for Bin Packing
- Michael A. Bender, Bryan Bradley, Geetha Jagannathan, and Krishnan Pillaipakkamnatt
- Practical Aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences
- Wing-Kal Hon, Tak-Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, and Slu-Ming Yiu
- Faster Placement of Hydrogens in Protein Structures by Dynamic Programming Andrew Leaver-Fay, Yuanxin Liu, and Jack Snoeyink
- An Experimental Analysis of a Compact Graph Representation Daniel K. Blandford, Guy E. Blelloch, and lan A. Kash
- Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, and Christopher T. Symons
- Safe Separators for Treewidth Hans L. Bodiaender and Arie M.C.A. Koster
- Efficient Implementation of a Hotlink Assignment Algorithm for Web Sites Artur Alves Pessoa, Eduardo Sany Laber, and Criston de Souza
- Experimental Comparison of Shortest Path Approaches for Timetable Information
- Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
- Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks Ron Gutman
- Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures Jean Cardinal and David Eppstein
- Approximating the Visible Region of a Point on a Terrain Boaz Ben-Moshe, Paz Carmi, and Matthew J. Katz
- A Computational Framework for Handling Motion Leonidas Guibas, Menelaos I. Karavelas, and Daniel Russel
- Engineering a Sorted List Data Structure for 32 Bit Keys Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders
- Workshop on Analytic Algorithmics and Combinatorics
- Theory and Practice of Probabllistic Counting Algorithms (Abstract of Invited Talk) Phllippe Flajolet
- Analysis of a Randomized Selection Algorithm Motivated by the LZ'77 Scheme Mark Daniel Ward and Wojciech Szpankowski
- The Complexity of Jensen's Algorithm for Counting Polyominoes Gill Barequet and Micha Moffie
- Distributional Analyses of Euclidean Algorithms Viviane Baladi and Brigitte Vallee
- A Simple Primality Test and the rth Smallest Prime Factor
- Daniel Panario, Bruce Richmond, and Martha Yip
- Gap-Free Samples of Geometric Random Variables
- Pawel Hitczenko and Arnold Knopfmacher
- Computation of a Class of Continued Fraction Constants Loick Lhote
- Compositions and Patricia Tries: No Fluctuations in the Variancel
- Helmut Prodinger
- Quadratic Convergence for Scaling of Matrices
- Martin Furer
- Partial Quicksort
- Conrado Martinez
「Nielsen BookData」 より