Sciweavers

29908 search results - page 153 / 5982
» On the complexity of communication complexity
Sort
View
ECCC
2007
86views more  ECCC 2007»
15 years 6 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
IATA
1998
Springer
15 years 10 months ago
A Dynamic Hierarchy of Intelligent Agents for Network Management
Routing as well as the management of communicationnetworks that support hybrid types of communications requiring quality of service is a very hard problem. We present here a frame...
Christian Frei, Boi Faltings
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 6 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
ISCA
2007
IEEE
110views Hardware» more  ISCA 2007»
16 years 22 days ago
A novel dimensionally-decomposed router for on-chip communication in 3D architectures
Much like multi-storey buildings in densely packed metropolises, three-dimensional (3D) chip structures are envisioned as a viable solution to skyrocketing transistor densities an...
Jongman Kim, Chrysostomos Nicopoulos, Dongkook Par...