Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,328,666 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Data structure
Decomposition (computer science)
Dynamic problem (algorithms)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem
Yi-Fei Ming
,
Si-Bo Chen
,
Yong-Quan Chen
,
Zhang-Hua Fu
International Conference on Conceptual Structures
2018
Corpus ID: 49185497
The prize-collecting Steiner tree problem (PCSTP) is one of the important topics in computational science and operations research…
Expand
2007
2007
Dynamic Data Structures for Complex Systems
Luaï Jaff
2007
Corpus ID: 199584516
My work concerns the dynamics of some data structures and complex systems. We presented a combinatorial approach of tableaux and…
Expand
2006
2006
Simplicial models of social aggregation I
M. Mannucci
,
Lisa Sparks
,
D. Struppa
arXiv.org
2006
Corpus ID: 1817
This paper presents the foundational ideas for a new way of modeling social aggregation. Traditional approaches have been using…
Expand
2005
2005
TOWARDS APPLYING MONA IN ABSTRACT REGULAR TREE MODEL CHECKING
Adam Rogalewicz
2005
Corpus ID: 17802385
We consider the problem of automated formal verification of modern concurrent software systems. Dealing with such systems, which…
Expand
2005
2005
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane
Timothy G. Abbott
,
E. Demaine
,
+4 authors
Vincent Yeung
Canadian Conference on Computational Geometry
2005
Corpus ID: 14819912
We provide an efficient data structure for dynamically maintaining a ham-sandwich cut of two nonoverlapping convex polygons in…
Expand
2003
2003
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
P. Agarwal
,
L. Arge
,
Jun Yang
,
K. Yi
Embedded Systems and Applications
2003
Corpus ID: 396334
We develop several linear or near-linear space and I/O-efficient dynamic data structures for orthogonal range-max queries and…
Expand
1997
1997
Compiling and supporting skeletons on MPP
Susanna Pelagatti
Proceedings. Third Working Conference on…
1997
Corpus ID: 17157958
Parallel programming needs a high level programming model in which compilers and run time supports take care of traditionally…
Expand
1994
1994
External-Storage Data Structures for Plane-Sweep Algorithms
L. Arge
1994
Corpus ID: 64063697
In this paper we develop a technique for transforming an internal memory datastructure into an external storage data structure…
Expand
1992
1992
ProdIS: A Database Application for the Support of Computer Integrated Manufacturing
G. Steinegger
,
Rupert Hohl
,
R. Wagner
,
J. Küng
International Conference on Database and Expert…
1992
Corpus ID: 42658787
This paper describes the development and implementation of a relational database application for the KEBA company in Linz. The…
Expand
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…
Expand
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)
ACCEPT & CONTINUE