ACM DL

Experimental Algorithmics (JEA)

Menu

Search Issue
enter search term and/or author name

Archive


Journal of Experimental Algorithmics (JEA), Volume 1, 1996

Irredundant intervals
Donald E. Knuth
Article No.: 1
DOI: 10.1145/235141.235146
This expository note presents simplifications of a theorem due to Gy”ri and an algorithm due to Franzblau and Kleitman: Given a family F of m intervals on a linearly ordered set of n elements, we can construct in O(m+n)2 steps an irredundant...

Predicting string search speed
Arthur Gittleman
Article No.: 2
DOI: 10.1145/235141.235147
String search is fundamental in many text processing applications. Sunday recently gave several algorithms to find the first occurrence of a pattern string as a substring of a text, providing experimental data from searches in a text of about...

Practical parallel algorithms for personalized communication and integer sorting
David A. Bader, David R. Helman, Joseph JáJá
Article No.: 3
DOI: 10.1145/235141.235148
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which efficiently execute on general-purpose parallel machines. With the emergence of message passing standards such as MPI, it has...

The influence of caches on the performance of heaps
Anthony LaMarca, Richard Ladner
Article No.: 4
DOI: 10.1145/235141.235145

As memory access times grow larger relative to processor cycle times, the cache performance of algorithms has an increasingly large impact on overall performance. Unfortunately, most commonly used algorithms were not designed with cache...