502 search results - page 1 / 101 » Verifying Balanced Trees |
92
Voted
LFCS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
112
Voted
ICNP
2006
IEEE
15 years 4 months ago
2006
IEEE
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
88
Voted
ACTA
2010
14 years 10 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
109
Voted
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...