JAL
2002
13 years 11 months ago
2002
JAL
2002
13 years 11 months ago
2002
JAL
2002
13 years 11 months ago
2002
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...
JAL
2002
13 years 11 months ago
2002
JAL
2002
13 years 11 months ago
2002
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 ...
JAL
2002
13 years 11 months ago
2002
JAL
2002
13 years 11 months ago
2002
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...
JAL
2002
13 years 11 months ago
2002
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...
JAL
2002
13 years 11 months ago
2002
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean
JAL
2002
13 years 11 months ago
2002
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...