StringologyTimes

ALENEX for Stringologist

ALENEX 2023

  1. PaCHash: Packed and Compressed Hash Tables.
  2. Multiway Powersort.
  3. LZ77 via Prefix-Free Parsing.
  4. SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
  5. Lower Bounds for Sorting 16, 17, and 18 Elements.

ALENEX 2021

  1. A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries.
  2. PFP Compressed Suffix Trees.

ALENEX 2020

  1. Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory.
  2. Engineering Top-Down Weight-Balanced Trees.
  3. Reverse-Safe Data Structures for Text Indexing.
  4. RecSplit: Minimal Perfect Hashing via Recursive Splitting.

ALENEX 2019

  1. Lightweight Distributed Suffix Array Construction.

ALENEX 2018

  1. Hybrid Indexing Revisited.
  2. Simple, Fast and Lightweight Parallel Wavelet Tree Construction.
  3. Adaptive Cuckoo Filters.

ALENEX 2017

  1. CSA++: Fast Pattern Search for Large Alphabets.
  2. Compact Dynamic Rewritable (CDRW) Arrays.
  3. Engineering External Memory Induced Suffix Sorting.
  4. Engineering a Distributed Full-Text Index.
  5. Elias-Fano meets Single-Term Top-k Document Retrieval.

ALENEX 2016

  1. A General Framework for Dynamic Succinct and Compressed Data Structures.

ALENEX 2015

  1. Improved Single-Term Top-k Document Retrieval.
  2. A Data-Aware FM-index.
  3. Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions.

ALENEX 2014

  1. Multi-Pivot Quicksort: Theory and Experiments.
  2. Top-k Substring Matching for Auto-Completion.

ALENEX 2013

  1. Fast Packed String Matching for Short Patterns.
  2. Lempel-Ziv factorization: Simple, fast, practical.
  3. Inducing Suffix and Lcp Arrays in External Memory.

ALENEX 2012

  1. Fast Compressed Tries through Path Decompositions.
  2. Computing a Consensus of Multilabeled Trees.
  3. Solving the Minimum String Cover Problem.
  4. The Complexity of Partial Orders.

ALENEX 2011

  1. Exact Pattern Matching with Feed-Forward Bloom Filters.
  2. A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.
  3. Fast and Lightweight LCP-Array Construction Algorithms.
  4. A Closer Look at the Closest String and Closest Substring Problem.

ALENEX 2010

  1. Succinct Trees in Practice.

ALENEX 2009

  1. Theory and Practise of Monotone Minimal Perfect Hashing.

ALENEX 2007

  1. Practical Entropy-Compressed Rank/Select Dictionary.

ALENEX 2006

  1. Optimal Incremental Sorting.

ALENEX 2001

  1. Trade Off Between Compression and Search Times in Compact Suffix Array.
  2. Experiments on Adaptive Set Intersections for Text Retrieval Systems.
This site is open source. Improve this page.