Dynamization

Known as: Dynamic data structures, Dynamization transformation 
In computer science, dynamization is the process of transforming a static data structure into a dynamic one. Although static data structures may… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2017
010203019712017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
High-level synthesis promises a significant shortening of the FPGA design cycle when compared with design entry using register… (More)
  • figure 1
  • table I
Is this relevant?
2010
2010
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The recent discussion in the field of strategic management broadly favors the idea of dynamic capabilities in order to overcome… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2004
2004
The majority of today’s IR systems base the IR task on two main processes: indexing and searching. There exists a special group… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2001
2001
Abst rac t . In this paper we investigate automated methods for externalizing internal memory data structures. We consider a… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a functional language with a type system such that well typed programs run within stated space-bounds. The language is… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Compiling for distributed-memory machines has been a very active research area in recent years. Much of this work has… (More)
  • figure 2
  • figure 3
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
1988
1988
In this paper we present a simple dynamization method that preserves the query and storage costs of a static data structure and… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Review
1985
Review
1985
Many data structures used in computational geometry are quite involved and therefore hard to dynamize. The purpose of this paper… (More)
  • figure 1
  • figure 2
Is this relevant?
1980
1980
In the complexity theory of geometric configurations (and other areas of algorithmic endeavor) one encounters a fair number of… (More)
  • figure 1
Is this relevant?