
...we study the 2party randomized communication complexity of readonce ac0 formulae. for balanced andor trees...steps: (1) reduction to measuring the information complexity of binary depthd trees, and (2) proving lower bounds on the information complexity of binary trees. in order to...

...we prove that readonce branching programs computing integer multiplication re quire size 2( p n). this is the first nontrivial lower bound for multiplication on branching programs that are not...

...of functions that arise from readonce boolean formulae. a readonce boolean formula is a formula in propositional logic with the property that every variable appears...the tree that represents it. the complexity of the evaluation of general readonce formulae, has attracted interest mainly in...

...and $\omega(n^{1/4})$ on the
randomized and quantum communication complexity, respectively, of all
$n$variable readonce boolean formulas. our results complement the recent
lower bound of $\omega...kopparty and raghavendra for
randomized communication complexity of readonce boolean formulas with depth
$d$. we obtain...

...known for a long time. on the other hand, the problem of proving superpolynomial lower bounds for parity readonce branching programs is still open...homeister, and waack (8). here, the rst strongly exponential lower bound for integer multiplication on the size of a parity nonoblivious readonce branching program model is proven...

...model for boolean functions. especially readonce branching programs (bp1s) have been studied intensively. exponential lower bounds on the bp1 complexity of explicit functions have been known for a long time. nevertheless, the proof of exponential lower bounds on the readonce branching program size of selected functions is sometimes difficult...
Published in 2001.

...that can be verified by reading only one of its bits, with the help of an interactiveproof with very small communication complexity. we show that for membership...to construct zeroknowledge proofs of communication complexity polynomial in the size of the witness, rather than polynomial in the size of the instance, for many np languages...

...and delete emails but, at the same time, should learn neither the content of messages sent from the senders to alice (with bob...regarding user's search (including the ac cess pattern) in the publickey setting and with nontrivially small communication complexity. the main technique of our solution also allows for...

...to design a protocol solving the consen sus problem for n processes despite the occurrence of up to f process crashes. for each value of f these conditions actually defines...condition that allows to solve the consensus problem. the second con tribution is an efficient protocol whose waitfree part has a number of shared memory accesses upper bounded...

...lower bounds in two concrete complexity models:(1) in the twoparty communication complexity model, we show that the tribes function on n inputs[6] has two...tree model, we show that the recursive majorityofthree function on 3h inputs has randomized complexity ω((7/3)h). the deterministic complexity of this function is θ(3h...