Sciweavers

4612 search results - page 923 / 923
» More Communications
Sort
View
IANDC
2008
141views more  IANDC 2008»
14 years 12 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
14 years 11 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger