Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 62, Issue 1February 2015
Reflects downloads up to 10 Nov 2024Bibliometrics
Skip Table Of Content Section
SECTION: Approximation Algorithms
research-article
Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
Article No.: 1, Pages 1–19https://doi.org/10.1145/2629366

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 vV, and the task is to find a spanning tree of minimum cost that satisfies all the degree bounds. Let OPT be ...

SECTION: Computer-Aided Verification
research-article
Approximate Verification of the Symbolic Dynamics of Markov Chains
Article No.: 2, Pages 1–34https://doi.org/10.1145/2629417

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 ...

SECTION: Distributed Computing
research-article
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
Article No.: 3, Pages 1–22https://doi.org/10.1145/2732263

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 ...

SECTION: Randomized Algorithms and Probabilistic Analysis
research-article
Improved Smoothed Analysis of Multiobjective Optimization
Article No.: 4, Pages 1–58https://doi.org/10.1145/2699445

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 ...

SECTION: Security and Cryptography
research-article
Constant-Round Nonmalleable Commitments from Any One-Way Function
Article No.: 5, Pages 1–30https://doi.org/10.1145/2699446

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 ...

SECTION: Invited Articles Section
editorial
Free
Invited Articles Foreword
Article No.: 6, Page 1https://doi.org/10.1145/2734885
SECTION: Distributed Computing
research-article
On the Complexity of Universal Leader Election
Article No.: 7, Pages 1–27https://doi.org/10.1145/2699440

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 ...

SECTION: Economics and Computation
research-article
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1
Article No.: 8, Pages 1–39https://doi.org/10.1145/2629614

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 ...

SECTION: Formal Methods
interview
Measuring and Synthesizing Systems in Probabilistic Environments
Article No.: 9, Pages 1–34https://doi.org/10.1145/2699430

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. ...

Subjects

Comments