Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Journal of the ACMJust Accepted
acm
The below articles have been recently accepted to the journal and are currently in the production process. These Author’s Accepted Manuscripts (AAM) will be available for preview until the “Version of Record” is available and assigned to its proper issue. The AAM carries the article’s permanent DOI and can be cited immediately.
research-article
Free
July 2024
JUST ACCEPTED
How Much Data Is Sufficient to Learn High-Performing Algorithms?

Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit meaningful worst-case bounds, so the parameters are made available for the ...

research-article
Free
July 2024
JUST ACCEPTED
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing

Compressed sensing has been a very successful high-dimensional signal acquisition and recovery technique that relies on linear operations. However, the actual measurements of signals have to be quantized before storing or processing them. 1-bit (or one-...

research-article
Free
July 2024
JUST ACCEPTED
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time

We present dynamic algorithms with polylogarithmic update time for estimating the size of the maximum matching of a graph undergoing edge insertions and deletions with approximation ratio strictly better than 2. Specifically, we obtain a \(\(1+\frac{1}{\...\)

research-article
Free
July 2024
JUST ACCEPTED
Pure-Circuit: Tight Inapproximability for PPAD

The current state-of-the-art methods for showing inapproximability in PPAD arise from the ε-Generalized-Circuit (ε-GCircuit) problem. Rubinstein (2018) showed that there exists a small unknown constant ε for which ε-GCircuit is PPAD-hard, and subsequent ...

research-article
Free
July 2024
JUST ACCEPTED
A Logical Approach to Type Soundness

Type soundness, which asserts that “well-typed programs cannot go wrong”, is widely viewed as the canonical theorem one must prove to establish that a type system is doing its job. It is commonly proved using the so-called syntactic approach (aka progress ...

research-article
Free
July 2024
JUST ACCEPTED
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds

We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. ’99] also on proof size. [Alekhnovich and Razborov ’03] established that if the clause-...

research-article
Free
June 2024
JUST ACCEPTED
Query lower bounds for log-concave sampling

Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this work, we ...

research-article
Free
June 2024
JUST ACCEPTED
Transaction Fee Mechanism Design

Demand for blockchains such as Bitcoin and Ethereum is far larger than supply, necessitating a mechanism that selects a subset of transactions to include “on-chain” from the pool of all pending transactions. This paper investigates the problem of ...

research-article
Free
May 2024
JUST ACCEPTED
Sparse Higher Order Čech Filtrations

For a finite set of balls of radius r, the k-fold cover is the space covered by at least k balls. Fixing the ball centers and varying the radius, we obtain a nested sequence of spaces that is called the k-fold filtration of the centers. For k = 1, the ...

research-article
Free
May 2024
JUST ACCEPTED
Killing a Vortex

The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph H, every H-minor-free graph can be obtained by clique-sums of “almost embeddable” graphs. Here a graph is “almost embeddable” if it can be obtained from a graph of ...

research-article
Free
May 2024
JUST ACCEPTED
Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by Sherali–Adams (SA) proofs. We show, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the coefficients are ...

research-article
Free
April 2024
JUST ACCEPTED
The Bitcoin Backbone Protocol: Analysis and Applications

Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone, and prove three of its fundamental properties which we call Common ...