Sciweavers

727 search results - page 140 / 146
» A Calculus of Bounded Capacities
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SOFSEM
2009
Springer
14 years 4 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
DFG
2009
Springer
14 years 2 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
IMC
2009
ACM
14 years 2 months ago
TCP revisited: a fresh look at TCP in the wild
Since the last in-depth studies of measured TCP traffic some 68 years ago, the Internet has experienced significant changes, including the rapid deployment of backbone links wit...
Feng Qian, Alexandre Gerber, Zhuoqing Morley Mao, ...