On the core of the multicommodity flow game

We present a deterministic $O(\log n \log \log n)$ space algorithm for undirected st-connectivity. It is based on a space-efficient simulation of the deterministic EREW algorithm of Chong and Lam [J. Algorithms, 18 (1995), pp. 378-402], an approach suggested by Prof. Vijaya Ramachandran, and uses the universal exploration sequences for trees constructed by Koucký in [Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001, pp. 21-27]. Our result improves the $O(\log^{4/3} n)$ bound of Armoni et al. in [Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1997, pp. 230-239] and is a big step towards the optimal $O(\log n)$. Independently of our result and using a different set of techniques, the optimal bound was achieved by Reingold in [Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 376-385].

The distributed $(\Delta + 1)$-coloring problem is one of the most fundamental and well-studied problems in distributed algorithms. Starting with the work of Cole and Vishkin in 1986, a long line of gradually improving algorithms has been published. The state-of-the-art running time, prior to our work, is $O(\Delta \log \Delta + \log^* n)$, due to Kuhn and Wattenhofer [Proceedings of the $25$th Annual ACM Symposium on Principles of Distributed Computing, Denver, CO, 2006, pp. 7--15]. Linial [Proceedings of the $28$th Annual IEEE Symposium on Foundation of Computer Science, Los Angeles, CA, 1987, pp. 331--335] proved a lower bound of $\frac{1}{2} \log^* n$ for the problem, and Szegedy and Vishwanathan [Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 201--207] provided a heuristic argument that shows that algorithms from a wide family of locally iterative algorithms are unlikely to achieve a running time smaller than $\Theta(\Delta \log \Delta)$. We present a deterministic $(\Delta + 1)$-coloring distributed algorithm with running time $O(\Delta) + \frac{1}{2} \log^* n$. We also present a trade-off between the running time and the number of colors, and devise an $O(\lambda\cdot\Delta)$-coloring algorithm, with running time $O(\Delta / \lambda + \log^* n)$, for any parameter $\lambda > 1$. Our algorithm breaks the heuristic barrier of Szegedy and Vishwanathan and achieves running time which is linear in the maximum degree $\Delta$. On the other hand, the conjecture of Szegedy and Vishwanathan may still be true, as our algorithm does not belong to the family of locally iterative algorithms. On the way to this result we study a generalization of the notion of graph coloring, which is called defective coloring [L. Cowen, R. Cowen, and D. Woodall, J. Graph Theory, 10 (1986), pp. 187--195]. In an $m$-defective $p$-coloring the vertices are colored with $p$ colors so that each vertex has up to $m$ neighbors with the same color. We show that an $m$-defective $p$-coloring with reasonably small $m$ and $p$ can be computed very efficiently in the distributed setting. We also develop a technique to employ multiple defective colorings of various subgraphs of the original graph $G$ for computing a $(\Delta+1)$-coloring of $G$. We believe that these techniques are of independent interest.

The papers in this volume were presented at the Thirty-Fourth Annual ACM Symposium on Theory of Computing (STOC2002), held in Montreal, Quebec, Canada, May 19-21, 2002. The Symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).In response to a call for papers, 287 paper submissions were received. All were submitted electronically. The program committee conducted its deliberations electronically, via an on-line meeting that ran from January 10 to January 19. The committee selected 91 papers from among the submissions. The submissions were not refereed, and many of these papers represented reports of continuing research. It is expected that most of them will appear in a more polished and complete form in scientific journals.The papers encompassed in wide variety of areas of theoretical computer science. The topics included algorithms and computational complexity bounds for classical problems in algebra, geometry, topology, graph theory, game theory, logic and machine learning, as well as theoretical aspects of security, databases, information retrieval, and networks, the web, computational biology, and alternative models of computation including quantum computation and self-assembly.

We study the problem of compressing interactive communication to its information content $I$, defined as the amount of information that the participants learn about each other's inputs. We focus on the canonical setting where the participants' inputs are distributed independently and show how to compress the communication to $O(I\log^{2}I)$ bits, with no dependence on the original communication cost. This result essentially matches the well-known lower bound of $\Omega(I)$ and improves quadratically on previous work [B. Barak, M. Braverman, X. Chen, and A. Rao, SIAM J. Comput., 42 (2013), pp. 1327--1363; M. Braverman, SIAM J. Comput., 44 (2015), pp. 1698--1739; G. Kol, Proceedings of the $48$th Annual ACM Symposium on Theory of Computing, 2016, pp. 987--998]. Our result complements the recent breakthrough of Ganor, Kol, and Raz [J. ACM, 63 (2016), 46] who show that one cannot achieve compression better than $2^{O(I)}$ in the general case when the participants' inputs are dependent random variables.

General Partitioning on Random Graphs

Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity Rossman (SIAM J. Comput. 43:256–279, 2014), DNF sparsification Gopalan et al. (Comput. Complex. 22:275–310 2013), randomness extractors Li et al. (In: APPROX-RANDOM, LIPIcs 116:51:1–13, 2018), and recent advances on the Erdős-Rado sunflower conjecture Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) Lovett et al. (From dnf compression to sunflower theorems via regularity, 2019) Rao (Discrete Anal. 8,2020). The recent breakthrough of Alweiss, Lovett, Wu and Zhang Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) gives an improved bound on the maximum size of a w-set system that excludes a robust sunflower. In this paper, we use this result to obtain an exp (n^{1/2-o(1)}) lower bound on the monotone circuit size of an explicit n-variate monotone function, improving the previous best known exp (n^{1/3-o(1)}) due to Andreev (Algebra and Logic, 26:1–18, 1987) and Harnik and Raz (In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM, New York, 2000). We also show an exp (varOmega (n)) lower bound on the monotone arithmetic circuit size of a related polynomial via a very simple proof. Finally, we introduce a notion of robust clique-sunflowers and use this to prove an n^{varOmega (k)} lower bound on the monotone circuit size of the CLIQUE function for all k leqslant n^{1/3-o(1)}, strengthening the bound of Alon and Boppana (Combinatorica, 7:1–22, 1987).

Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406–415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameterD, or is ϵ‐far from any graph with diameter at most β(D). The function β(D) ranges betweenD+4 and 4D+2, depending on the algorithm. All our algorithms run in time polynomial in 1/ϵ. © 2002 Wiley Periodicals, Inc. Random Struct. Alg. 20: 165–183, 2002

Nonlinear codes from points of bounded height

This issue of SICOMP contains six specially selected papers from STOC 2020, the Fifty-second Annual ACM Symposium on the Theory of Computing, which was held June 22--26, 2020, initially planned at Chicago, Illinois, but due to COVID-19 was an online conference in the end. The papers here were chosen to represent the range and quality of the STOC program. These papers have been revised and extended by their authors and subjected to the standard thorough reviewing process of SICOMP. The program committee for STOC 2020 consisted of an executive committee made up of Nima Anari, Boaz Barak, Sébastien Bubeck, Mark Bun, Arkadev Chattopadhyay, Chandra Chekuri, Julia Chuzhoy, Marek Cygan, Ilias Diakonikolas, Yevgeniy Dodis, Sebastian Forster, Ankit Garg, Nika Haghtalab, Prahladh Harsha, Justin Holmgren, Piotr Indyk, Rahul Jain, Sanjeev Khanna, Dakshita Khurana, Pravesh Kothari, Robert Krauthgamer, Marvin Künnemann, Tengyu Ma, Rafael Oliveira, Merav Parter, Sofya Raskhodnikova, Robert Robere, Dana Ron, Noga Ron-Zewi, Thatchaphol Saranurak, Balasubramanian Sivan, Christian Sohler, Madhur Tulsiani, Omri Weinstein, Christian Wulff-Nilsen, and Henry Yuen. The program chair was Julia Chuzhoy. Included in this issue are the following papers: ``Explicit Near-Ramanujan Graphs of Every Degree" by Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes shows a deterministic poly$(n)$-time algorithm that outputs a $d$-regular graph on $\Theta(n)$ vertices that is $\epsilon$-near-Ramanujan. ``Reducing Path TSP to TSP" by Vera Traub, Jens Vygen, and Rico Zenklusen presents a black-box reduction from the path version of the traveling salesman problem (Path TSP) to the classical tour version (TSP). ``Nearly Optimal Static Las Vegas Succinct Dictionary" by Huacheng Yu obtains a randomized dictionary data structure using ${OPT}+{poly}\lg n+O(\lg^{(\ell)} U)$ bits of space with expected constant query time for the static dictionary problem. ``Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions" by Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh Raj Saxena, and S. Matthew Weinberg provides the first separation in the approximation guarantee achievable by truthful and nontruthful combinatorial auctions with polynomial communication. ``Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization" by Lijie Chen and Hanlin Ren establish a connection between nondeterministic algorithms estimating the acceptance probability of a given circuit and average-case lower bounds for nondeterministic time classes. ``Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs" by Siddharth Bhandari and Sayantan Chakraborty presents a randomized algorithm that takes as input an undirected $n$-vertex graph $G$ with maximum degree $\Delta$ and an integer $k>3\Delta$ and returns a random proper $k$-coloring of $G$. We thank the authors, the STOC 2020 program committee, the STOC 2020 external reviewers, and the SICOMP referees for all of their hard work. Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen - Guest editors

Welcome to UIST 2012, the Twenty-Fifth Annual ACM Symposium on User Interface Software and Technology. UIST is the premier forum for the presentation of research innovations in the software and technology of human-computer interfaces. Sponsored by ACM's special interest groups on computer-human interaction (SIGCHI) and computer graphics (SIGGRAPH), UIST brings together researchers and practitioners from many areas, including web and graphical interfaces, new input and output devices, information visualization, interactive displays, tangible computing, and computer supported cooperative work. The single-track schedule, intimate size, and location in Cambridge, Massachusetts, a place rich in history of technical innovations, make UIST 2012 an ideal place to exchange results and to forge future collaborations. We received a record 288 paper submissions from more than 20 countries. After a thorough review process, the program committee accepted 62 papers (21.5%). Each anonymous submission was first reviewed by a primary program committee member and three external reviewers. If any of the four reviewers deemed a submission to pass a rejection threshold we asked the authors to submit a short rebuttal addressing the reviewers' concerns. The secondary committee member then wrote a fifth review of the paper taking into account the authors' rebuttal. The program committee met in person in Redmond, WA, on June 7--8, 2012, to select the papers for the conference. Submissions were finally accepted only after the authors provided a final revision addressing the committee's comments. In addition to the presentations of accepted papers, this year's program includes a keynote by Margaret Livingstone (Harvard Medical School neuroscientist) on how art affects the brain. Posters, demos, the ninth annual Doctoral Symposium, and the fourth annual Student Innovation Contest (this year focusing on a new touch-sensitive device from Synaptics called Jedeye) complete the program.

For general antiferromagnetic 2-spin systems, including the hardcore model on weighted independent sets and the antiferromagnetic Ising model, there is an for the partition function on graphs of maximum degree when the infinite regular tree lies in the uniqueness region by Li, Lu, and Yin [Correlation Decay up to Uniqueness in Spin Systems, preprint, https://arxiv.org/abs/1111.7064, 2021]. Moreover, in the tree nonuniqueness region, Sly in [Computational transition at the uniqueness threshold, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, 2010, pp. 287–296] showed that there is no to estimate the partition function unless . The algorithmic results follow from the correlation decay approach due to Weitz [Counting independent sets up to the tree threshold, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006, pp. 140–149] or the polynomial interpolation approach developed by Barvinok [Combinatorics and Complexity of Partition Functions, Springer, 2016]. However, the running time is only polynomial for constant . For the hardcore model, recent work of Anari, Liu, and Oveis Gharan [Spectral independence in high-dimensional expanders and applications to the hardcore model, in Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science, 2020, pp. 1319–1330] establishes rapid mixing of the simple single-site Markov chain, known as the Glauber dynamics, in the tree uniqueness region. Our work simplifies their analysis of the Glauber dynamics by considering the total pairwise influence of a fixed vertex on other vertices, as opposed to the total influence of other vertices on , thereby extending their work to all 2-spin models and improving the mixing time. More important, our proof ties together the three disparate algorithmic approaches: we show that contraction of the so-called tree recursions with a suitable potential function, which is the primary technique for establishing efficiency of Weitz’s correlation decay approach and Barvinok’s polynomial interpolation approach, also establishes rapid mixing of the Glauber dynamics. We emphasize that this connection holds for all 2-spin models (both antiferromagnetic and ferromagnetic), and existing proofs for the correlation decay and polynomial interpolation approaches immediately imply rapid mixing of the Glauber dynamics. Our proof utilizes the fact that the graph partition function is a divisor of the partition function for Weitz’s self-avoiding walk tree. This fact leads to new tools for the analysis of the influence of vertices and may be of independent interest for the study of complex zeros.

Scheduling multicasts on unit-capacity trees and meshes

The papers in this volume were presented at the 43rd ACM Symposium on Theory of Computing (STOC), held June 6-8, 2011 in San Jose, California, as part of the fifth Federated Computing Research Conference (FCRC). STOC is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The papers at STOC were selected by the program committee from among 304 submissions received by November 4, 2010 (5 of which were withdrawn by authors during the review process). The committee did its work by a combination of extensive electronic discussion and a physical meeting of the entire committee in San Francisco on January 26-27, 2011. These proceedings contain the 84 papers that were accepted to STOC, one of which is a merge of two related submissions. Three pairs of papers having similar results shared presentation slots at the conference, for a total of 81 talks. All submissions received careful consideration, but they were not refereed in a formal sense. Authors are encouraged to submit full versions of their papers to journals for a complete review and archival publication. The committee selected two papers for a Best Paper Award: "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs," by Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng, and "Subexponential Lower Bounds for Randomized Pivoting Rules for the Simplex Algorithm," by Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick. The committee selected "Analyzing Network Coding Gossip Made Easy" by Bernhard Haeupler for the Danny Lewin Best Student Paper Award. STOC was preceded by an FCRC plenary talk on June 5 given by Leslie Valiant as recipient of the 2011 ACM Turing Award for his transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing. At the conference, the 11th Knuth Prize was awarded to Ravi Kannan for his work on algorithmic techniques that have fundamentally contributed to computational complexity, discrete mathematics, geometry, and operations research. He presented the Knuth Prize Lecture as an FCRC plenary talk on the morning of June 7. The program committee also decided to add a Poster Session, held on the evening of June 6, to increase the opportunities for disseminating and discussing research at the conference. Posters were not refereed; any registered FCRC attendee could present a poster on research in any aspect of theoretical computer science.

We consider the coordination of planning decisions of a single product in a supply chain composed of one supplier and one retailer, by using contracts. We assume that the retailer has the market power: he can impose his optimal replenishment plan to the supplier. Our aim is to minimize the supplier’s cost without increasing the retailer’s cost. To this end, the supplier (or a trusted third party) proposes to the retailer a contract, which is made of a replenishment plan and a side payment. This side payment compensates the increase of cost of the retailer due to the fact that the proposed replenishment plan may have a cost larger than the retailer’s optimal replenishment plan. We evaluate how much the supplier can gain by using contracts under several scenarios which depend on the side payment coverage. From a theoretical point of view, in all the scenarios, contracts may decrease the cost of the supplier by an arbitrarily large factor. We perfom experiments which measures the gain that can be obtained in practice on various instances types. If side payments are allowed, experiments show that the use of contracts decreases significantly the cost of the supplier, and that side payments on the holding costs are sufficient. We show that if there is no side payment, or if there is no constraint on the side payment, then the problem can be solved in polynomial time. On the contrary, if the side payment is limited to the holding costs of the retailer, then the problem is NP-hard. We extend this study to the case where the information is asymmetric (the supplier—or the trusted third entity—does not know all the costs of the retailer): in this case, the situation is modelled by a screening game.