812 citations
- Data61AU9 papers
- The University of SydneyAU6 papers
- University of Technology SydneyAU6 papers
- Commonwealth Scientific and Industrial Research OrganisationAU4 papers
- Huazhong University of Science and TechnologyCN3 papers
- Singapore University of Technology and DesignSG3 papers
- Trinity College DublinIE3 papers
- Beijing University of Posts and TelecommunicationsCN2 papers
- Huawei Technologies (Sweden)SE2 papers
- Universitat Pompeu FabraES2 papers
- University of SheffieldGB2 papers
- Advanced Materials and BioEngineering ResearchIE1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Hypersuccinct Trees -- New universal tree source codes for optimal compressed tree data structures and range minima
J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner +1
We present a new universal source code for distributions of unlabeled binary and ordinal trees that achieves optimal compression to within lower order terms for all tree sources co…
cs.DS2017
Optimal Query Time for Encoding Range Majority
Pawel Gawrychowski, Patrick K. Nicholson
We revisit the range -majority problem, which asks us to preprocess an array for a fixed value of , such that for any query range we can return a…