LIPIcs, Volume 229, ICALP 2022

• Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff LIPIcs, Volume 229, ICALP 2022, Complete Volume 10.4230/LIPIcs.ICALP.2022
• Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ICALP.2022.0
• Albert Atserias Towards a Theory of Algorithmic Proof Complexity (Invited Talk) 10.4230/LIPIcs.ICALP.2022.1
• Constantinos Daskalakis Equilibrium Computation, Deep Learning, and Multi-Agent Reinforcement Learning (Invited Talk) 10.4230/LIPIcs.ICALP.2022.2
• Leslie Ann Goldberg Some New (And Old) Results on Contention Resolution (Invited Talk) 10.4230/LIPIcs.ICALP.2022.3
• Yin Tat Lee and Santosh S. Vempala The Manifold Joys of Sampling (Invited Talk) 10.4230/LIPIcs.ICALP.2022.4
• Madhu Sudan Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk) 10.4230/LIPIcs.ICALP.2022.5
• Stéphan Thomassé A Brief Tour in Twin-Width (Invited Talk) 10.4230/LIPIcs.ICALP.2022.6
• Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, and Pasin Manurangsi Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems 10.4230/LIPIcs.ICALP.2022.7
• Shweta Agrawal, Damien Stehlé, and Anshu Yadav Round-Optimal Lattice-Based Threshold Signatures, Revisited 10.4230/LIPIcs.ICALP.2022.8
• Josh Alman and Dean Hirsch Parameterized Sensitivity Oracles and Dynamic Algorithms Using Exterior Algebras 10.4230/LIPIcs.ICALP.2022.9
• Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro Low-Degree Polynomials Extract From Local Sources 10.4230/LIPIcs.ICALP.2022.10
• Sepehr Assadi, Aaron Bernstein, and Aditi Dudeja Decremental Matching in General Graphs 10.4230/LIPIcs.ICALP.2022.11
• Nikhil ^* Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas Near-Optimal Algorithms for Stochastic Online Bin Packing 10.4230/LIPIcs.ICALP.2022.12
• Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou Competitive Vertex Recoloring 10.4230/LIPIcs.ICALP.2022.13
• Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha Smoothed Analysis of the Komlós Conjecture 10.4230/LIPIcs.ICALP.2022.14
• Surender Baswana, Koustav Bhanja, and Abhyuday Pandey Minimum+1 (s,t)-cuts and Dual Edge Sensitivity Oracle 10.4230/LIPIcs.ICALP.2022.15
• Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k 10.4230/LIPIcs.ICALP.2022.16
• Omri Ben-Eliezer, Shoham Letzter, and Erik Waingarten Finding Monotone Patterns in Sublinear Time, Adaptively 10.4230/LIPIcs.ICALP.2022.17
• Pierre Bergé, Édouard Bonnet, and Hugues Déprés Deciding Twin-Width at Most 4 Is NP-Complete 10.4230/LIPIcs.ICALP.2022.18
• Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, and Nicole Wein Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost 10.4230/LIPIcs.ICALP.2022.19
• Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary 10.4230/LIPIcs.ICALP.2022.20
• Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, and Daniel Štefankovič Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs 10.4230/LIPIcs.ICALP.2022.21
• Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, and Martin Schirneck Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 10.4230/LIPIcs.ICALP.2022.22
• Mitchell Black and Amir Nayyeri Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes 10.4230/LIPIcs.ICALP.2022.23
• Guy Blanc, Jane Lange, and Li-Yang Tan Reconstructing Decision Trees 10.4230/LIPIcs.ICALP.2022.24
• Joakim Blikstad Sublinear-Round Parallel Matroid Intersection 10.4230/LIPIcs.ICALP.2022.25
• Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee Privately Estimating Graph Parameters in Sublinear Time 10.4230/LIPIcs.ICALP.2022.26
• Niclas Boehmer and Tomohiro Koana The Complexity of Finding Fair Many-To-One Matchings 10.4230/LIPIcs.ICALP.2022.27
• Zvika Brakerski, Nico Döttling, Sanjam Garg, and Giulio Malavolta Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices 10.4230/LIPIcs.ICALP.2022.28
• Marcin Briański, Martin Koutecký, Daniel Král', Kristýna Pekárková, and Felix Schröder Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming 10.4230/LIPIcs.ICALP.2022.29
• Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann A Structural Investigation of the Approximability of Polynomial-Time Problems 10.4230/LIPIcs.ICALP.2022.30
• Karl Bringmann and Alejandro Cassis Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution 10.4230/LIPIcs.ICALP.2022.31
• Karl Bringmann, Alejandro Cassis, Nick Fischer, and Vasileios Nakos Improved Sublinear-Time Edit Distance for Preprocessed Strings 10.4230/LIPIcs.ICALP.2022.32
• Caroline Brosse, Vincent Limouzy, and Arnaud Mary Polynomial Delay Algorithm for Minimal Chordal Completions 10.4230/LIPIcs.ICALP.2022.33
• David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie Unique Assembly Verification in Two-Handed Self-Assembly 10.4230/LIPIcs.ICALP.2022.34
• Diptarka Chakraborty, Kushagra Chatterjee, and Keerti Choudhary Pairwise Reachability Oracles and Preservers Under Failures 10.4230/LIPIcs.ICALP.2022.35
• Sourav Chakraborty, Chandrima Kayal, and Manaswi Paraashar Separations Between Combinatorial Measures for Transitive Functions 10.4230/LIPIcs.ICALP.2022.36
• Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, and Sorrachai Yingchareonthawornchai Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver 10.4230/LIPIcs.ICALP.2022.37
• Moses Charikar and Erik Waingarten Polylogarithmic Sketches for Clustering 10.4230/LIPIcs.ICALP.2022.38
• Lin Chen, Xiaoyu Wu, and Guochuan Zhang Approximation Algorithms for Interdiction Problem with Packing Constraints 10.4230/LIPIcs.ICALP.2022.39
• Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh Online Weighted Cardinality Joint Replenishment Problem with Delay 10.4230/LIPIcs.ICALP.2022.40
• Chi-Ning Chou, Peter J. Love, Juspreet Singh Sandhu, and Jonathan Shi Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond 10.4230/LIPIcs.ICALP.2022.41
• Aleksander B. G. Christiansen and Eva Rotenberg Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring 10.4230/LIPIcs.ICALP.2022.42
• Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, and Amnon Ta-Shma Expander Random Walks: The General Case and Limitations 10.4230/LIPIcs.ICALP.2022.43
• Gil Cohen and Tal Yankovitz LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation 10.4230/LIPIcs.ICALP.2022.44
• Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Štefankovič, and Eric Vigoda Metastability of the Potts Ferromagnet on Random Regular Graphs 10.4230/LIPIcs.ICALP.2022.45
• Jacobus Conradi and Anne Driemel On Computing the k-Shortcut Fréchet Distance 10.4230/LIPIcs.ICALP.2022.46
• Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý Streaming Algorithms for Geometric Steiner Forest 10.4230/LIPIcs.ICALP.2022.47
• Varsha Dani, Josep Díaz, Thomas P. Hayes, and Cristopher Moore Improved Reconstruction of Random Geometric Graphs 10.4230/LIPIcs.ICALP.2022.48
• Debarati Das, Tomasz Kociumaka, and Barna Saha Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding 10.4230/LIPIcs.ICALP.2022.49
• Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, and Ziqian Zhong New Additive Approximations for Shortest Paths and Cycles 10.4230/LIPIcs.ICALP.2022.50
• Amit Deshpande and Rameshwar Pratap One-Pass Additive-Error Subset Selection for 𝓁_p Subspace Approximation 10.4230/LIPIcs.ICALP.2022.51
• Shyam S. Dhamapurkar, Shubham Vivek Pawar, and Jaikumar Radhakrishnan Set Membership with Two Classical and Quantum Bit Probes 10.4230/LIPIcs.ICALP.2022.52
• Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, and Peng Zhang Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets 10.4230/LIPIcs.ICALP.2022.53
• Ming Ding, Rasmus Kyng, and Peng Zhang Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions 10.4230/LIPIcs.ICALP.2022.54
• Dean Doron and Mary Wootters High-Probability List-Recovery, and Applications to Heavy Hitters 10.4230/LIPIcs.ICALP.2022.55
• Talya Eden, Dana Ron, and Will Rosenbaum Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs 10.4230/LIPIcs.ICALP.2022.56
• Charilaos Efthymiou On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs 10.4230/LIPIcs.ICALP.2022.57
• Louis Esperet and Sergey Norin Testability and Local Certification of Monotone Properties in Minor-Closed Classes 10.4230/LIPIcs.ICALP.2022.58
• Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen Streaming Submodular Maximization Under Matroid Constraints 10.4230/LIPIcs.ICALP.2022.59
• Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Meirav Zehavi (Re)packing Equal Disks into Rectangle 10.4230/LIPIcs.ICALP.2022.60
• Sebastian Forster and Tijn de Vos Faster Cut Sparsification of Weighted Graphs 10.4230/LIPIcs.ICALP.2022.61
• Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, and Anna Melnichenko Social Distancing Network Creation 10.4230/LIPIcs.ICALP.2022.62
• Andreas Galanis, Daniel Štefankovič, and Eric Vigoda Approximating Observables Is as Hard as Counting 10.4230/LIPIcs.ICALP.2022.63
• Luyining Gan and Jie Han The Decision Problem for Perfect Matchings in Dense Hypergraphs 10.4230/LIPIcs.ICALP.2022.64
• Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan Fully Functional Parameterized Suffix Trees in Compact Space 10.4230/LIPIcs.ICALP.2022.65
• Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, and Kirill Simonov The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width 10.4230/LIPIcs.ICALP.2022.66
• Paweł Gawrychowski and Karol Pokorski Sublinear Dynamic Interval Scheduling (On One or Multiple Machines) 10.4230/LIPIcs.ICALP.2022.67
• Elahe Ghasemi, Vincent Jugé, and Ghazal Khalighinejad Galloping in Fast-Growth Natural Merge Sorts 10.4230/LIPIcs.ICALP.2022.68
• Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, and Sayantan Sen Tolerant Bipartiteness Testing in Dense Graphs 10.4230/LIPIcs.ICALP.2022.69
• Martin Grohe, Gaurav Rattan, and Tim Seppelt Homomorphism Tensors and Linear Equations 10.4230/LIPIcs.ICALP.2022.70
• Nathaniel Harms and Yuichi Yoshida Downsampling for Testing and Learning in Product Distributions 10.4230/LIPIcs.ICALP.2022.71
• Ishay Haviv A Fixed-Parameter Algorithm for the Kneser Problem 10.4230/LIPIcs.ICALP.2022.72
• Justin Holmgren, Andrea Lincoln, and Ron D. Rothblum Delegation for Search Problems 10.4230/LIPIcs.ICALP.2022.73
• Jakob Bæk Tejs Houen and Mikkel Thorup Understanding the Moments of Tabulation Hashing via Chaoses 10.4230/LIPIcs.ICALP.2022.74
• Ziyun Huang and Jinhui Xu In-Range Farthest Point Queries and Related Problem in High Dimensions 10.4230/LIPIcs.ICALP.2022.75
• Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre Strong Approximations and Irrationality in Financial Networks with Derivatives 10.4230/LIPIcs.ICALP.2022.76
• Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching 10.4230/LIPIcs.ICALP.2022.77
• Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas A PTAS for Packing Hypercubes into a Knapsack 10.4230/LIPIcs.ICALP.2022.78
• Shunhua Jiang, Bento Natura, and Omri Weinstein A Faster Interior-Point Method for Sum-Of-Squares Optimization 10.4230/LIPIcs.ICALP.2022.79
• Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, and Andreas Wiese Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing 10.4230/LIPIcs.ICALP.2022.80
• Sandra Kiefer and Daniel Neuen A Study of Weisfeiler-Leman Colorings on Planar Graphs 10.4230/LIPIcs.ICALP.2022.81
• Shimon Kogan and Merav Parter Beating Matrix Multiplication for n^{1/3}-Directed Shortcuts 10.4230/LIPIcs.ICALP.2022.82
• Balagopal Komarath, Anurag Pandey, and Chengot Sankaramenon Rahul Monotone Arithmetic Complexity of Graph Homomorphism Polynomials 10.4230/LIPIcs.ICALP.2022.83
• Akash Kumar, Anand Louis, and Rameesh Paul Exact Recovery Algorithm for Planted Bipartite Graph in Semi-Random Graphs 10.4230/LIPIcs.ICALP.2022.84
• William Kuszmaul and Shyam Narayanan Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game 10.4230/LIPIcs.ICALP.2022.85
• Jakub Łącki and Yasamin Nazari Near-Optimal Decremental Hopsets with Applications 10.4230/LIPIcs.ICALP.2022.86
• Alexandra Lassota, Aleksander Łukasiewicz, and Adam Polak Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs 10.4230/LIPIcs.ICALP.2022.87
• Clément Legrand-Duchesne, Ashutosh Rai, and Martin Tancer Parameterized Complexity of Untangling Knots 10.4230/LIPIcs.ICALP.2022.88
• Chao Liao, Qingyun Chen, Bundit Laekhanukit, and Yuhao Zhang Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity 10.4230/LIPIcs.ICALP.2022.89
• Bingkai Lin, Xuandi Ren, Yican Sun, and Xiuhan Wang On Lower Bounds of Approximating Parameterized k-Clique 10.4230/LIPIcs.ICALP.2022.90
• Daniel Lokshtanov, Fahad Panolan, and M. S. Ramanujan Backdoor Sets on Nowhere Dense SAT 10.4230/LIPIcs.ICALP.2022.91
• Zhenjian Lu, Igor C. Oliveira, and Marius Zimand Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity 10.4230/LIPIcs.ICALP.2022.92
• Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, and Marek Sokołowski Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument 10.4230/LIPIcs.ICALP.2022.93
• Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds 10.4230/LIPIcs.ICALP.2022.94
• Claire Mathieu and Hang Zhou A PTAS for Capacitated Vehicle Routing on Trees 10.4230/LIPIcs.ICALP.2022.95
• Andrew McGregor and Rik Sengupta Graph Reconstruction from Random Subgraphs 10.4230/LIPIcs.ICALP.2022.96
• Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, and Xinyu Wu The SDP Value of Random 2CSPs 10.4230/LIPIcs.ICALP.2022.97
• Ilan Newman and Nithin Varma Strongly Sublinear Algorithms for Testing Pattern Freeness 10.4230/LIPIcs.ICALP.2022.98
• Takaaki Nishimoto, Shunsuke Kanda, and Yasuo Tabei An Optimal-Time RLBWT Construction in BWT-Runs Bounded Space 10.4230/LIPIcs.ICALP.2022.99
• Theodoros Papamakarios and Alexander Razborov Space Characterizations of Complexity Measures and Size-Space Trade-Offs in Propositional Proof Systems 10.4230/LIPIcs.ICALP.2022.100
• Ján Pich and Rahul Santhanam Learning Algorithms Versus Automatability of Frege Systems 10.4230/LIPIcs.ICALP.2022.101
• Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Toruńczyk, and Alexandre Vigny Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures 10.4230/LIPIcs.ICALP.2022.102
• Guoliang Qiu, Yanheng Wang, and Chihao Zhang A Perfect Sampler for Hypergraph Independent Sets 10.4230/LIPIcs.ICALP.2022.103
• Nicolas Resch and Chen Yuan Threshold Rates of Code Ensembles: Linear Is Best 10.4230/LIPIcs.ICALP.2022.104
• Ittai Rubinstein Explicit and Efficient Construction of Nearly Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat Channel 10.4230/LIPIcs.ICALP.2022.105
• Aviad Rubinstein and Junyao Zhao Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation 10.4230/LIPIcs.ICALP.2022.106
• Jakub Tětek Approximate Triangle Counting via Sampling and Fast Matrix Multiplication 10.4230/LIPIcs.ICALP.2022.107
• Penghui Yao, Yitong Yin, and Xinyuan Zhang Polynomial-Time Approximation of Zero-Free Partition Functions 10.4230/LIPIcs.ICALP.2022.108
• Tianyi Zhang Faster Cut-Equivalent Trees in Simple Graphs 10.4230/LIPIcs.ICALP.2022.109
• Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz, and Mateusz Skomra Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games 10.4230/LIPIcs.ICALP.2022.110
• Djamel Eddine Amir and Mathieu Hoyrup Computability of Finite Simplicial Complexes 10.4230/LIPIcs.ICALP.2022.111
• David Barozzini, Paweł Parys, and Jan Wróblewski Unboundedness for Recursion Schemes: A Simpler Type System 10.4230/LIPIcs.ICALP.2022.112
• Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger Parameterized Safety Verification of Round-Based Shared-Memory Systems 10.4230/LIPIcs.ICALP.2022.113
• León Bohn and Christof Löding Passive Learning of Deterministic Büchi Automata by Combinations of DFAs 10.4230/LIPIcs.ICALP.2022.114
• Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, and Jean-François Raskin Strategy Synthesis for Global Window PCTL 10.4230/LIPIcs.ICALP.2022.115
• Léonard Brice, Jean-François Raskin, and Marie van den Bogaard The Complexity of SPEs in Mean-Payoff Games 10.4230/LIPIcs.ICALP.2022.116
• Antonio Casares, Thomas Colcombet, and Karoliina Lehtinen On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games 10.4230/LIPIcs.ICALP.2022.117
• Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, and Raghunath Tewari Dynamic Meta-Theorems for Distance and Matching 10.4230/LIPIcs.ICALP.2022.118
• Niel de Beaudrap, Aleks Kissinger, and John van de Wetering Circuit Extraction for ZX-Diagrams Can Be #P-Hard 10.4230/LIPIcs.ICALP.2022.119
• Gaëtan Douéneau-Tabot Hiding Pebbles When the Output Alphabet Is Unary 10.4230/LIPIcs.ICALP.2022.120
• Amina Doumane Regular Expressions for Tree-Width 2 Graphs 10.4230/LIPIcs.ICALP.2022.121
• Léo Exibard, Emmanuel Filiot, and Ayrat Khalimov A Generic Solution to Register-Bounded Synthesis with an Application to Discrete Orders 10.4230/LIPIcs.ICALP.2022.122
• Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk Twin-Width and Types 10.4230/LIPIcs.ICALP.2022.123
• Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, and Georg Zetzsche Reachability in Bidirected Pushdown VASS 10.4230/LIPIcs.ICALP.2022.124
• Hugo Gimbert, Corto Mascle, Anca Muscholl, and Igor Walukiewicz Distributed Controller Synthesis for Deadlock Avoidance 10.4230/LIPIcs.ICALP.2022.125
• Mika Göös, Stefan Kiefer, and Weiqiang Yuan Lower Bounds for Unambiguous Automata via Communication Complexity 10.4230/LIPIcs.ICALP.2022.126
• Paweł M. Idziak, Piotr Kawałek, Jacek Krzaczkowski, and Armin Weiß Satisfiability Problems for Finite Groups 10.4230/LIPIcs.ICALP.2022.127
• Tamio-Vesa Nakajima and Stanislav Živný Linearly Ordered Colourings of Hypergraphs 10.4230/LIPIcs.ICALP.2022.128
• Jakob Piribauer, Ocan Sankur, and Christel Baier The Variance-Penalized Stochastic Shortest Path Problem 10.4230/LIPIcs.ICALP.2022.129
• Enguerrand Prebet Functions and References in the Pi-Calculus: Full Abstraction and Proof Techniques 10.4230/LIPIcs.ICALP.2022.130
• Ville Salo and Ilkka Törmä What Can Oracles Teach Us About the Ultimate Fate of Life? 10.4230/LIPIcs.ICALP.2022.131
• Todd Schmid, Wojciech Różowski, Jurriaan Rot, and Alexandra Silva Processes Parametrised by an Algebraic Theory 10.4230/LIPIcs.ICALP.2022.132
• D. M. Stull The Dimension Spectrum Conjecture for Planar Lines 10.4230/LIPIcs.ICALP.2022.133