Sciweavers

927 search results - page 9 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
SIGCSE
1998
ACM
102views Education» more  SIGCSE 1998»
13 years 11 months ago
Design patterns for data structures
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
Dung Nguyen
AMW
2010
13 years 8 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos
DAGSTUHL
1998
13 years 8 months ago
Segmented Iterators and Hierarchical Algorithms
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
Matthew H. Austern
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano