Sciweavers

11784 search results - page 95 / 2357
» Interpolation for data structures
Sort
View
ESORICS
2009
Springer
15 years 12 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
15 years 5 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 4 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
ICALP
2003
Springer
15 years 4 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
SIGCSE
1999
ACM
91views Education» more  SIGCSE 1999»
15 years 3 months ago
Using randomization in the teaching of data structures and algorithms
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily
Michael T. Goodrich, Roberto Tamassia