The authors prove optimal lower bounds for the communication complexity of graph connectivity.

The paper presents two results on the randomized communication complexity of composed functions, providing new composition lower bounds and strengthening previous results.

This paper constructs unambiguous DNFs with width O(n) and Ω(n^2) 0-certificate complexity, and proves a lifting theorem to communicate the separation in certificate complexity to communication comple…

This paper studies the computational complexity of Maximum Edge Open Packing Problem in distance-hereditary, biconvex bipartite, and chordal graphs, providing polynomial-time algorithms and a fixed-pa…

This paper characterizes the information complexity of distributed testing of Ber(α) versus Ber(β) in the broadcast model, identifies optimal protocols for different parameter regimes, and derives new…

This paper provides quantum lower and upper bounds for testing singularity of matrices and their bitwise XOR over the rationals.

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

The paper proves an information-theoretically optimal gap-majority lemma in the two-player randomized communication model, achieving the correct linear scaling and constant-constant tradeoff.

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

This paper introduces witness complexity, a measure for the minimum running time of a string's near-shortest description on a universal Turing machine.