Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
memory-constrained computation
Description:
Computation performed under a limited memory budget, motivating algorithms and optimizations that reduce storage requirements or memory traffic.
Related topics:
Parallel Computing and Optimization Techniques (14%),
Complexity and Algorithms in Graphs (11%),
Matrix Theory and Algorithms (8%),
Computational Geometry and Mesh Generation (8%)
OpenAlex ID:
keywords/memory-constrained-computation
Streaming and Out-of-Core Methods
2012
·
Chapman & Hall/CRC eBooks
·
180
Parallel Graph Connectivity in Log Diameter Rounds
2018
·
Alexandr Andoni
, Zhao Song
, et al.
·
Annual Symposium on Foundations of Computer Science
·
129
PDF
Hierarchical Approximate Proper Orthogonal Decomposition
2018
·
Christian Himpe
, Tobias Leibner
, et al.
·
SIAM Journal on Scientific Computing
·
70
PDF
I/O-efficient techniques for computing pagerank
2002
·
Yen-Yu Chen
, Qingqing Gan
, et al.
·
ACM International Conference on Information and Knowledge Management (CIKM)
·
64
Distance spectrum analysis of polar codes
2014
·
Zhenzhen Liu
, Kai Chen
, et al.
·
IEEE Wireless Communications and Networking Conference
·
57
Engineering an External Memory Minimum Spanning Tree Algorithm
2006
·
Roman Dementiev
, Peter Sanders
, et al.
·
Kluwer Academic Publishers eBooks
·
50
PDF
Hierarchical Approximate Proper Orthogonal Decomposition
2018
·
Himpe, C.
, Leibner, T.
, et al.
·
Max Planck Digital Library
·
47
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
1997
·
Frank Dehne
, Wolfgang Dittrich
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
47
Efficient out-of-core algorithms for linear relaxation using blocking covers
2002
·
C.E. Leiserson
, S. Rao
, et al.
·
Annual Symposium on Foundations of Computer Science
·
41
Loop optimization for a class of memory-constrained computations
2001
·
D. Cociorva
, J. W. Wilkins
, et al.
·
International Conference on Supercomputing
·
41
Space- and time-efficient BDD construction via working set control
2002
·
Bwolen Yang
, Yirng-An Chen
, et al.
·
Asia and South Pacific Design Automation Conference (ASP-DAC)
·
33
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel
2012
·
Alexander Shekhovtsov
, Václav Hlaváč
·
International Journal of Computer Vision
·
32
PDF
The Input/Output Complexity of Sparse Matrix Multiplication
2014
·
Rasmus Pagh
, Morten Stöckel
·
Lecture notes in computer science
·
31
Low-Precision Random Fourier Features for Memory-Constrained Kernel Approximation.
2019
·
Jian Zhang
, Avner May
, et al.
·
PubMed
·
27
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale
2021
·
Md Taufique Hussain
, Oguz Selvitopi
, et al.
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
21
PDF
A Survey of Graph Algorithms Under Extended Streaming Models of Computation
2009
·
Thomas C. O’Connell
·
Springer eBooks
·
20
Parallel in-core and out-of-core solution of electrically large problems using the RWG basis functions
2008
·
Yu Zhang
, Mary Taylor
, et al.
·
IEEE Antennas and Propagation Magazine
·
20
Memory-constrained aggregate computation over data streams
2011
·
K.V.M. Naidu
, Rajeev Rastogi
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
16
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
1996
·
Lars Arge
·
BRICS Report Series
·
16
PDF
Type Inference for Sublinear Space Functional Programming
2010
·
Ugo Dal Lago
, Ulrich Schöpp
·
Lecture notes in computer science
·
15
PRIM: A Fast Matrix Transpose Method
1981
·
G.C. Goldbogen
·
IEEE Transactions on Software Engineering
·
13
Languages and Compilers for Parallel Computing
2005
·
Pugh, Bill
, Tseng, Chau-Wen
·
Lecture notes in computer science
·
12
Improving search efficiency using possible subgoals
1995
·
J.F. Dillenburg
, P.C. Nelson
·
Mathematical and Computer Modelling
·
12
PDF
Solving systems of large dense linear equations
1988
·
Roger. G. Grimes
·
The Journal of Supercomputing
·
12
I/O-Efficient Event Based Depression Flood Risk
2017
·
Lars Arge
, Mathias Rav
, et al.
·
Workshop on Algorithm Engineering and Experiments (ALENEX)
·
11
Show more works
View as search
Works count:
115
Citation count:
1,297
Year
Topic
Type