5153 search results - page 753 / 1031 » Introduction to Randomized Algorithms |
161
click to vote
DIALM
2003
ACM
15 years 9 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
137
click to vote
ADAEUROPE
2003
Springer
15 years 9 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
121
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
136
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
139
click to vote
ALENEX
2010
15 years 5 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...