740 search results - page 126 / 148 » Lower bounds for Buchsbaum* complexes |
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
163
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
251
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
140
click to vote
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is th...
156
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...