Lookup table

Known as: Table lookup, Look-up table, Lookup 
In computer science, a lookup table is an array that replaces runtime computation with a simpler array indexing operation. The savings in terms of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
020040019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We present a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value… (More)
  • table I
  • figure 1
  • table II
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called fast lookup table… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 9
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Hash tables are fundamental components of several network processing algorithms and applications, including route lookup, packet… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Wirelength estimation is an important tool to guide the design optimization process in early design stages. In this paper, we… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
For some time, the networking community has assumed that it is impossible to do IP routing lookups in software fast enough to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
  • Marcel Waldvogely, George Varghesez, Jon Turnerz, Bernhard Plattnery
  • 1997
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper investigates fast routing table lookup techniques, where the table is composed of hierarchical addresses such as those… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A new technology mapping algorithm for lookup tablebased Field Programmable Gate Arrays (FPGA) is presented. The major innovation… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?