Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Computer scienceData structureDecomposition (computer science)Dynamic problem (algorithms)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Fully dynamic update of arc‐flags
Best connections in real networks are usually found by applying Dijkstra's shortest paths algorithm. Unfortunately, networks… 
2006
2006
Extending separation logic with fixpoints and postponed substitution
2003
2003
Data Structure Analysis: An Ecien t Context-Sensitive Heap Analysis
This paper presents an efficient context-sensitive heap analysis algorithm called Data Structure Analysis designed to enable… 
Highly Cited
2002
Highly Cited
2002
Dynamic Data Structures for a Direct Search Algorithm
The DIRECT (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications… 
2001
2001
Online Hierarchical Graph Drawing
We propose a heuristic for dynamic hierarchical graph drawing. Applications include incremental graph browsing and editing… 
2000
2000
Monte-Carlo algorithms for layout density control
Chemical-mechanical polishing (CMP) and other manufacturing steps in very deep submicron VLSI have varying effects on device and… 
1996
1996
Complete parallelization of computations: integration of data partitioning and functional parallelism for dynamic data structures
This paper presents a parallel programming system which: supports complete parallelization of array-oriented computations through… 
1995
1995
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
An environment for general research into and prototyping of algorithms for reliable constrained and unconstrained global… 
1993
1993
Taking random walks to grow trees in hypercubes
Many parallel computations are tree structured; as the computation proceeds, new processes are recursively created while others… 
1986
1986
Practical Applications of Precedence Graph Grammars
  • M. Kaul
  • Graph-Grammars and Their Application to Computer…
  • 1986
  • Corpus ID: 6217422
Precedence graph grammars are of major interest in all those applications of graph grammars, where highly efficient parsers are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)