| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 6876094 (Why is no real title available?)
| 2018-05-29 | Paper |
A compact data structure for representing a dynamic multiset
Information Processing Letters | 2017-11-03 | Paper |
Periodic boundary value problem for the graph differential equation and the matrix differential equation
| 2017-09-26 | Paper |
Encoding range minima and range top-2 queries
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Quasilinearization for periodic boundary value problem of graph differential equations and its associated matrix differential equations
| 2016-08-17 | Paper |
A simplified NP-complete MAXSAT problem
Information Processing Letters | 2016-06-09 | Paper |
Succinct indexes for strings, binary relations and multi-labeled trees
| 2014-12-18 | Paper |
Optimal indexes for sparse bit vectors
Algorithmica | 2014-11-19 | Paper |
An optimal bloom filter replacement
| 2014-10-13 | Paper |
A categorization theorem on suffix arrays with applications to space efficient text indexes
| 2014-10-13 | Paper |
Encodings for range selection and top-\(k\) queries
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Theory and implementation of online multiselection algorithms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A Survey of Data Structures in the Bitprobe Model
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Succinct representations of ordinal trees
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Dynamic Compressed Strings with Random Access
Automata, Languages, and Programming | 2013-08-06 | Paper |
On space efficient two dimensional range minimum data structures
Algorithmica | 2012-12-06 | Paper |
Two Dimensional Range Minimum Queries and Fibonacci Lattices
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Succinct representations of permutations and functions
Theoretical Computer Science | 2012-08-08 | Paper |
External memory planar point location with logarithmic updates
Algorithmica | 2012-04-26 | Paper |
More haste, less waste: lowering the redundancy in fully indexable dictionaries
| 2012-04-24 | Paper |
Encoding 2D range maximum queries
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Path minima queries in dynamic weighted trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Succinct dynamic cardinal trees with constant time operations for small alphabet
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Integer representations towards efficient counting in the bit probe model
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On space efficient two dimensional range minimum data structures
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Rank/select operations on large alphabets
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Universal Succinct Representations of Trees?
Automata, Languages and Programming | 2009-07-14 | Paper |
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
On the Size of Succinct Indices
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On the Redundancy of Succinct Data Structures
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Theoretical Computer Science | 2007-12-19 | Paper |
Succinct Ordinal Trees Based on Tree Covering
Automata, Languages and Programming | 2007-11-28 | Paper |
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Representing trees of higher degree
Algorithmica | 2006-03-21 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
| 2004-11-29 | Paper |
Longest increasing subsequences in sliding windows
Theoretical Computer Science | 2004-11-12 | Paper |
scientific article; zbMATH DE number 2038723 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 2038722 (Why is no real title available?)
| 2004-02-08 | Paper |
scientific article; zbMATH DE number 1984684 (Why is no real title available?)
| 2003-09-22 | Paper |
scientific article; zbMATH DE number 1964848 (Why is no real title available?)
| 2003-08-17 | Paper |
scientific article; zbMATH DE number 1875423 (Why is no real title available?)
| 2003-03-02 | Paper |
Time-space trade-offs for compressed suffix arrays.
Information Processing Letters | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1830754 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1522919 (Why is no real title available?)
| 2001-02-27 | Paper |
Space efficient suffix trees
Journal of Algorithms | 2001-01-01 | Paper |
