Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshops see [Zbl 1393.68012].
Indexed articles:
Fernández V., Manuel; Woodruff, David P.; Yasuda, Taisuke, The query complexity of Mastermind with \(\ell_p\) distances, Article 1, 11 p. [Zbl 1534.91040]
Chou, Chi-Ning; Lei, Zhixian; Nakkiran, Preetum, Tracking the \(\ell_2\) norm with constant update time, Article 2, 15 p. [Zbl 07650069]
Moseley, Benjamin; Sviridenko, Maxim, Submodular optimization with contention resolution extensions, Article 3, 17 p. [Zbl 07650070]
Hershkowitz, David Ellis; Ravi, R.; Singla, Sahil, Prepare for the expected worst: algorithms for reconfigurable resources under uncertainty, Article 4, 19 p. [Zbl 07650071]
Guruswami, Venkatesan; Tao, Runzhou, Streaming hardness of unique games, Article 5, 12 p. [Zbl 07650072]
Filtser, Arnold, On strong diameter padded decompositions, Article 6, 21 p. [Zbl 07650073]
Eden, Alon; Feige, Uriel; Feldman, Michal, Max-min greedy matching, Article 7, 23 p. [Zbl 07650074]
Miller, Gary L.; Walkington, Noel J.; Wang, Alex L., Hardy-Muckenhoupt bounds for Laplacian eigenvalues, Article 8, 19 p. [Zbl 07650075]
Harsha, Prahladh; Khot, Subhash; Lee, Euiwoong; Thiruvenkatachari, Devanathan, Improved 3LIN hardness via linear label cover, Article 9, 16 p. [Zbl 07650076]
Cohen, Ilan Reuven; Eden, Alon; Fiat, Amos; Jeż, Łukasz, Dynamic pricing of servers on trees, Article 10, 22 p. [Zbl 07650077]
Chlamtáč, Eden; Dinitz, Michael; Robinson, Thomas, Approximating the norms of graph spanners, Article 11, 22 p. [Zbl 07650078]
Rohatgi, Dhruv, Conditional hardness of earth mover distance, Article 12, 17 p. [Zbl 07650079]
Hulett, Reyna, Single-elimination brackets fail to approximate copeland winner, Article 13, 20 p. [Zbl 07650080]
Carpenter, Timothy; Salmasi, Ario; Sidiropoulos, Anastasios, Routing symmetric demands in directed minor-free graphs with constant congestion, Article 14, 15 p. [Zbl 07650081]
Guruswami, Venkatesan; Sandeep, Sai, Rainbow coloring hardness via low sensitivity polymorphisms, Article 15, 17 p. [Zbl 07650082]
Allender, Eric; Farach-Colton, Martín; Tsai, Meng-Tsung, Syntactic separation of subset satisfiability problems, Article 16, 23 p. [Zbl 07650083]
Fotakis, Dimitris; Matuschke, Jannik; Papadigenopoulos, Orestis, Malleable scheduling beyond identical machines, Article 17, 14 p. [Zbl 07650084]
Bercea, Ioana O.; Groß, Martin; Khuller, Samir; Kumar, Aounon; Rösner, Clemens; Schmidt, Daniel R.; Schmidt, Melanie, On the cost of essentially fair clusterings, Article 18, 22 p. [Zbl 07650085]
Kumar, Neeraj; Sintos, Stavros; Suri, Subhash, The maximum exposure problem, Article 19, 20 p. [Zbl 07650086]
Kale, Sagar, Small space stream summary for matroid center, Article 20, 22 p. [Zbl 07650087]
Birx, Alexander; Disser, Yann; Schewior, Kevin, Improved bounds for open online dial-a-ride on the line, Article 21, 22 p. [Zbl 07650088]
Albers, Susanne; Khan, Arindam; Ladewig, Leon, Improved online algorithms for knapsack and GAP in the random order model, Article 22, 23 p. [Zbl 1516.68122]
Quanrud, Kent, Fast and deterministic approximations for \(k\)-cut, Article 23, 20 p. [Zbl 07650090]
Austrin, Per; Stankovic, Aleksa, Global cardinality constraints make approximating some max-2-CSPs harder, Article 24, 17 p. [Zbl 07650091]
Schulz, Andreas S.; Udwani, Rajan, Robust appointment scheduling with heterogeneous costs, Article 25, 17 p. [Zbl 07650092]
Golovnev, Alexander; Kulikov, Alexander S.; Logunov, Alexander; Mihajlin, Ivan; Nikolaev, Maksim, Collapsing superstring conjecture, Article 26, 23 p. [Zbl 07650093]
Braverman, Vladimir; Lang, Harry; Ullah, Enayat; Zhou, Samson, Improved algorithms for time decay streams, Article 27, 17 p. [Zbl 07650094]
Ghoshal, Suprovat; Louis, Anand; Raychaudhury, Rahul, Approximation algorithms for partially colorable graphs, Article 28, 20 p. [Zbl 07650095]
Jayaram, Rajesh; Woodruff, David P., Towards optimal moment estimation in streaming and distributed models, Article 29, 21 p. [Zbl 07650096]
Bhaskar, Umang; Kumar, Gunjan, The complexity of partial function extension for coverage functions, Article 30, 21 p. [Zbl 07650097]
Gharibian, Sevag; Parekh, Ojas, Almost optimal classical approximation algorithms for a quantum generalization of max-cut, Article 31, 17 p. [Zbl 07650098]
Huang, Chien-Chung; Mari, Mathieu; Mathieu, Claire; Mitchell, Joseph S. B.; Mustafa, Nabil H., Maximizing covered area in the Euclidean plane with connectivity constraint, Article 32, 21 p. [Zbl 07650099]
Devvrit; Krishnaswamy, Ravishankar; Rajaraman, Nived, Robust correlation clustering, Article 33, 18 p. [Zbl 07650100]
Liao, Chao; Lin, Jiabao; Lu, Pinyan; Mao, Zhenyu, Counting independent sets and colorings on random regular bipartite graphs, Article 34, 12 p. [Zbl 07650101]
Diaz, Josep; Golin, Mordecai, The expected number of maximal points of the convolution of two 2-D distributions, Article 35, 14 p. [Zbl 07650102]
Anastos, Michael; Frieze, Alan, On a connectivity threshold for colorings of random graphs and hypergraphs, Article 36, 10 p. [Zbl 1512.05355]
Fahrbach, Matthew; Randall, Dana, Slow mixing of Glauber dynamics for the six-vertex model in the ordered phases, Article 37, 20 p. [Zbl 1512.82010]
Li, Ray; Wootters, Mary, Lifted multiplicity codes and the disjoint repair group property, Article 38, 18 p. [Zbl 1516.94064]
Schoenebeck, Grant; Tao, Biaoshuai; Yu, Fang-Yi, Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization, Article 39, 20 p. [Zbl 07650106]
Dinur, Irit; Golubev, Konstantin, Direct sum testing: the general case, Article 40, 11 p. [Zbl 07650107]
Chen, Zongchen; Galanis, Andreas; Goldberg, Leslie Ann; Perkins, Will; Stewart, James; Vigoda, Eric, Fast algorithms at low temperatures via Markov chains, Article 41, 14 p. [Zbl 07650108]
Murtagh, Jack; Reingold, Omer; Sidford, Aaron; Vadhan, Salil, Deterministic approximation of random walks in small space, Article 42, 22 p. [Zbl 1528.68314]
Ben-Aroya, Avraham; Cohen, Gil; Doron, Dean; Ta-Shma, Amnon, Two-source condensers with low error and small entropy gap via entropy-resilient functions, Article 43, 20 p. [Zbl 07650110]
Ban, Frank; Chen, Xi; Servedio, Rocco A.; Sinha, Sandip, Efficient average-case population recovery in the presence of insertions and deletions, Article 44, 18 p. [Zbl 07650111]
Servedio, Rocco A.; Tan, Li-Yang, Improved pseudorandom generators from pseudorandom multi-switching lemmas, Article 45, 23 p. [Zbl 07650112]
Spang, Bruce; Wootters, Mary, Unconstraining graph-constrained group testing, Article 46, 20 p. [Zbl 07650113]
Emiris, Ioannis Z.; Margonis, Vasilis; Psarros, Ioannis, Near-neighbor preserving dimension reduction for doubling subsets of \(\ell_1\), Article 47, 13 p. [Zbl 07650114]
Efthymiou, Charilaos; Galanis, Andreas; Hayes, Thomas P.; Štefankovič, Daniel; Vigoda, Eric, Improved strong spatial mixing for colorings on trees, Article 48, 16 p. [Zbl 07650115]
Bradac, Domagoj; Singla, Sahil; Zuzic, Goran, (Near) optimal adaptivity gaps for stochastic multi-value probing, Article 49, 21 p. [Zbl 07650116]
Gotlib, Roy; Kaufman, Tali, Testing odd direct sums using high dimensional expanders, Article 50, 20 p. [Zbl 1522.68741]
Göös, Mika; Watson, Thomas, A lower bound for sampling disjoint sets, Article 51, 13 p. [Zbl 07650118]
Rubinfeld, Ronitt; Vasilyan, Arsen, Approximating the noise sensitivity of a monotone Boolean function, Article 52, 17 p. [Zbl 07650119]
Galhotra, Sainyam; Mazumdar, Arya; Pal, Soumyabrata; Saha, Barna, Connectivity of random annulus graphs and the geometric block model, Article 53, 23 p. [Zbl 07650120]
Cannon, Sarah; Daymude, Joshua J.; Gökmen, Cem; Randall, Dana; Richa, Andréa W., A local stochastic algorithm for separation in heterogeneous self-organizing particle systems, Article 54, 22 p. [Zbl 07650121]
Bun, Mark; Thaler, Justin, The large-error approximate degree of \(\mathrm{AC}^0\), Article 55, 16 p. [Zbl 1528.68136]
Golovnev, Alexander; Göös, Mika; Reichman, Daniel; Shinkar, Igor, String matching: communication, circuits, and learning, Article 56, 20 p. [Zbl 07650123]
Arvind, V.; Chatterjee, Abhranil; Datta, Rajit; Mukhopadhyay, Partha, Efficient black-box identity testing for free group algebras, Article 57, 16 p. [Zbl 07650124]
Knierim, Charlotte; Lengler, Johannes; Pfister, Pascal; Schaller, Ulysse; Steger, Angelika, The maximum label propagation algorithm on sparse random graphs, Article 58, 15 p. [Zbl 07650125]
Agrawal, Rohit, Samplers and extractors for unbounded functions, Article 59, 21 p. [Zbl 07650126]
Janson, Svante; Sorkin, Gregory B., Successive minimum spanning trees, Article 60, 16 p. [Zbl 07650127]
Jagadeesan, Meena, Simple analysis of sparse, sign-consistent JL, Article 61, 20 p. [Zbl 07650128]
Braverman, Vladimir; Feldman, Dan; Lang, Harry; Rus, Daniela, Streaming coreset constructions for \(M\)-estimators, Article 62, 15 p. [Zbl 07650129]
Narayanan, Shyam, Pairwise independent random walks can be slightly unbounded, Article 63, 19 p. [Zbl 07650130]
Chen, Zongchen; Vempala, Santosh S., Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions, Article 64, 12 p. [Zbl 07650131]
Beimel, Amos; Nissim, Kobbi; Zaheri, Mohammad, Exploring differential obliviousness, Article 65, 20 p. [Zbl 07650132]
Anastos, Michael; Michaeli, Peleg; Petti, Samantha, Thresholds in random motif graphs, Article 66, 19 p. [Zbl 07650133]
Blanca, Antonio; Gheissari, Reza; Vigoda, Eric, Random-cluster dynamics in \(\mathbb{Z}^2\): Rapid mixing with general boundary conditions, Article 67, 19 p. [Zbl 07650134]
Kopparty, Swastik; Resch, Nicolas; Ron-Zewi, Noga; Saraf, Shubhangi; Silas, Shashwat, On list recovery of high-rate tensor codes, Article 68, 22 p. [Zbl 07650135]
Yaroslavtsev, Grigory; Zhou, Samson, Approximate \(\mathbb{F}_2\)-sketching of valuation functions, Article 69, 21 p. [Zbl 07650136]
Chakrabarti, Amit; Ghosh, Prantar, Streaming verification of graph computations via graph structure, Article 70, 20 p. [Zbl 07650137]
Bogdanov, Andrej; Mande, Nikhil S.; Thaler, Justin; Williamson, Christopher, Approximate degree, secret sharing, and concentration phenomena, Article 71, 21 p. [Zbl 07650138]
Li, Fu; Zuckerman, David, Improved extractors for recognizable and algebraic sources, Article 72, 22 p. [Zbl 07650139]