Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
storage complexity
Description:
The amount of memory or storage space required by an algorithm or computational process, often measured as a function of input size.
Related topics:
Computational Geometry and Mesh Generation (8%),
Matrix Theory and Algorithms (7%)
Wikidata ID:
wiki/Q2098905
OpenAlex ID:
keywords/storage-complexity
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
2008
·
D. Needell
, J.A. Tropp
·
Applied and Computational Harmonic Analysis
·
4,679
PDF
Remember What You Want to Forget: Algorithms for Machine Unlearning
2021
·
Sekhari, Ayush
, Acharya, Jayadev
, et al.
·
arXiv (Cornell University)
·
538
PDF
Construction and Arithmetics of H -Matrices
2003
·
Lars Grasedyck
, Wolfgang Hackbusch
·
Computing
·
469
Loop-free routing using diffusing computations
1993
·
J.J. Garcia-Lunes-Aceves
·
IEEE/ACM Transactions on Networking
·
331
Reporting points in halfspaces
1992
·
Jir̆í Matous̆ek
·
Computational Geometry
·
288
PDF
An implicit restarted Lanczos method for large symmetric eigenvalue problems.
1994
·
Daniela Calvetti
, Lothar Reichel
, et al.
·
ETNA - Electronic Transactions on Numerical Analysis
·
253
Deep Model Compression: Distilling Knowledge from Noisy Teachers
2016
·
Sau, Bharat Bhusan
, Balasubramanian, Vineeth N.
·
Research Archive of Indian Institute of Technology Hyderabad (Indian Institute of Technology Hyderabad)
·
208
PDF
A pyramidal data structure for triangle-based surface description
1989
·
L. De Floriani
·
IEEE Computer Graphics and Applications
·
180
Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
2012
·
Vladimir A. Kazeev
, Boris N. Khoromskij
·
SIAM Journal on Matrix Analysis and Applications
·
167
New methods for computing visibility graphs
1988
·
M. H. Overmars
, E. Welzl
·
Annual Symposium on Computational Geometry (SoCG)
·
164
CNN-Based Joint Clustering and Representation Learning with Feature Drift Compensation for Large-Scale Image Data
2017
·
Chih-Chung Hsu
, Chia-Wen Lin
·
IEEE Transactions on Multimedia
·
159
PDF
Black box approximation of tensors in hierarchical Tucker format
2011
·
Jonas Ballani
, Lars Grasedyck
, et al.
·
Linear Algebra and its Applications
·
143
PDF
Range Searching and Point Location among Fat Objects
1996
·
Mark H. Overmars
, Frank A. van der Stappen
·
Journal of Algorithms
·
140
Complexity Bounds for Regular Finite Difference and Finite Element Grids
1973
·
Alan J. Hoffman
, Michael S. Martin
, et al.
·
SIAM Journal on Numerical Analysis
·
130
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing
2019
·
Sarvar Patel
, Giuseppe Persiano
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
129
PDF
Space Lower Bounds for Maze Threadability on Restricted Machines
1980
·
Stephen A. Cook
, Charles W. Rackoff
·
SIAM Journal on Computing
·
121
On a class of finite step iterative methods (Conjugate directions) for the solution of an operator equation arising in electromagnetics
1985
·
T. Sarkar
, E. Arvas
·
IEEE Transactions on Antennas and Propagation
·
119
Arithmetic stream coding using fixed precision registers
1979
·
F. Rubin
·
IEEE Transactions on Information Theory
·
116
Sequential testing algorithms for multiple fault diagnosis
2000
·
M. Shakeri
, V. Raghavan
, et al.
·
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans
·
115
Cryptographic Primitives Enforcing Communication and Storage Complexity
2003
·
Philippe Golle
, Stanislaw Jarecki
, et al.
·
Lecture notes in computer science
·
112
Algorithms for the generation of full-length shift- register sequences
1984
·
T. Etzion
, A. Lempel
·
IEEE Transactions on Information Theory
·
112
Distributed match-making
1988
·
Sape J. Mullender
, Paul M. B. Vitányi
·
Algorithmica
·
107
PDF
A sparse H-matrix arithmetic: general complexity estimates
2000
·
W. Hackbusch
, B.N. Khoromskij
·
Journal of Computational and Applied Mathematics
·
98
PDF
Tensor-product approximation to operators and functions in high dimensions
2007
·
Wolfgang Hackbusch
, Boris N. Khoromskij
·
Journal of Complexity
·
97
Domain decomposition based $${\mathcal H}$$ -LU preconditioning
2009
·
Lars Grasedyck
, Ronald Kriemann
, et al.
·
Numerische Mathematik
·
94
PDF
Show more works
View as search
Works count:
453
Citation count:
14,070
Year
Topic
Type