RSA 2006 - PDF Preprint Papers

RSA 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed RSA-2006 Paper

click to vote

RSA
2006

144views more RSA 2006»

Data structures with dynamical random transitions

13 years 4 months ago

Download www-math.univ-poitiers.fr

We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...

Clément Dombry, Nadine Guillotin-Plantard, ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	144	Data structures with dynamical random transitions	claim
2	132	Almost universal graphs	claim
3	115	The counting lemma for regular k-uniform hypergraphs	claim
4	113	Applications of the regularity lemma for uniform hypergraphs	claim
5	110	The degree sequences and spectra of scale-free random graphs	claim
6	104	The satisfiability threshold for randomly generated binary constraint satisfaction problems	claim
7	98	Levels of a scale-free tree	claim
8	96	Concentration inequalities for functions of independent variables	claim
9	92	Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs	claim
10	91	Average case analysis of the Boyer-Moore algorithm	claim
11	88	Randomly coloring sparse random graphs with fewer colors than the maximum degree	claim
12	87	Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph"	claim
13	81	On random points in the unit disk	claim
14	80	Regular subgraphs of random graphs	claim
15	78	Nodes of large degree in random trees and forests	claim
16	74	Robust locally testable codes and products of codes	claim
17	74	A randomized on-line algorithm for the k-server problem on a line	claim
18	71	Some conditional correlation inequalities for percolation and related processes	claim
19	70	Law of large numbers for increasing subsequences of random permutations	claim
20	69	On smoothed analysis in dense graphs and formulas	claim
21	68	The probabilistic analysis of a greedy satisfiability algorithm	claim
22	66	Regular graphs whose subgraphs tend to be acyclic	claim
23	63	Random cutting and records in deterministic and random trees	claim
24	62	Threshold values of random K-SAT from the cavity method	claim
25	51	Limit laws for embedded trees: Applications to the integrated superBrownian excursion	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers