1066 search results - page 34 / 214 » Computing Private Set Operations with Linear Complexities |
144
click to vote
LICS
2009
IEEE
16 years 16 days ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
123
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
189
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
144
click to vote
SIGOPSE
2004
ACM
15 years 11 months ago
2004
ACM
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
144
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...