Sciweavers

JAL
2002
50views more  JAL 2002»
13 years 4 months ago
General Partitioning on Random Graphs
C. R. Subramanian, C. E. Veni Madhavan
JAL
2002
86views more  JAL 2002»
13 years 4 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
JAL
2002
59views more  JAL 2002»
13 years 4 months ago
On Graph Powers for Leaf-Labeled Trees
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
JAL
2002
69views more  JAL 2002»
13 years 4 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
JAL
2002
58views more  JAL 2002»
13 years 4 months ago
Oblivious Gossiping on Tori
Ulrich Meyer, Jop F. Sibeyn
JAL
2002
71views more  JAL 2002»
13 years 4 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
JAL
2002
113views more  JAL 2002»
13 years 4 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
JAL
2002
64views more  JAL 2002»
13 years 4 months ago
Quicksort asymptotics
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean
James Allen Fill, Svante Janson
JAL
2002
99views more  JAL 2002»
13 years 4 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch