163 search results - page 5 / 33 » Composition Theorems in Communication Complexity |
100
click to vote
EUROCRYPT
1999
Springer
15 years 4 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
79
Voted
JGAA
2002
15 years 6 days ago
2002
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
108
click to vote
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...
101
Voted
ITA
2007
15 years 13 days ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
90
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...