SIAMDM
2011
13 years 2 months ago
2011
SIAMDM
2011
13 years 2 months ago
2011
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, o...
SIAMDM
2011
13 years 2 months ago
2011
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
SIAMDM
2011
13 years 2 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
SIAMDM
2011
13 years 2 months ago
2011
Consider a closed curve in the plane that does not intersect itself; by the Jordan-Schoenflies Theorem, it bounds a distorted disk. Now consider a closed curve that intersects its...
SIAMCOMP
2011
13 years 2 months ago
2011
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
SIAMCOMP
2011
13 years 2 months ago
2011
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
SIAMCOMP
2011
13 years 2 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
SIAMCOMP
2011
13 years 2 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
SIAMCOMP
2011
13 years 2 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...