Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
linear space data structures
Description:
Data structures whose storage requirements grow linearly with the size of the represented input.
Primary topic:
Algorithms and Data Compression (56%)
Related topics:
Algorithms and Data Compression (56%),
Computational Geometry and Mesh Generation (23%),
Complexity and Algorithms in Graphs (7%)
OpenAlex ID:
keywords/linear-space-data-structures
Efficient partition trees
1992
·
Jiří Matoušek
·
Discrete & Computational Geometry
·
325
PDF
Complete inverted files for efficient text retrieval and analysis
1987
·
A. Blumer
, J. Blumer
, et al.
·
Journal of the ACM
·
293
PDF
Range searching with efficient hierarchical cuttings
1993
·
Jiří Matoušek
·
Discrete & Computational Geometry
·
269
PDF
Haplotyping as Perfect Phylogeny: A Direct Approach
2003
·
Vineet Bafna
, Dan Gusfield
, et al.
·
Journal of Computational Biology
·
148
Dynamic ordered sets with exponential search trees
2007
·
Arne Andersson
, Mikkel Thorup
·
Journal of the ACM
·
134
PDF
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates
2017
·
Muhammad Idris
, Martin Ugarte
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
130
Fast set intersection in memory
2011
·
Bolin Ding
, Arnd Christian König
·
Proceedings of the VLDB Endowment
·
109
PDF
Space-Efficient Framework for Top-k String Retrieval Problems
2009
·
Wing-Kai Hon
, Rahul Shah
, et al.
·
Annual Symposium on Foundations of Computer Science
·
109
Priority queues: Small, monotone and trans-dichotomous
1996
·
Rajeev Raman
·
Lecture notes in computer science
·
107
Halfplanar range search in linear space and O(n0.695) query time
1986
·
Herbert Edelsbrunner
, Emo Welzl
·
Information Processing Letters
·
101
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
2004
·
Stephen Alstrup
, Cyril Gavoille
, et al.
·
Theory of Computing Systems
·
99
Tight(er) worst-case bounds on dynamic searching and priority queues
2000
·
Arne A. Andersson
, Mikkel Thorup
·
ACM Symposium on Theory of Computing (STOC)
·
90
Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency
2018
·
Ioannis Demertzis
, Dimitrios Papadopoulos
, et al.
·
Lecture notes in computer science
·
85
PDF
Top-k document retrieval in optimal time and linear space
·
Gonzalo Navarro
, Yakov Nekrich
·
80
Optimal Halfspace Range Reporting in Three Dimensions
2009
·
Peyman Afshani
, Timothy M. Chan
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
72
Fusion trees can be implemented with AC0 instructions only
1999
·
Arne Andersson
, Peter Bro Miltersen
, et al.
·
Theoretical Computer Science
·
70
PDF
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
2013
·
Timothy M. Chan
·
ACM Transactions on Algorithms
·
69
Top- k Document Retrieval in Optimal Time and Linear Space
2012
·
Gonzalo Navarro
, Yakov Nekrich
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
69
PDF
Space and Time Efficient Kernel Density Estimation in High Dimensions
2019
·
Artūrs Bačkurs
, Piotr Indyk
, et al.
·
neural information processing systems
·
68
Orthogonal range searching in linear and almost-linear space
2008
·
Yakov Nekrich
·
Computational Geometry
·
66
PDF
Optimal halfspace range reporting in three dimensions
2009
·
Peyman Afshani
, Timothy M. Chan
·
Symposium on Discrete Algorithms
·
65
Finding influential communities in massive networks
2017
·
Rong-Hua Li
, Lu Qin
, et al.
·
The VLDB Journal
·
62
Exact Distance Oracles for Planar Graphs
2012
·
Shay Mozes
, Christian Sommer
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
61
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs
2011
·
Ken-ichi Kawarabayashi
, Philip N. Klein
, et al.
·
Lecture notes in computer science
·
61
PDF
Linear-Space Data Structures for Range Mode Query in Arrays
2013
·
Timothy M. Chan
, Stephane Durocher
, et al.
·
Theory of Computing Systems
·
60
Show more works
View as search
Works count:
187
Citation count:
4,406
Year
Topic
Type