740 search results - page 116 / 148 » Lower bounds for Buchsbaum* complexes |
131
click to vote
ECCC
2007
15 years 6 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
159
click to vote
TCS
2008
15 years 6 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
144
click to vote
MFCS
2009
Springer
16 years 22 days ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
163
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
173
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...