Table of Contents

• Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update TimeFranziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese. [doi]
• Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk)Huijia (Rachel) Lin. [doi]
• Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower QuotasMeghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar. [doi]
• History Determinism vs. Good for Gameness in Quantitative AutomataUdi Boker, Karoliina Lehtinen. [doi]
• An ETH-Tight Algorithm for Multi-Team FormationDaniel Lokshtanov, Saket Saurabh 0001, Subhash Suri, Jie Xue. [doi]
• Approximate Bisimulation MinimisationStefan Kiefer, Qiyi Tang 0001. [doi]
• Near-Optimal Cayley Expanders for Abelian GroupsAkhil Jalan, Dana Moshkovitz. [doi]
• Linear-Time Temporal Logic with Team Semantics: Expressivity and ComplexityJonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang 0004. [doi]
• Fast and Exact Convex Hull SimplificationGeorgiy Klimenko, Benjamin Raichel. [doi]
• Confluence of Conditional Rewriting in Logic FormRaúl Gutiérrez, Salvador Lucas, Miguel Vítores. [doi]
• The Complexity of Gradient Descent (Invited Talk)Rahul Savani. [doi]
• Local First-Order Logic with Two Data ValuesBenedikt Bollig, Arnaud Sangnier, Olivier Stietel. [doi]
• From Local to Global Determinacy in Concurrent Graph GamesBenjamin Bordais, Patricia Bouyer, Stéphane Le Roux 0001. [doi]
• Separating Regular Languages over Infinite Words with Respect to the Wagner HierarchyChristopher Hugenroth. [doi]
• Normal Sequences with Non-Maximal Automatic ComplexityLiam Jordon, Philippe Moser. [doi]
• A Faster Algorithm for Finding Closest Pairs in Hamming MetricAndre Esser, Robert Kübler, Floyd Zweydinger. [doi]
• One-Way Functions and a Conditional Variant of MKTPEric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich. [doi]
• Approximating the Number of Prime Factors Given an Oracle to Euler's Totient FunctionYang Du, Ilya Volkovich. [doi]
• On Fair and Efficient Allocations of Indivisible Public GoodsJugal Garg, Pooja Kulkarni, Aniket Murhekar. [doi]
• Approximation Algorithms for Flexible Graph ConnectivitySylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur. [doi]
• Functional Lower Bounds for Restricted Arithmetic Circuits of Depth FourSuryajith Chillara. [doi]
• Synthesizing Computable Functions from Rational Specifications over Infinite WordsEmmanuel Filiot, Sarah Winter. [doi]
• BQP After 28 Years (Invited Talk)Scott Aaronson. [doi]
• On (Simple) Decision Tree RankYogesh Dahiya, Meena Mahajan. [doi]
• On the Expressive Equivalence of TPTL in the Pointwise and Continuous SemanticsRaveendra Holla, Nabarun Deka, Deepak D'Souza. [doi]
• Matchings, Critical Nodes, and Popular SolutionsTelikepalli Kavitha. [doi]
• Approximating the Center Ranking Under UlamDiptarka Chakraborty, Kshitij Gajjar, Agastya Vibhuti Jha. [doi]
• Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting SystemsKentaro Kikuchi, Takahito Aoto 0001. [doi]
• Time Space Optimal Algorithm for Computing Separators in Bounded Genus GraphsChetan Gupta 0002, Rahul Jain 0015, Raghunath Tewari. [doi]
• Reachability and Matching in Single Crossing Minor Free GraphsSamir Datta, Chetan Gupta 0002, Rahul Jain 0015, Anish Mukherjee 0001, Vimal Raj Sharma, Raghunath Tewari. [doi]
• Branching Automata and Pomset AutomataNicolas Bedon. [doi]
• Towards Stronger Counterexamples to the Log-Approximate-Rank ConjectureArkadev Chattopadhyay, Ankit Garg, Suhail Sherif. [doi]
• Generalizations of Length Limited Huffman Coding for Hierarchical Memory SettingsShashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen. [doi]
• Harmonic Algorithms for Packing d-Dimensional Cuboids into BinsEklavya Sharma. [doi]
• Quantitative Verification on Product Graphs of Small TreewidthKrishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis. [doi]
• On Classical Decidable Logics Extended with Percentage Quantifiers and ArithmeticsBartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan. [doi]
• Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common SubsequenceXin Li 0006, Yu Zheng. [doi]
• Tight Chang's-Lemma-Type Bounds for Boolean FunctionsSourav Chakraborty 0001, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal. [doi]
• Property B: Two-Coloring Non-Uniform HypergraphsJaikumar Radhakrishnan, Aravind Srinivasan. [doi]
• Diagrammatic Polyhedral AlgebraFilippo Bonchi, Alessandro Di Giorgio 0002, Pawel Sobocinski 0001. [doi]
• Approximate Trace Reconstruction via Median String (In Average-Case)Diptarka Chakraborty, Debarati Das 0001, Robert Krauthgamer. [doi]
• Scheduling in the Secretary ModelSusanne Albers, Maximilian Janke. [doi]
• On the Complexity of Intersection Non-emptiness for Star-Free Language ClassesEmmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002. [doi]
• Resilience of Timed SystemsS. Akshay 0001, Blaise Genest, Loïc Hélouët, Shankara Narayanan Krishna, Sparsa Roychowdhury. [doi]
• State Complexity of Population Protocols (Invited Talk)Javier Esparza. [doi]
• ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial SpaceFedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Concrete Categorical Model of a Quantum Circuit Description Language with MeasurementDongho Lee, Valentin Perrelle, Benoît Valiron, Zhaowei Xu. [doi]
• Complexity of Coverability in Bounded Path Broadcast NetworksA. R. Balasubramanian. [doi]
• Approximately Counting Graph Homomorphisms and Retractions (Invited Talk)Leslie Ann Goldberg. [doi]
• Largest Similar Copies of Convex Polygons in Polygonal DomainsTaekang Eom, Seungjun Lee, Hee-Kap Ahn. [doi]
• Dominating Set in Weakly Closed Graphs is Fixed Parameter TractableDaniel Lokshtanov, Vaishali Surianarayanan. [doi]
• Parikh Images of Register AutomataSlawomir Lasota 0001, Mohnish Pattathurajan. [doi]