Issue Downloads
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
In the Minimum Bounded Degree Spanning Tree problem, we are given an undirected graph G = (V, E) with a degree upper bound Bv on each vertex v ∈ V, and the task is to find a spanning tree of minimum cost that satisfies all the degree bounds. Let OPT be ...
Approximate Verification of the Symbolic Dynamics of Markov Chains
A finite-state Markov chain M can be regarded as a linear transform operating on the set of probability distributions over its node set. The iterative applications of M to an initial probability distribution μ0 will generate a trajectory of probability ...
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
This article presents a novel implementation of a snapshot object for n processes, with O(log2 b log n) step complexity for update operations and O(log b) step complexity for scan operations, where b is the number of updates. The algorithm uses only ...
Improved Smoothed Analysis of Multiobjective Optimization
We present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, this line of research has gained a lot of attention in the last decade. We ...
Constant-Round Nonmalleable Commitments from Any One-Way Function
We show unconditionally that the existence of commitment schemes implies the existence of constant-round nonmalleable commitments; earlier protocols required additional assumptions such as collision-resistant hash functions or subexponential one-way ...
On the Complexity of Universal Leader Election
Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in ...
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1
In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into ℓ1 with constant distortion. We show that for an arbitrarily small constant δ > 0, for all large enough n, there is an n-point negative ...
Measuring and Synthesizing Systems in Probabilistic Environments
The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. ...