Space–time tradeoff

Known as: Space–time trade-off, Space time tradeoff, Time-space tradeoff 
In computer science, * space refers to the data storage consumed in performing a given task, whether primary (e.g., in RAM) or secondary (e.g., on a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Many combinatorial problems---such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem---can be… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to brute-force dictionary… (More)
  • figure 1
Is this relevant?
2005
2005
Nisan showed that any randomized logarithmic space algorithm (running in polynomial time and with two-sided error) can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?
1999
1999
A memory-based heuristic is a function, h(s), stored in the form of a lookup table (pattern database): h(s) is computed by… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time. Such… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A growing number of probabilistic algorithms have been shown to work well under the assumption of limited randomness. For example… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In this paper, we raise and investigate the question of (storage) space- (retrieval) time tradeoff for a static database, in the… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In a general sequential model of computation, no restrictions are placed on the way in which the computation may proceed, except… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
A&M&-A probabilistic method is presented wtdcb cryptanalyzes any N key cryptosystem in N2i3 operations with N2j3 words of memory… (More)
  • figure 1
Is this relevant?