Search Problems in Trees with Symmetries: Near Optimal Traversal Strategies for Individualization-Refinement Algorithms Markus Anders, Pascal Schweitzer.
An Almost Optimal Edit Distance Oracle Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann.Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime Zachary Friggstad, Chaitanya Swamy.Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs Ewan Davies, Will Perkins.
#CLEMENS SUBSHIFT UNIVERSAL HOW TO#
How to Send a Real Number Using a Single Bit (And Some Shared Randomness) Ran Ben-Basat, Michael Mitzenmacher, Shay Vargaftik.Decision Problems for Second-Order Holonomic Recurrences Eike Neumann, Joël Ouaknine, James Worrell 0001.
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs Lijie Chen 0001, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Optimal Fine-Grained Hardness of Approximation of Linear Equations Mitali Bafna, Nikhil Vyas 0001. Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh. Approximation Algorithms for Min-Distance Problems in DAGs Mina Dalirrooyfard, Jenny Kaufmann. Linear Time Runs Over General Ordered Alphabets Jonas Ellert, Johannes Fischer 0001. Quantum Query Complexity with Matrix-Vector Products Andrew M. The Submodular Santa Claus Problem in the Restricted Assignment Case Étienne Bamas, Paritosh Garg, Lars Rohwedder. Fast n-Fold Boolean Convolution via Additive Combinatorics Karl Bringmann, Vasileios Nakos. Gregor Lagodzinski, Andreas Göbel 0001, Katrin Casel, Tobias Friedrich 0001. On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order J. On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Sayan Bandyapadhyay, Fedor V. Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth Dániel Marx, Govind S. Haystack Hunting Hints and Locker Room Communication Artur Czumaj, George Kontogeorgiou, Mike Paterson. A Subexponential Algorithm for ARRIVAL Bernd Gärtner, Sebastian Haslebacher, Hung P. Improved Approximation for Longest Common Subsequence over Small Alphabets Shyan Akmal, Virginia Vassilevska Williams. Deterministic Maximum Flows in Simple Graphs Tianyi Zhang. Crossing-Optimal Extension of Simple Drawings Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber. Coboundary and Cosystolic Expansion from Strong Symmetry Tali Kaufman, Izhar Oppenheim. An Efficient Coding Theorem via Probabilistic Representations and Its Applications Zhenjian Lu, Igor Carboni Oliveira. Direct Sum and Partitionability Testing over General Groups Andrej Bogdanov, Gautam Prakriya. Sparsification of Directed Graphs via Cut Balance Ruoxu Cen, Yu Cheng, Debmalya Panigrahi, Kevin Sun 0001. Local Approximations of the Independent Set Polynomial Dimitris Achlioptas, Kostas Zampetakis. Chan, Virginia Vassilevska Williams, Yinzhan Xu. Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths Timothy M. Deterministic Rounding of Dynamic Fractional Matchings Sayan Bhattacharya, Peter Kiss. The Theory of Concatenation over Finite Models Dominik D. The Greedy Algorithm Is not Optimal for On-Line Edge Coloring Amin Saberi, David Wajc. Kernelization, Proof Complexity and Social Choice Gabriel Istrate, Cosmin Bonchis, Adrian Craciun. Distributed Subgraph Finding: Progress and Challenges (Invited Talk) Keren Censor Hillel. An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D Pankaj K. Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang. Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms Ojas Parekh, Kevin Thompson 0007. Property Testing of Regular Languages with Applications to Streaming Property Testing of Visibly Pushdown Languages Gabriel Bathie, Tatiana Starikovskaya. LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching Arnab Ganguly 0002, Dhrumil Patel, Rahul Shah, Sharma V.
0 kommentar(er)
