163 search results - page 9 / 33 » Composition Theorems in Communication Complexity |
113
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
91
Voted
IC
2004
14 years 11 months ago
2004
In the next generation Internet, the network should not only be considered as a communication medium but also as a large source of services which use entails performance, reliabil...
82
Voted
MIPS
2004
Springer
15 years 3 months ago
2004
Springer
We present the development and experimentation of a distributed system for pervasive video communication on gigabit networks. We have implemented an event-based control mechanism f...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
114
click to vote
PLDI
2012
ACM
13 years 3 days ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...