Sciweavers

11211 search results - page 176 / 2243
» Data Structures
Sort
View
FOCS
2005
IEEE
16 years 1 days ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
FOCS
1992
IEEE
15 years 10 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 6 months ago
Biased Range Trees
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
Vida Dujmovic, John Howat, Pat Morin
MICRO
1994
IEEE
99views Hardware» more  MICRO 1994»
15 years 10 months ago
Data relocation and prefetching for programs with large data sets
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
Yoji Yamada, John Gyllenhall, Grant Haab, Wen-mei ...
IPPS
2000
IEEE
15 years 10 months ago
Template Based Structured Collections
Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we...
Jörg Nolte, Mitsuhisa Sato, Yutaka Ishikawa