Sciweavers

535 search results - page 56 / 107
» Insertion and Expansion Operations for
Sort
View
FOCS
2002
IEEE
15 years 4 months ago
Implicit B-Trees: New Results for the Dictionary Problem
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
Gianni Franceschini, Roberto Grossi, J. Ian Munro,...
IPPS
1994
IEEE
15 years 4 months ago
AVL Trees with Relaxed Balance
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
Kim S. Larsen
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
15 years 3 months ago
Incremental cryptography and application to virus protection
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
Mihir Bellare, Oded Goldreich, Shafi Goldwasser
VLDB
1995
ACM
150views Database» more  VLDB 1995»
15 years 3 months ago
Procedures in Object-Oriented Query Languages
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
Kazimierz Subieta, Yahiko Kambayashi, Jacek Leszcz...
USENIX
2001
15 years 1 months ago
User-Level Extensibility in the Mona File System
A conventional file system provides the user with generic structure and semantics for accessing files. The default scheme is sufficient for many applications. However, many applic...
Paul W. Schermerhorn, Robert J. Minerick, Peter W....