This paper settles the complexity of three sketching problems in graphs and distributions.

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

The authors map the problem of finding the maximum cut of a planar graph with arbitrary weights to a minimum T-join problem in the absolute dual graph, enabling the use of shortest paths and adapting…

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

This paper proves lower bounds for the size of multiplicative graph spanners in the $f$-degree fault tolerant model, matching previous conditional lower bounds and current upper bounds.

This paper studies the maximum size of an independent set in the discrete simplex graph and provides new bounds using translated smaller graphs and finite rational linear systems.

This paper provides a bound on the hat guessing number of a graph based on its order and maximum degree.

This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

This paper presents a local computation algorithm to approximate the top eigenvector of a symmetric matrix with entries between -1 and 1, building on Swartworth and Woodruff's work.

This paper provides bounds on the difference between the annihilation number and independence number of a finite simple graph, and proves these bounds for various types of graphs.

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

The paper systematically studies the trade-offs between the number of slopes, bends per edge, and required area for planar drawings of bounded-degree graphs, providing new constructions for high-degre…

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

This paper improves the known bounds on the ratio between domination number and packing number in unit disk graphs and bridgeless claw-free cubic graphs.

This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.