163 search results - page 13 / 33 » Composition Theorems in Communication Complexity |
ICICS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multimedia community is moving from monolithic applications to more flexible and scalable integrated solutions. Stream authentication is more complex since a stream may ...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
ENTCS
2007
14 years 9 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
PERCOM
2003
ACM
15 years 2 months ago
2003
ACM
The paper describes research that has been carried out in “extrovert-Gadgets”, a research project funded in the context of EU IST/FET proactive initiative “Disappearing Comp...
ICSOC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Composite web services can be orchestrated in a decentralized manner by breaking down the original service specification into a set of partitions and executing them on a...