{"id":463,"date":"2021-04-28T09:25:39","date_gmt":"2021-04-28T09:25:39","guid":{"rendered":"http:\/\/easyconferences.eu\/icalp2021\/?page_id=463"},"modified":"2021-07-06T15:03:29","modified_gmt":"2021-07-06T15:03:29","slug":"accepted","status":"publish","type":"page","link":"https:\/\/easyconferences.eu\/icalp2021\/accepted\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”4.4.1″][et_pb_row _builder_version=”4.4.1″][et_pb_column type=”4_4″ _builder_version=”4.4.1″][et_pb_text _builder_version=”4.4.1″]<\/p>\n

Accepted papers<\/h2>\n

[\/et_pb_text][et_pb_divider divider_weight=”5px” _builder_version=”4.4.1″][\/et_pb_divider][\/et_pb_column][\/et_pb_row][et_pb_row _builder_version=”4.4.1″ custom_padding=”79px|||||”][et_pb_column type=”4_4″ _builder_version=”4.4.1″][et_pb_text _builder_version=”4.4.1″]<\/p>\n

Proceedings<\/h1>\n

\u00a0The ICALP 2021 Proceedings<\/a> have now been published in the LIPIcs series.\u00a0<\/p>\n

<\/h1>\n

Best paper awards<\/h1>\n

Track A<\/strong><\/p>\n

Sayan Bhattacharya and Peter Kiss. <\/span>Deterministic Rounding of Dynamic Frac<\/span>tional Matchings<\/span><\/strong><\/p>\n

Track B<\/strong><\/p>\n

\n
\n
\n
\n

Antoine Amarilli, Louis Jachiet and Charles Paperman. <\/span>Dynamic Membership for\u00a0Regular Languages<\/strong><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

 <\/p>\n

Best student paper awards (for papers written solely by students)<\/h1>\n

Track A<\/strong><\/p>\n

\n
\n
\n
\n

Or Zamir. <\/span>Breaking the 2n barrier for 5-coloring and 6<\/strong>-coloring<\/strong>
<\/span><\/p>\n

<\/strong><\/span><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

Track B<\/strong><\/p>\n

\n
\n
\n
\n

None<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n

 <\/p>\n

Track A<\/h1>\n

 <\/p>\n

    \n
  1. Tianyi Zhang. Deterministic Maximum Flows in Simple Graphs<\/strong><\/li>\n
  2. Markus Anders, Pascal Schweitzer and Florian Wetzels. Comparative Design-Choice Analysis of Color Refinement Algorithms Beyond the Worst Case<\/strong><\/li>\n
  3. Gianlorenzo D’Angelo<\/a>, Debashmita Poddar and Cosimo Vinci<\/a>. Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies<\/strong><\/li>\n
  4. Michael Lampis<\/a>. Minimum Stable Cut and Treewidth<\/strong><\/li>\n
  5. Anupam Gupta, Benjamin Moseley and Rudy Zhou. Structural Iterative Rounding for Generalized k-Median Problems<\/strong><\/li>\n
  6. Bernhard Haeupler<\/a>, David Hershkowitz<\/a> and David Wajc<\/a>. Near-Optimal Schedules for Simultaneous Multicasts<\/strong><\/li>\n
  7. \u00c9douard Bonnet<\/a>. 4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time $n^{4\/3}$<\/strong><\/li>\n
  8. Yong Gu and Hanlin Ren<\/a>. Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time<\/strong><\/li>\n
  9. Moritz Buchem, Lars Rohwedder<\/a>, Tjark Vredeveld and Andreas Wiese. Additive Approximation Schemes for Load Balancing Problems<\/strong><\/li>\n
  10. Mathieu Mari, Chien-Chung Huang, Claire Mathieu and Jens Vygen. Approximating maximum integral multiflows on bounded genus graphs<\/strong><\/li>\n
  11. Joran van Apeldoorn, Sander Gribling, Yinan Li, Harold Nieuwboer, Michael Walter and Ronald de Wolf. Quantum algorithms for matrix scaling and matrix balancing<\/strong><\/li>\n
  12. \u00c9douard Bonnet<\/a>, Colin Geniet, Eun Jung Kim<\/a>, St\u00e9phan Thomass\u00e9 and R\u00e9mi Watrigant. Twin-width III: Max Independent Set, Min Dominating Set, and Coloring<\/strong><\/li>\n
  13. Shyan Akmal and Virginia Williams<\/a>. Improved Approximation for Longest Common Subsequence over Small Alphabets<\/strong><\/li>\n
  14. Nick Gravin, Zhihao Gavin Tang and Kangning Wang<\/a>. Online Stochastic Matching with Edge Arrivals<\/strong><\/li>\n
  15. Izhar Oppenhein and Tali Kaufman. Coboundary and cosystolic expansion from strong symmetry<\/strong><\/li>\n
  16. Karl Bringmann and Vasileios Nakos. Fast n-fold Boolean Convolution via Additive Combinatorics<\/strong><\/li>\n
  17. Keren Censor-Hillel, Noa Marelly, Roy Schwartz and Tigran Tonoyan. Fault Tolerant Max-Cut<\/strong><\/li>\n
  18. S\u00e9bastien Bouchard, Yoann Dieudonn\u00e9, Arnaud Labourel<\/a> and Andrzej Pelc<\/a>. Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs<\/strong><\/li>\n
  19. Telikepalli Kavitha<\/a>. Maximum Matchings and Popularity<\/strong><\/li>\n
  20. Jan B\u00f6ker. Graph Similarity and Homomorphism Densities<\/strong><\/li>\n
  21. Enoch Peserico and Michele Scquizzato<\/a>. Matching on the line admits no $o(\\sqrt{\\log n})$-competitive algorithm<\/strong><\/li>\n
  22. Ewan Davies<\/a> and Will Perkins<\/a>. Approximately counting independent sets of a given size<\/strong><\/li>\n
  23. Andreas Bj\u00f6rklund and Petteri Kaski. Counting Short Vector Pairs by Inner Product and Relations to the Permanent<\/strong><\/li>\n
  24. Massimo Cairo, Romeo Rizzi<\/a>, Alexandru I. Tomescu<\/a> and Elia Carlo Zirondelli. Genome assembly, from practice to theory: safe, complete and linear-time<\/strong><\/li>\n
  25. Matthias Bentert, Andr\u00e9 Nichterlein, Malte Renken and Philipp Zschoche. Using A Geometric Lens to Find k Disjoint Shortest Paths<\/strong><\/li>\n
  26. Emanuele Viola. Fourier conjectures, correlation bounds, and Majority<\/strong><\/li>\n
  27. Markus Anders and Pascal Schweitzer. Search Problems in Trees with Symmetries: near optimal traversal strategies for individualization-refinement algorithms<\/strong><\/li>\n
  28. Ilan Newman and Nithin Varma. New Sublinear Algorithms and Lower Bounds for LIS Estimation<\/strong><\/li>\n
  29. Etienne Bamas, Paritosh Garg and Lars Rohwedder<\/a>. The Submodular Santa Claus Problem in the Restricted Assignment Case<\/strong><\/li>\n
  30. Maximilian Probst Gutenberg<\/a>, Viktor Fredslund-Hansen, Jacob Evald and Christian Wulff-Nilsen. Decremental APSP in Directed Graphs Versus an Adaptive Adversary<\/strong><\/li>\n
  31. Tuukka Korhonen<\/a>. Lower Bounds on Dynamic Programming for Maximum Weight Independent Set<\/strong><\/li>\n
  32. Karl Bringmann and Debarati Das. A Near-Linear-Time n^0.4-Approximation for Longest Common Subsequence<\/strong><\/li>\n
  33. Mina Dalirrooyfard and Jenny Kaufmann. Approximation Algorithms for Min-Distance Problems in DAGs<\/strong><\/li>\n
  34. Jakub Kozik<\/a>. Improving Gebauer\u2019s construction of 3-chromatic hypergraphs with few edges<\/strong><\/li>\n
  35. Lijie Chen<\/a>, Zhenjian Lu, Xin Lyu and Igor Oliveira<\/a>. Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1<\/strong><\/li>\n
  36. Zhenjian Lu and Igor Oliveira<\/a>. An Efficient Coding Theorem via Probabilistic Representations and its Applications<\/strong><\/li>\n
  37. Or Zamir<\/a>. Breaking the 2^n barrier for 5-coloring and 6-coloring<\/strong><\/li>\n
  38. Yonatan Nakar and Dana Ron. Testing Dynamic Environments: Back to Basics<\/strong><\/li>\n
  39. Andrew Childs<\/a>, Shih-Han Hung and Tongyang Li. Quantum query complexity with matrix-vector products<\/strong><\/li>\n
  40. Benjamin Moseley, Kirk Pruhs, Alireza Samadian and Yuyan Wang. Relational Algorithms for k-means Clustering<\/strong><\/li>\n
  41. Hyejung Hailey Jee, Carlo Sparaciari, Omar Fawzi and Mario Berta. Quasi-polynomial time algorithms for quantum games in bounded dimension<\/strong><\/li>\n
  42. Yuzhou Gu<\/a>, Adam Polak<\/a>, Virginia Vassilevska Williams<\/a> and Yinzhan Xu<\/a>. Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths<\/strong><\/li>\n
  43. Artur Czumaj<\/a>, George Kontogeorgiou and Mike Paterson<\/a>. Haystack Hunting Hints and Locker Room Communication<\/strong><\/li>\n
  44. Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri and Maryam Negahbani. Revisiting Priority k-Center: Fairness and Outliers<\/strong><\/li>\n
  45. Arun Ganesh<\/a>, Bruce Maggs<\/a> and Debmalya Panigrahi<\/a>. Universal Algorithms for Clustering Problems<\/strong><\/li>\n
  46. Timothy M. Chan<\/a>, Virginia Vassilevska Williams<\/a> and Yinzhan Xu<\/a>. Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths<\/strong><\/li>\n
  47. Andrei-Alexandru Graur and Noga Alon<\/a>. Efficient Splitting of Necklaces<\/strong><\/li>\n
  48. Bernd G\u00e4rtner, Sebastian Haslebacher and Hung P. Hoang. A subexponential algorithm for ARRIVAL<\/strong><\/li>\n
  49. Sayan Bandyapadhyay<\/a>, Fedor Fomin<\/a> and Kirill Simonov. On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications<\/strong><\/li>\n
  50. Ran Ben Basat, Michael Mitzenmacher and Shay Vargaftik. How to Send a Real Number Using a Single Bit (and Some Shared Randomness)<\/strong><\/li>\n
  51. Antonios Antoniadis<\/a>, Matthias Englert<\/a>, Nicolaos Matsakis and Pavel Vesel\u00fd<\/a>. Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop<\/strong><\/li>\n
  52. Andrej Bogdanov<\/a> and Gautam Prakriya. Direct Sum and Partitionability Testing over General Groups<\/strong><\/li>\n
  53. Jonas Ellert<\/a> and Johannes Fischer<\/a>. Linear Time Runs over General Ordered Alphabets<\/strong><\/li>\n
  54. Amir Abboud and Virginia Vassilevska Williams. Fine-Grained Hardness for Edit Distance to a Fixed Sequence<\/strong><\/li>\n
  55. Reut Levi. Testing Triangle Freeness in the General Model in Graphs with Arboricity $O(\\sqrt{n})$<\/strong><\/li>\n
  56. Theo McKenzie<\/a> and Sidhanth Mohanty<\/a>. High-girth near-Ramanujan graphs with lossy vertex expansion<\/strong><\/li>\n
  57. George Christodoulou<\/a>, Elias Koutsoupias<\/a> and Annamaria Kovacs<\/a>. Truthful allocation in graphs and hypergraphs<\/strong><\/li>\n
  58. Adam Polak<\/a>, Lars Rohwedder and Karol W\u0119grzycki. Knapsack and Subset Sum with Small Items<\/strong><\/li>\n
  59. Tobias Friedrich<\/a>, Andreas G\u00f6bel, Martin S. Krejca and Marcus Pappik. A spectral independence view on hard spheres via block dynamics<\/strong><\/li>\n
  60. Zachary Friggstad and Chaitanya Swamy<\/a>. Constant-Factor Approximation to Deadline TSP and Related Problems in (almost) Quasi-Polytime<\/strong><\/li>\n
  61. Michal Kouck\u00fd and Karel Kr\u00e1l. Sorting Short Integers<\/strong><\/li>\n
  62. Kevin Pratt and Cornelius Brand. Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials<\/strong><\/li>\n
  63. Joakim Blikstad. Breaking O(nr) for Matroid Intersection<\/strong><\/li>\n
  64. Marc Roth<\/a>, Johannes Schmitt<\/a> and Philip Wellnitz<\/a>. Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders<\/strong><\/li>\n
  65. Panagiotis Charalampopoulos<\/a>, Shay Mozes<\/a>, Pawel Gawrychowski<\/a> and Oren Weimann<\/a>. An Almost Optimal Edit Distance Oracle<\/strong><\/li>\n
  66. J. A. Gregor Lagodzinski<\/a>, Andreas G\u00f6bel, Katrin Casel and Tobias Friedrich<\/a>. On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order<\/strong><\/li>\n
  67. Pankaj K. Agarwal and Alex Steiger. An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D<\/strong><\/li>\n
  68. Uma Girish, Ran Raz<\/a> and Wei Zhan. Quantum Logspace Algorithm for Powering Matrices with Bounded Norm<\/strong><\/li>\n
  69. Chandra Chekuri and Kent Quanrud. Faster Algorithms for Rooted Connectivity in Directed Graphs<\/strong><\/li>\n
  70. Shyan Akmal and Ce Jin<\/a>. Faster Algorithms for Bounded Tree Edit Distance<\/strong><\/li>\n
  71. Seth Pettie<\/a> and Longhui Yin. The Structure of Minimum Vertex Cuts<\/strong><\/li>\n
  72. Deeksha Adil, Brian Bullins, Rasmus Kyng and Sushant Sachdeva. Almost-linear Time Weighted $\\ell_p$-norm Solvers in Slightly Dense Graphs via Sparsification<\/strong><\/li>\n
  73. Nicolas Rivera, Thomas Sauerwald and John Sylvester<\/a>. Multiple Random Walks on Graphs: Mixing Few to Cover Many<\/strong><\/li>\n
  74. Karl Bringmann and Jasper Slusallek. Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal<\/strong><\/li>\n
  75. Robert Ganian<\/a>, Thekla Hamm, Fabian Klute<\/a>, Irene Parada<\/a> and Birgit Vogtenhuber. Crossing-Optimal Extension of Simple Drawings<\/strong><\/li>\n
  76. D\u00e1niel Marx, Govind S. Sankar and Philipp Schepper. Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth<\/strong><\/li>\n
  77. Eike Neumann, Joel Ouaknine<\/a> and James Worrell<\/a>. Decision problems for second-order holonomic recurrences<\/strong><\/li>\n
  78. David P. Woodruff<\/a> and Samson Zhou<\/a>. Separations for Estimating Large Frequency Moments on Data Streams<\/strong><\/li>\n
  79. Marcin Bienkowski<\/a>, Artur Kraska and Hsiang-Hsuan Liu. Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times<\/strong><\/li>\n
  80. Adam Karczmarz. Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems<\/strong><\/li>\n
  81. Dimitris Achlioptas and Kostas Zampetakis. Local Approximations of the Independent Set Polynomial<\/strong><\/li>\n
  82. Pankaj Agarwal<\/a>, Xiao Hu<\/a>, Stavros Sintos<\/a> and Jun Yang<\/a>. Dynamic Enumeration of Similarity Joins<\/strong><\/li>\n
  83. Maria Hartmann<\/a>, L\u00e1szl\u00f3 Kozma<\/a>, Corwin Sinnamon and Robert Tarjan<\/a>. Analysis of Smooth Heaps<\/strong><\/li>\n
  84. Sayan Bhattacharya and Peter Kiss. Deterministic Rounding of Dynamic Fractional Matchings<\/strong><\/li>\n
  85. Yu Chen, Sanjeev Khanna and Ansh Nagda. Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries<\/strong><\/li>\n
  86. Joshua Brakensiek<\/a>, Venkatesan Guruswami<\/a> and Sai Sandeep<\/a>. Conditional Dichotomy of Boolean Ordered Promise CSPs<\/strong><\/li>\n
  87. Christian Coester and Elias Koutsoupias. Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle<\/strong><\/li>\n
  88. Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets and Antonina Kolokolova. Lifting for constant-depth circuits and applications to MCSP<\/strong><\/li>\n
  89. Ruoxu Cen, Yu Cheng, Debmalya Panigrahi and Kevin Sun. Sparsification of Directed Graphs via Cut Balance<\/strong><\/li>\n
  90. Sepehr Assadi and Soheil Behnezhad<\/a>. Beating Two-Thirds For Random-Order Streaming Matching<\/strong><\/li>\n
  91. Ojas Parekh and Kevin Thompson. Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms<\/strong><\/li>\n
  92. Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song and Huacheng Yu. Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs<\/strong><\/li>\n
  93. Kuan Cheng, Alireza Farhadi, Mohammadtaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin and Yu Zheng. Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence<\/strong><\/li>\n
  94. Dingyu Wang<\/a>, Seth Pettie<\/a> and Longhui Yin. Non-Mergeable Sketching for Cardinality Estimation<\/strong><\/li>\n
  95. Guy Blanc, Jane Lange and Li-Yang Tan. Learning stochastic decision trees<\/strong><\/li>\n
  96. Amin Saberi<\/a> and David Wajc<\/a>. The Greedy Algorithm is not Optimal for On-Line Edge Coloring<\/strong><\/li>\n
  97. Mitali Bafna<\/a> and Nikhil Vyas<\/a>. Optimal Fine-grained Hardness of Approximation of Linear Equations<\/strong><\/li>\n
  98. Chandra Chekuri and Kent Quanrud. Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity<\/strong><\/li>\n
  99. Arnab Ganguly, Dhrumil Patel, Rahul Shah and Sharma Thankachan. LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching<\/strong><\/li>\n
  100. Takaaki Nishimoto and Yasuo Tabei<\/a>. Optimal-Time Queries on BWT-runs Compressed Indexes<\/strong><\/li>\n
  101. Vahid Reza Asadi<\/a> and Igor Shinkar<\/a>. Relaxed Locally Correctable Codes with Improved Parameters<\/strong><\/li>\n
  102. Eleni Batziou, Kristoffer Arnsfelt Hansen<\/a> and Kasper H\u00f8gh. Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem<\/strong><\/li>\n
  103. Sharat Ibrahimpur and Chaitanya Swamy<\/a>. Minimum-Norm Load Balancing is (almost) as Easy as Minimizing Makespan<\/strong><\/li>\n
  104. Stratis Skoulakis, Dimitris Fotakis, Panagiotis Kostopanagiotis, Georgios Piliouras and Vasileios Nakos. On the Approximability of Dynamic Min-Sum Set Cover<\/strong><\/li>\n
  105. Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu and Qianfan Zhang. Random Order Vertex Arrival Contention Resolution Schemes For Matching, With Applications<\/strong><\/li>\n
  106. Ken-Ichi Kawarabayashi, Bojan Mohar, Roman Nedela and Peter Zeman. Automorphisms and isomorphisms of maps in linear time<\/strong><\/li>\n
  107. Christoph Damerius, Dominik Kaaser, Peter Kling<\/a> and Florian Schneider. On Greedily Packing Anchored Rectangles<\/strong><\/li>\n
  108. Adam Kurpisz<\/a>, Aaron Potechin<\/a> and Elias Wirth. SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization<\/strong><\/li>\n<\/ol>\n

     <\/p>\n

    Track B<\/h1>\n

     <\/p>\n

      \n
    1. Alex Brandts and Stanislav \u017divn\u00fd<\/a>. Beyond PCSP(1-in-3,NAE)<\/strong><\/li>\n
    2. Pascal Vanier<\/a> and Antonin Callard<\/a>. Computational characterization of surface entropies for Z\u00b2 subshifts of finite type<\/strong><\/li>\n
    3. Pawe\u0142 Parys<\/a>. Higher-Order Model Checking Step by Step<\/strong><\/li>\n
    4. Antoine Amarilli<\/a>, Louis Jachiet<\/a> and Charles Paperman<\/a>. Dynamic Membership for Regular Languages<\/strong><\/li>\n
    5. Luca Ciccone and Luca Padovani<\/a>. Inference Systems with Corules for Fair Subtyping and Liveness Properties of Binary Session Types<\/strong><\/li>\n
    6. Han Xu and Zhenjiang Hu. Analytical Differential Calculus with Integration<\/strong><\/li>\n
    7. Erich Gr\u00e4del<\/a> and Lovro Mrkonjic. Elementary equivalence versus isomorphism in semiring semantics<\/strong><\/li>\n
    8. Antonio Casares, Thomas Colcombet<\/a> and Nathana\u00ebl Fijalkow<\/a>. Optimal Transformations of Games and Automata using Muller Conditions<\/strong><\/li>\n
    9. Ian Pratt-Hartmann<\/a>. Fluted Logic with Counting<\/strong><\/li>\n
    10. Lorenzo Clemente<\/a> and Micha\u0142 Skrzypczak<\/a>. Deterministic and game separability for regular languages of infinite trees<\/strong><\/li>\n
    11. Gabriel Istrate<\/a>, Cosmin Bonchis and Adrian Craciun. Kernelization, Proof Complexity and Social Choice<\/strong><\/li>\n
    12. Benjamin Monmege<\/a>, Julie Parreaux<\/a> and Pierre-Alain Reynier<\/a>. Playing Stochastically in Weighted Timed Games to Emulate Memory<\/strong><\/li>\n
    13. Samson Abramsky<\/a> and Luca Reggio<\/a>. Arboreal Categories and Resources<\/strong><\/li>\n
    14. Krishnendu Chatterjee<\/a>, Monika Henzinger<\/a>, Sagar Kale<\/a> and Alexander Svozil<\/a>. Faster Algorithms for Bounded Liveness in Graphs and Game Graphs<\/strong><\/li>\n
    15. Thomas Colcombet<\/a> and Arthur Jaquard<\/a>. A Complexity Approach to Tree Algebras: the Bounded Case<\/strong><\/li>\n
    16. Wojciech Czerwinski, Antoine Mottet<\/a> and Karin Quaas. New Techniques for Universality in Unambiguous Register Automata<\/strong><\/li>\n
    17. L\u00ea Th\u00e0nh D\u0169ng Nguy\u1ec5n<\/a>, Camille No\u00fbs and Pierre Pradic<\/a>. Comparison-free polyregular functions<\/strong><\/li>\n
    18. Gabriel Bathie and Tatiana Starikovskaya. Property testing of regular languages with applications to streaming property testing of visibly pushdown languages<\/strong><\/li>\n
    19. Antoine Mottet<\/a>, Tom\u00e1\u0161 Nagy, Michael Pinsker<\/a> and Micha\u0142 Wrona<\/a>. Smooth Approximations and Relational Width Collapses<\/strong><\/li>\n
    20. Dominik D. Freydenberger<\/a> and Liat Peterfreund<\/a>. The theory of concatenation over finite models<\/strong><\/li>\n
    21. Alexandre Goy<\/a>, Daniela Petrisan<\/a> and Marc Aiguier<\/a>. Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces<\/strong><\/li>\n
    22. Manuel Bodirsky<\/a>, Simon Kn\u00e4uer and Sebastian Rudolph<\/a>. Datalog-Expressibility for Monadic and Guarded Second-Order Logic<\/strong><\/li>\n
    23. Paolo Baldan<\/a>, Francesco Ranzato<\/a> and Linpeng Zhang<\/a>. A Rice’s Theorem for Abstract Semantics<\/strong><\/li>\n
    24. Wojciech Czerwi\u0144ski<\/a>, S\u0142awomir Lasota<\/a> and \u0141ukasz Orlikowski. Improved lower bounds for reachability in vector addition systems<\/strong><\/li>\n
    25. Todd Schmid<\/a>, Tobias Kapp\u00e9<\/a>, Dexter Kozen<\/a> and Alexandra Silva<\/a>. Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness<\/strong><\/li>\n
    26. Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup and Guillaume Rabusseau. Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata<\/strong><\/li>\n
    27. Yangjia Li and Dominique Unruh<\/a>. Quantum Relational Hoare Logic with Expectations<\/strong><\/li>\n
    28. Martin Grohe<\/a> and Sandra Kiefer<\/a>. Logarithmic Weisfeiler-Leman Identifies All Planar Graphs<\/strong><\/li>\n
    29. Sergey Goncharov<\/a>. Uniform Elgot Iteration in Foundations<\/strong><\/li>\n<\/ol>\n

       <\/p>\n

      [\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"

      Accepted papersProceedings \u00a0The ICALP 2021 Proceedings have now been published in the LIPIcs series.\u00a0 Best paper awards Track A Sayan Bhattacharya and Peter Kiss. Deterministic Rounding of Dynamic Fractional Matchings Track B Antoine Amarilli, Louis Jachiet and Charles Paperman. Dynamic Membership for\u00a0Regular Languages   Best student paper awards (for papers written solely by students) Track […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":""},"_links":{"self":[{"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/pages\/463"}],"collection":[{"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/comments?post=463"}],"version-history":[{"count":6,"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/pages\/463\/revisions"}],"predecessor-version":[{"id":768,"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/pages\/463\/revisions\/768"}],"wp:attachment":[{"href":"https:\/\/easyconferences.eu\/icalp2021\/wp-json\/wp\/v2\/media?parent=463"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}