The following pages link to Alexander Golynski (Q437675):
Displayed 17 items.
- Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- Longest increasing subsequences in sliding windows (Q1885912) (← links)
- Adaptive searching in succinctly encoded binary relations and tree-structured documents (Q2465061) (← links)
- Optimal lower bounds for rank and select indexes (Q2465065) (← links)
- (Q3046492) (← links)
- On the Redundancy of Succinct Data Structures (Q3512455) (← links)
- On the Size of Succinct Indices (Q3527227) (← links)
- Rank/select operations on large alphabets (Q3581537) (← links)
- Optimal Lower Bounds for Rank and Select Indexes (Q3613774) (← links)
- (Q4633874) (← links)
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents (Q5307490) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897218) (← links)
- Algorithms - ESA 2003 (Q5897237) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900317) (← links)