#### Filter Results:

#### Publication Year

2002

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Nadine Guillotin-Plantard, Arnaud Le Ny
- 2006

We study the asymptotic behavior of the simple random walk on oriented versions of Z 2. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose distributions are generated by a dynamical system. We find a sufficient condition on the smoothness of the generation for the transience… (More)

We consider a stochastic version of the k-server problem in which k servers move on a circle to satisfy stochastically generated requests. The requests are independent and identically distributed according to an arbitrary distribution on a circle, which is either discrete or continuous. The cost of serving a request is the distance that a server needs to… (More)

We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered dynamic random walks. The basic operations (insertion, deletion, positive and negative queries, batched insertion, lazy deletion, etc.) are time-dependent random variables. This model is a (small) step toward the analysis of these structures when the… (More)

- ‹
- 1
- ›