5608 search results - page 850 / 1122 » On the Theory of Matchgate Computations |
311
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
186
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
179
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
191
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
202
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...