2252 search results - page 79 / 451 » Lower Bounds for Dynamic Algorithms |
184
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
141
click to vote
EUROPAR
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
160
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
161
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
197
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...