Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
274,108
Dynamic data structures for fat . . .
, 1999
"... We present several ecient dynamic data structures for point-enclosure queries involving convex fat objects in R² or ..."
Abstract
- Add to MetaCart
We present several ecient dynamic data structures for point-enclosure queries involving convex fat objects in R² or
The Reconstruction of Dynamic Data Structures
, 1986
"... In this paper the reconstruction problem for dynamic data structures is studied: Given a dynamic data structure, construct a shadow administration, which is stored in the safe secondary memory, such that in case of calamity the original data structure can be reconstructed. Some basic solutions to t ..."
Abstract
- Add to MetaCart
In this paper the reconstruction problem for dynamic data structures is studied: Given a dynamic data structure, construct a shadow administration, which is stored in the safe secondary memory, such that in case of calamity the original data structure can be reconstructed. Some basic solutions
Supporting Dynamic Data Structures on Distributed-Memory Machines
, 1995
"... this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy ..."
Abstract
-
Cited by 166 (8 self)
- Add to MetaCart
this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy
Succinct Dynamic Data Structures
"... We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a sequence of elements which supports insertion, deletion and access of an element at any given index. For the parti ..."
Abstract
-
Cited by 35 (5 self)
- Add to MetaCart
We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a sequence of elements which supports insertion, deletion and access of an element at any given index
Dynamic Data Structures
"... "All the kids who did great in high school writing pong games in BASIC for their Apple II would get to college, take CompSci 101, a data structures course, and when they hit the pointers business their brains would just totally explode, and the next thing you knew, they were majoring in Politic ..."
Abstract
- Add to MetaCart
"All the kids who did great in high school writing pong games in BASIC for their Apple II would get to college, take CompSci 101, a data structures course, and when they hit the pointers business their brains would just totally explode, and the next thing you knew, they were majoring
Dynamic Data Structure Updates in Java
"... There exist a number of techniques for modifying a running system's code without halting normal operation of the program. Most of the research in the area of dynamic software updating focuses primarily on updating the flow and control of the program, in order to modify runtime functionality of ..."
Abstract
- Add to MetaCart
of pre-existing code or to insert new functionality altogether. We believe that software updates are limited in their effectiveness if they do not deal at all with the updating of data structures. Our goal is to show that research into dynamic data structure updates has many positive implications
Handling Dynamic Data Structures in Search Based Testing
- Department of Computer Science, University of York
, 2008
"... There has been little attention to search based test data gen-eration in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have excelled. This paper introduces a search based testing ap-proach which is able to handle pointers and dynamic data struct ..."
Abstract
-
Cited by 18 (9 self)
- Add to MetaCart
There has been little attention to search based test data gen-eration in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have excelled. This paper introduces a search based testing ap-proach which is able to handle pointers and dynamic data
Supporting speculative parallelization in the presence of dynamic data structures
- In PLDI ’10
"... The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative state from non-speculative state forms the basis of such speculative techniques as this separation enables recovery from mi ..."
Abstract
-
Cited by 18 (3 self)
- Add to MetaCart
observe that in context of heap-intensive programs that operate on linked dynamic data structures, state separation based speculative parallelization poses many challenges. The copying of data structures from non-speculative to speculative state (copy-in operation) can be very expensive due to the large
Results 1 - 10
of
274,108
