2924 search results - page 501 / 585 » Lower Bounds in Distributed Computing |
133
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
122
click to vote
FSE
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
128
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
134
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...