308 search results - page 13 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
114
click to vote
PODC
1993
ACM
15 years 1 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
DAGSTUHL
2006
14 years 11 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
102
click to vote
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
118
click to vote
SODA
2012
ACM
13 years 1 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...