11211 search results - page 110 / 2243 » Rank-Sensitive Data Structures |
193
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
76
Voted
CAV
2007
Springer
15 years 7 months ago
2007
Springer
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
117
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
2010
IEEE-ACM
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
HIPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
105
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...