Sciweavers

38 search results - page 6 / 8
» jal 2006
Sort
View
JAL
2002
99views more  JAL 2002»
13 years 7 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
JAL
1998
74views more  JAL 1998»
13 years 7 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
JAL
2002
69views more  JAL 2002»
13 years 7 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
2006
89views more  JAL 2006»
13 years 7 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler
JAL
2006
86views more  JAL 2006»
13 years 7 months ago
An algorithmic sign-reversing involution for special rim-hook tableaux
Egecioglu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K-1 in terms of special rim-hook tableaux. They were able to use this interpretation to...
Bruce E. Sagan, Jaejin Lee