Experimental Algorithmics (JEA)


Search Issue
enter search term and/or author name


Journal of Experimental Algorithmics (JEA), Volume 22 Issue 1, May 2017

Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
Uwe Baier, Timo Beller, Enno Ohlebusch
Article No.: 1.1
DOI: 10.1145/3035540

A compressed suffix tree usually consists of three components: a compressed suffix array, a compressed LCP-array, and a succinct representation of the suffix tree topology. There are parallel algorithms that construct the suffix array and the...

Practical Compact Indexes for Top-k Document Retrieval
Simon Gog, Roberto Konow, Gonzalo Navarro
Article No.: 1.2
DOI: 10.1145/3043958

We present a fast and compact index for top-k document retrieval on general string collections, in which given a string pattern, the index returns the k documents where it appears most often. We adapt a linear-space and optimal-time...

Array Layouts for Comparison-Based Searching
Paul-Virak Khuong, Pat Morin
Article No.: 1.3
DOI: 10.1145/3053370

We attempt to determine the best order and search algorithm to store n comparable data items in an array, A, of length n so we can, for any query value, x, quickly find the smallest value in A that is greater...