Results 1 
6 of
6
Skip Graphs
 Proc. of the 14th Annual ACMSIAM Symp. on Discrete Algorithms
, 2003
"... Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems, and by providin ..."
Abstract

Cited by 235 (9 self)
 Add to MetaCart
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peertopeer systems, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, constructing, inserting new nodes into, searching a skip graph, and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straightforward algorithms. 1
Combinatorics of geometrically distributed random variables: Lefttoright maxima
 Discrete Mathematics
, 1996
"... Abstract. For words of length n, generated by independent geometric random variables, we consider the mean and variance of the number of inversions and of a parameter of Knuth from permutation in situ. In this way, q–analogues for these parameters from the usual permutation model are obtained. 1. ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
Abstract. For words of length n, generated by independent geometric random variables, we consider the mean and variance of the number of inversions and of a parameter of Knuth from permutation in situ. In this way, q–analogues for these parameters from the usual permutation model are obtained. 1.
The Average Case Analysis of Algorithms: Mellin Transform Asymptotics
, 1996
"... This report is part of a series whose aim is to present in a synthetic way the major methods of "analytic combinatorics" needed in the averagecase analysis of algorithms. It reviews the use of MellinPerron formulae and of Mellin transforms in this context. Applications include: divideandconquer ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This report is part of a series whose aim is to present in a synthetic way the major methods of "analytic combinatorics" needed in the averagecase analysis of algorithms. It reviews the use of MellinPerron formulae and of Mellin transforms in this context. Applications include: divideandconquer recurrences, maxima finding, mergesort, digital trees and plane trees.
Combinatorics of Geometrically Distributed Random Variables: Value and Position of the rth LefttoRight Maximum
 Discrete Math
"... For words of length n, generated by independent geometric random variables, we consider the average value and the average position of the rth lefttoright maximum, for fixed r and n !1. 1. ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
For words of length n, generated by independent geometric random variables, we consider the average value and the average position of the rth lefttoright maximum, for fixed r and n !1. 1.
Normal Approximations of the Number of Records in Geometrically Distributed Random Variables
 Alg
, 1998
"... We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approximation theorems for the number of lower records are also derived. 1 ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approximation theorems for the number of lower records are also derived. 1