Patrick K. Nicholson

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6075965	2023-09-20	Paper
A general framework for dynamic succinct and compressed data structures	2019-09-12	Paper
Efficient set intersection counting algorithm for text similarity measures	2019-09-12	Paper
Revisiting explicit adaptive two-probe schemes	2019-01-18	Paper
Optimal distance labeling schemes for trees	2017-10-11	Paper
Optimal query time for encoding range majority	2017-09-22	Paper
Succinct posets	2016-10-21	Paper
Dynamic range majority data structures	2016-09-01	Paper
Optimal encodings for range top-\(k\), selection, and min-max	2015-10-27	Paper
Algorithms in the ultra-wide word model	2015-09-30	Paper
Encodings of range maximum-sum segment queries and applications	2015-08-20	Paper
Encoding Nearest Larger Values	2015-08-20	Paper
Weighted ancestors in suffix trees	2014-10-08	Paper
Improved explicit data structures in the bitprobe model	2014-10-08	Paper
The Distance 4-Sector of Two Points Is Unique	2014-01-14	Paper
A Survey of Data Structures in the Bitprobe Model	2013-09-13	Paper
Range majority in constant time and linear space	2013-06-06	Paper
A space-efficient framework for dynamic point location	2013-03-21	Paper
Succinct posets	2012-09-25	Paper
Dynamic range majority data structures	2011-12-16	Paper
Dynamic range selection in linear space	2011-12-16	Paper
Untangled monotonic chains and adaptive range search	2011-07-27	Paper
Range Majority in Constant Time and Linear Space	2011-07-06	Paper
Untangled monotonic chains and adaptive range search	2009-12-17	Paper

This page was built for person: Patrick K. Nicholson