Alexander Golynski

Available identifiers

Publication	Date of Publication	Type
Cell probe lower bounds for succinct data structures	2019-05-06	Paper
Optimal indexes for sparse bit vectors	2014-11-19	Paper
Optimal strategies for the list update problem under the MRM alternative cost model	2012-07-18	Paper
Sorting with networks of data structures	2010-11-05	Paper
Rank/select operations on large alphabets	2010-08-16	Paper
Optimal dynamic video-on-demand using adaptive broadcasting	2010-03-03	Paper
An efficient bounds consistency algorithm for the global cardinality constraint	2010-03-02	Paper
Optimal Lower Bounds for Rank and Select Indexes	2009-03-12	Paper
On the Size of Succinct Indices	2008-09-25	Paper
Principles and Practice of Constraint Programming – CP 2004	2008-09-09	Paper
On the Redundancy of Succinct Data Structures	2008-07-15	Paper
Adaptive searching in succinctly encoded binary relations and tree-structured documents	2007-12-19	Paper
Optimal lower bounds for rank and select indexes	2007-12-19	Paper
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents	2007-09-14	Paper
An efficient bounds consistency algorithm for the global cardinality constraint	2006-02-23	Paper
Longest increasing subsequences in sliding windows	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3046492	2004-08-12	Paper

This page was built for person: Alexander Golynski