We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...