RSA 2002 - PDF Preprint Papers

RSA 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed RSA-2002 Paper

click to vote

RSA
2002

161views more RSA 2002»

Asymptotic analysis of (3, 2, 1)-shell sort

13 years 11 months ago

Download www.stat.washington.edu

: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.

Robert T. Smythe, J. A. Wellner

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	161	Asymptotic analysis of (3, 2, 1)-shell sort	claim
2	99	Distributed algorithms with dynamical random transitions	claim
3	87	Inexpensive d-dimensional matchings	claim
4	81	Decycling numbers of random regular graphs	claim
5	75	On the expected value of the minimum assignment	claim
6	73	New and faster filters for multiple approximate string matching	claim
7	71	The infamous upper tail	claim
8	69	On the covariance of the level sizes in random recursive trees	claim
9	66	Minimum independent dominating sets of random cubic graphs	claim
10	61	The diameter of a long-range percolation graph	claim
11	56	Bond percolation critical probability bounds for three Archimedean lattices	claim
12	51	Testing subgraphs in large graphs	claim
13	49	An O(n2) bound for the relaxation time of a Markov chain on cladograms	claim
14	49	Crossing numbers of random graphs	claim
15	46	The Random-Facet simplex algorithm on combinatorial cubes	claim
16	43	On the discrepancy of combinatorial rectangles	claim
17	40	Phase transition for Parking blocks, Brownian excursion and coalescence	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers