388 search results - page 65 / 78 » Quantum Lower Bounds by Polynomials |
116
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
121
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
107
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
112
click to vote
IMA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...