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

No records found.

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Patrick K. Nicholson