Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
memory-efficient algorithms
Description:
Computational procedures designed to solve problems while minimizing the amount of memory they require.
Related topics:
Algorithms and Data Compression (15%),
Advanced Database Systems and Queries (8%)
OpenAlex ID:
keywords/space-efficient-algorithms
Function minimization by conjugate gradients
1964
·
R. Fletcher
·
The Computer Journal
·
5,799
CLUSTAL: a package for performing multiple sequence alignment on a microcomputer
1988
·
Desmond G. Higgins
, Paul M. Sharp
·
Gene
·
3,720
Two-Point Step Size Gradient Methods
1988
·
JONATHAN BARZILAI
, JONATHAN M. BORWEIN
·
IMA Journal of Numerical Analysis
·
3,375
ViBe: A Universal Background Subtraction Algorithm for Video Sequences
2010
·
O Barnich
, M Van Droogenbroeck
·
IEEE Transactions on Image Processing
·
2,016
Scalable algorithms for association mining
2000
·
M.J. Zaki
·
IEEE Transactions on Knowledge and Data Engineering
·
1,986
An improved algorithm for matching biological sequences
1982
·
Osamu Gotoh
·
Journal of Molecular Biology
·
1,926
A Space-Economical Suffix Tree Construction Algorithm
1976
·
Edward M. McCreight
·
Journal of the ACM
·
1,731
PDF
Finding frequent items in data streams
2003
·
Moses Charikar
, Kevin Chen
, et al.
·
Theoretical Computer Science
·
1,483
Proteinortho: Detection of (Co-)orthologs in large-scale analysis
2011
·
Marcus Lechner
, Sven Findeiß
, et al.
·
BMC Bioinformatics
·
1,297
PDF
Data Streams: Algorithms and Applications
2005
·
S. Muthukrishnan
·
Foundations and Trends® in Theoretical Computer Science
·
1,116
Finding Frequent Items in Data Streams
2002
·
Moses Charikar
, Kevin Chen
, et al.
·
Lecture notes in computer science
·
1,025
SPRINT: A Scalable Parallel Classifier for Data Mining
1996
·
John Shafer
, Rakesh Agrawal
, et al.
·
Very Large Data Bases
·
972
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
2007
·
Philippe Flajolet
, Éric Fusy
, et al.
·
Discrete Mathematics & Theoretical Computer Science
·
888
PDF
Efficient Computation of Frequent and Top-k Elements in Data Streams
2004
·
Ahmed Metwally
, Divyakant Agrawal
, et al.
·
Lecture notes in computer science
·
842
Algorithms for approximate string matching
1985
·
Esko Ukkonen
·
Information and Control
·
721
PDF
Clustering data streams
2002
·
S. Guha
, N. Mishra
, et al.
·
Annual Symposium on Foundations of Computer Science
·
715
An Efficient Method for Generating Discrete Random Variables with General Distributions
1977
·
Alastair J. Walker
·
ACM Transactions on Mathematical Software
·
707
PDF
Oct-trees and their use in representing three-dimensional objects
1980
·
Chris L. Jackins
, Steven L. Tanimoto
·
Computer Graphics and Image Processing
·
663
Streaming-data algorithms for high-quality clustering
2003
·
L. O'Callaghan
, N. Mishra
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
662
Ripser: efficient computation of Vietoris–Rips persistence barcodes
2021
·
Ulrich Bauer
·
Journal of Applied and Computational Topology
·
650
PDF
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
2006
·
Petros Drineas
, Ravi Kannan
, et al.
·
SIAM Journal on Computing
·
641
Fast low-rank modifications of the thin singular value decomposition
2005
·
Matthew Brand
·
Linear Algebra and its Applications
·
623
PDF
Analyzing and comparing Montgomery multiplication algorithms
1996
·
C. Kaya Koc
, T. Acar
, et al.
·
IEEE Micro
·
606
What's hot and what's not: tracking most frequent items dynamically
2005
·
Graham Cormode
, S. Muthukrishnan
·
ACM Transactions on Database Systems
·
570
A simple algorithm for finding frequent elements in streams and bags
2003
·
Richard M. Karp
, Scott Shenker
, et al.
·
ACM Transactions on Database Systems
·
564
Show more works
View as search
Works count:
2,873
Citation count:
77,080
Year
Topic
Type