Sciweavers

193 search results - page 24 / 39
» Exponential lower bounds for the numbers of Skolem-type sequ...
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
TCS
2008
13 years 7 months ago
Motif patterns in 2D
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
Alberto Apostolico, Laxmi Parida, Simona E. Rombo
COCOON
2009
Springer
14 years 2 months ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...
COLT
2004
Springer
13 years 11 months ago
Minimizing Regret with Label Efficient Prediction
We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after gues...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
FOCS
2009
IEEE
14 years 2 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson