2095 search results - page 137 / 419 » Improved pebbling bounds |
175
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
176
click to vote
CISS
2008
IEEE
16 years 28 days ago
2008
IEEE
—We investigate the effects of user cooperation on the secrecy of multiple access channels with generalized feedback (MAC-GF). We show that cooperation can increase the achievabl...
152
click to vote
FOCS
2008
IEEE
16 years 28 days ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
170
click to vote
FOSSACS
2007
Springer
16 years 19 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
176
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...