502 search results - page 5 / 101 » Verifying Balanced Trees |
SEFM
2007
IEEE
14 years 2 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
NBIS
2007
Springer
14 years 2 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
DIM
2008
ACM
13 years 10 months ago
2008
ACM
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
ACMSE
2007
ACM
14 years 17 days ago
2007
ACM
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...