- finite-model-theory - lists.rwth-aachen.de

RAMiCS 2023 - First call for papers
by Michael Winter 24 May '22

24 May '22

CALL FOR PAPERS 20th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2023 3 to 6 April 2023, Technologiezentrum Augsburg, Germany https://ramics20.lis-lab.fr/ IMPORTANT DATES: Abstract Submission: September 23, 2022 Paper Submission: September 30, 2022 Author Notification: December 09, 2022 Final Version: January 06, 2023 RAMiCS 2021: April 03-06, 2023 GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. RAMiCS 2023 will take place at the Technologiezentrum Augsburg. Depending on the Covid-19 situation, it will take the form of a physical conference, a virtual conference, or a hybrid between the two. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2023 All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Roland Glück, Deutsches Zentrum für Luft- und Raumfahrt, Germany Conf. & PC Co-Chair: Luigi Santocanale, LIS, Aix-Marseille University, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Adriana Balan, University Politechnic of Bucharest, Romania Manuel Bodirsky, Technical University Dresden, Germany Paul Brunet, Paris-East Créteil University, France Miguel Couceiro, Loria, Nancy, France Manfred Droste, Leipzig University, Germany Uli Fahrenberg, Epita, France Hitoshi Furusawa, Kagoshima University, Japan Wessley Fussner, University of Bern, Switzerland Silvio Ghilardi, University of Milan, Italy Roland Glueck, German Aerospace Center, Augsburg, Germany Walter Guttmann, University of Canterbury, New Zealand Robin Hirsch, University College London, UK Peter Höfner, Australian National University, Canberra, Australia Marcel Jackson, La Trobe University, Melbourne, Australia Ali Jaoua, Qatar University, Qatar Peter Jipsen, Chapman University, Orange, USA Sebastian Joosten, Dartmouth College, Hanover, USA Barbara König, University of Duisburg/Essen, Germany Wendy MacCaull, St. Francis Xavier University, Antigonish, Canada Roger Maddux, Iowa State University, Ames, USA Nelma Moreira, University of Porto, Portugal Martin Mueller, University of Applied Sciences, Bonn-Rhein-Sieg, Germany Damien Pous, CNRS, ENS Lyon, France Luigi Santocanale, Aix-Marseille University, France Ana Sokolova, University of Salzburg, Austria Sara Ugolini, Autonomous University of Barcelona, Spain Michael Winter, Brock University, St. Catharines, Canada Sam van Gool, University Paris, France

1 0

[Deadline Extension] LAMAS & SR 2022 - Final Call for Contributions
by Fabio Mogavero 23 May '22

23 May '22

[Apologies for multiple cross-posting] [Deadline Extended to *June 5th (AoE)*] -------------------------------------------------------------------------------- Final Call for Contributions 2nd International Workshop on Logical Aspects in Multi-Agent Systems and Strategic Reasoning (LAMAS&SR) 2022 25-26 August 2022, Rennes, France URL: https://lamassr.github.io/ -------------------------------------------------------------------------------- Objectives ---------- Logics and strategic reasoning play a central role in multi-agent systems. Logics can be used, for instance, to express the agents’ abilities, knowledge, and objectives. Strategic reasoning refers to algorithmic methods that allow for developing good behaviour for the agents of the system. At the intersection, we find logics that can express existence of strategies or equilibria, and can be used to reason about them. The LAMAS&SR workshop merges two international workshops: LAMAS (Logical Aspects of Multi-Agent Systems), which focuses on all kinds of logical aspects of multi-agent systems from the perspectives of artificial intelligence, computer science, and game theory, and SR (Strategic Reasoning), devoted to all aspects of strategic reasoning in formal methods and artificial intelligence. List of Topics -------------- The topics covered by the workshop include, but are not limited to: * Logical systems for specification, analysis, and reasoning about multi-agent systems * Logic-based modelling of multi-agent systems * Dynamical multi-agent systems * Deductive systems and decision procedures for logics for multi-agent systems * Development and implementation of methods for verification in multi-agent systems * Logic-based tools for multi-agent systems * Logics for reasoning about strategic abilities * Logics for multi-agent mechanism design, verification, and synthesis * Logical foundations of decision theory for multi-agent systems * Strategic reasoning in formal verification * Automata theory for strategy synthesis * Applications and tools for cooperative and adversarial reasoning * Robust planning and optimisation in multi-agent systems * Risk and uncertainty in multi-agent systems * Quantitative aspects in strategic reasoning Invited Speakers ---------------- * Rineke Verbrugge, University of Groningen Co-Located Event ---------------- LAMAS&SR 2022 will be an event co-located with the 14th International Conference on Advances In Modal Logic (AiML 2022, 22-25 August). About COVID-19 -------------- Local organizers are following closely the evolution of the pandemic situation. Our preference is for a full in-person event, but we will employ an online or hybrid format according to the situation. Important Dates --------------- * Paper submission: (extended to) June 5 (AoE) * Author notification: June 30 (AoE) * Camera ready: July 15 (AoE) * Workshop: August 25-26, 2022 Contribution Submission ----------------------- Authors are invited to submit extended abstracts of 2 pages, plus 1 page for references only, in the AAMAS 2022 format. Both published and unpublished works are welcome. Submissions are subject to a single-blind review process, thus, submissions should not be anonymous, must be in PDF format, and will be handled via EasyChair at https://easychair.org/conferences/?conf=lamassr22 Although there will be no formal proceedings, accepted extended abstracts will be made available on the workshop website. Extensions of selected original contributions will be then invited to a special issue of Games, an MDPI open-access journal, with a special arrangement. Program Co-Chairs ----------------- * Fabio Mogavero, Università di Napoli Federico II * Sophie Pinchinat, Université de Rennes 1 Program Committee ----------------- * Thomas Agotnes, University of Bergen * Natasha Alechina, Utrecht University * Guy Avni, University of Haifa * Massimo Benerecetti, University of Naples Federico II * Hans van Ditmarsch, Open University of Netherlands * Valentin Goranko, Stockholm University * Wojtek Jamroga, University of Luxembourg and Polish Academy of Sciences * Dario Della Monica, University of Udine * Emiliano Lorini, Université Paul Sabatier * Nicolas Markey, Université de Rennes 1 * Bastien Maubert, University of Naples Federico II * John-Jules C. Meyer, Utrecht University * Aniello Murano, University of Naples Federico II * Rohit J. Parikh, City University of New York * Sasha Rubin, The University of Sydney, Australia * Chenwei Shi, Tsinghua University * Yanjing Wang, Peking University Organising Committee -------------------- * Sophie Pinchinat, Université de Rennes 1 * Dylan Bellier, Université de Rennes 1 * Pierre Le Scornet, Université de Rennes 1 * Sophie Maupile, Université de Rennes 1 * Alexandre Terefenko, Université de Rennes 1 * Fabio Mogavero, Università di Napoli Federico II

1 0

Trends in Arithmetic Theories -- call for participation
by Dmitry Chistikov 20 May '22

20 May '22

An ICALP 2022 satellite workshop "Trends in Arithmetic Theories" will take place on Monday 4 July 2022 in Paris, France (in person): http://www.cs.ox.ac.uk/people/christoph.haase/home/trends-in-arithmetic-the… Logical theories of arithmetic such as Presburger arithmetic play an important role in a variety of different areas of computer science and have been studied since the early days of the field. The recent years have seen a lot of progress on all aspects of such theories, ranging from new foundational results, algorithmic advances, more performant decision procedures to novel application domains. This progress has largely been obtained independently without much interaction between researchers working on different aspects of this field. The goal of this workshop is to bring together researchers working in the field to exchange latest trends, understand currently existing challenges and to initiate new collaborations. Everyone interested in arithmetic theories is invited to attend. This will be an in-person workshop, but we hope to livestream talks and plan to make them available online after the event has taken place. Speakers: Émilie Charlier (Université de Liège, Belgium) Philipp Hieronymi (University of Bonn, Germany) Roberto Sebastiani (Università di Trento, Italy) Thomas Sturm (Loria Nancy, France & MPI for Informatics, Germany) Sven Verdoolaege (Cerebras Systems, Belgium) Programme and registration: In addition to invited talks, we plan to include an introductions-type session in the programme to give all attendees an opportunity to get to know each other. Please register for the workshop through the main ICALP registration: https://icalp2022.irif.fr/?page_id=50 We're also thinking about a workshop dinner, on Sunday evening before the event. Workshop organisers: Dmitry Chistikov (U. Warwick) Christoph Haase (U. Oxford) Alessio Mansutti (U. Oxford) Jonathan Tanner (U. Oxford) Acknowledgements: This workshop receives support through the ERC project ARiAT. ICALP is the International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS).

1 0

CFP: 30 Years Finite Model Theory in Finland: Call for Presentations
by Jonni T Virtema 19 May '22

19 May '22

30 Years of Finite Model Theory in Finland Hanaholmen, Espoo, Finland, August 21-23, 2022 https://www.helsinki.fi/en/conferences/30-years-of-finite-model-theory-in-f… <https://www.helsinki.fi/en/conferences/30-years-of-finite-model-theory-in-f…> We solicit proposals for short presentations fitting the wide topic of the workshop. If you are interested in presenting your work at the workshop, please send a brief email to fmt-30(a)helsinki.fi <mailto:fmt-30@helsinki.fi> with your proposed title and a short (one paragraph) abstract. This international workshop celebrates the past 30 years of active research in the area of Finite Model Theory (FMT) in Finland. Research in FMT in Finland began due to the joint efforts of Phokion G. Kolaitis and Jouko Väänänen in the end of 1980's. Concurrently, while celebrating the 30 years of FMT in Finland, the workshop aspires to be a venue for displaying the current state-of-art of research in FMT globally. The meeting will consist of three keynote lectures, several contributed talks, and plenty of time for collaboration spread over a three day period. The workshop aspires for an intimate and relaxed atmosphere in the spirit of Dagstuhl seminars. The meeting will take place in a secluded conference hotel Hanaholmen on the coast of the Baltic Sea (https://www.hanaholmen.fi/en/ <https://www.hanaholmen.fi/en/>). While secluded, the hotel is also conveniently located just outside Helsinki city center, and can be reached from the main railway station in 20 minutes using the metro. Tentative keynote speakers: Anuj Dawar <https://www.cl.cam.ac.uk/~ad260/> (University of Cambridge) Phokion G. Kolaitis <https://users.soe.ucsc.edu/~kolaitis/> (University of California, Santa Cruz and IBM Almaden Research Center) Jouko Väänänen <http://www.math.helsinki.fi/logic/people/jouko.vaananen/> (University of Helsinki and University of Amsterdam) Registration for the workshop is now open (https://www2.helsinki.fi/en/conferences/30-years-of-finite-model-theory-in-… <https://www2.helsinki.fi/en/conferences/30-years-of-finite-model-theory-in-…>). The registration fee is 250€ covering full board during the workshop but not accommodation. The registration is open until 6 July 2022. Note that the workshop immediately follows the 28th Nordic Congress of Mathematics that takes place in Espoo 18-21 August: https://ncm28.math.aalto.fi/ <https://ncm28.math.aalto.fi/>

1 0

FoIKS 2022: Call for participation
by Kontinen, Juha A 18 May '22

18 May '22

* Apologies if you receive multiple copies of this call * ========================================================= Call for Participation FoIKS 2022: 12th International Symposium on Foundations of Information and Knowledge Systems University of Helsinki, Finland, 20-23 June 2022 Conference website: https://foiks2022.github.io Early registration: 20 May 2022 ========================================================= The FoIKS symposia provide a biennial forum for presenting and discussing theoretical and applied research on information and knowledge systems. The goal is to bring together researchers interested in this subject, share research experiences, promote collaboration, and identify new issues and directions for future research. The FoIKS symposia are a forum for intensive discussions. Speakers will be given sufficient time to present their ideas and results within the larger context of their research. Furthermore, participants will be asked to prepare a first response to another contribution to initiate discussion. *** Technical Program The program is available online (subject to slight changes): https://foiks2022.github.io/program.html *** Invited Speakers - Patricia Bouyer-Decitre: Memory complexity for winning games on graphs - Gabriele Kern-Isberner: The Relevance of Formal Logics for Cognitive Logics, and Vice Versa - Jussi Rintanen: More automation to software engineering - Jouko Väänänen: Dependence logic: Some recent developments - Zeev Volkovich: Text classification using "imposter" projections method *** Registration Please check https://foiks2022.github.io/registration.html *** Publication Springer-Verlag will publish the proceedings in the Lecture Notes in Computer Science. After the symposium, authors of selected papers will be invited to submit extended journal versions of their papers for a FoIKS 2022 special issue of the Annals of Mathematics and Artificial Intelligence or another journal. Exact details will be provided on the conference website in due time. *** Venue The conference will be held at the University of Helsinki. *** Further Information Please visit the conference website (https://foiks2022.github.io) for further information and regular updates. *** Organisation and Program Committee See https://foiks2022.github.io

1 0

ICALP 2022 - Call for Participation - Extended early registration
by Amaury Pouly (IRIF) 18 May '22

18 May '22

Highlights: - Due to multiple requests, the early registration deadline has been extended to May 18. - We recommend that participants make their hotel reservations as early as possible since Paris is an attractive destination for tourists during the summer. - The conference programme is now available. The 49th International Colloquium on Automata, Languages, and Programming (ICALP) will take place ** in Paris, France, and online on 4-8 July 2022. ** The 2022 edition has the following special features: - The conference is hybrid. - This will be the 50th birthday of the conference and some special events are planned. - The ICALP Extended Stay Support Scheme (IESSS) is here for helping the organisation of collaborations around the conference. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series of workshops, which will take place on July 4. The 2022 edition will be also the occasion to celebrate the 50th anniversary of both EATCS and the first ICALP, which was first held in 1972 in Rocquencourt, in the Paris area. ============= Important dates and information ============= Website: https://icalp2022.irif.fr/ Early Registration: May 18 Conference: July 4-8, 2022 Workshops: July 4 ============= Registration ============= For registration, follow this link: https://icalp2022.irif.fr/?page_id=50 ============= Extended Stay Support Scheme (IESS) ============= For its 49th edition, the ICALP conference offers to its attendees an Extended Stay Support Scheme (IESSS) aiming at enhancing scientific collaborations and diminishing the carbon footprint of scientific research activities. ICALP 2022 attendees are encouraged to combine their visit to Paris with collaborations with local researchers. This support scheme is primarily intended for participants travelling long distances and must be combined with an attendance to ICALP. Upon acceptation, research institutes involved in this mechanism will cover standard expenses (accommodation and traveling fees, plane excluded) and will provide material support for research activities. See https://icalp2022.irif.fr/?page_id=50 for more information. ============= Invited Speakers ============= Albert Atserias, Universitat Politècnica de Catalunya Constantinos Daskalakis, MIT Leslie Ann Goldberg, Oxford University Madhu Sudan, Harvard Stéphan Thomassé, ENS Lyon Santosh Vempala, Georgia Tech ============= Awards ============= During the conference, the following awards will be given: - the EATCS award (https://eatcs.org/index.php/eatcs-award), - the Gödel prize (https://eatcs.org/index.php/goedel-prize), - the Presburger award (https://eatcs.org/index.php/presburger), - the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award), - the best papers for Track A and track B, - the best student papers for Track A and track B. ============= Accepted papers ============= See https://icalp2022.irif.fr/?page_id=85 ============= Workshops ============= See https://icalp2022.irif.fr/?page_id=46 for more information. - Parameterized Approximation Algorithms Workshop - Combinatorial Reconfiguration - Recent Advances on Total Search Problems - Algorithmic Aspects of Temporal Graphs V - Trends in Arithmetic Theories - Structure Meets Power 2022 - Straight-Line Programs, Word Equations and their Interplay - Graph Width Parameters: from Structure to Algorithms ============= Programme ============= See https://icalp2022.irif.fr/wp-content/uploads/2022/05/icalp2022programme.pdf or below. # Tuesday 8h30-9h30. Invited speaker 1 * Santosh Vempala _The Manifold Joys of Sampling in High Dimension_ # Tuesday 10h00-12h05. Paper session 1 ## Graph algorithms * Sebastian Forster, and Tijn de Vos _Faster Cut Sparsification of Weighted Graphs_ * Tianyi Zhang _Faster Cut-Equivalent Trees in Simple Graphs_ * Mingyang Deng, Yael Kirkpatrick, Victor Rong, Virginia Vassilevska Williams, and Ziqian Zhong _New Additive Approximations for Shortest Paths and Cycles_ * Caroline Brosse, Vincent Limouzy, and Arnaud Mary _Polynomial Delay Algorithm for Minimal Chordal Completions_ * Konrad Majewski, Tomáš Masařík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Paweł Rzążewski, and Marek Sokołowski _Max Weight Independent Set in Fraphs with no Long Claws: An Analog of the Gyárfás' Path Argument_ ## Games and verification * Léonard Brice, Jean-Francois Raskin, and Marie Van Den Bogaard _The complexity of SPEs in Mean-payoff Games_ * Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, and Jean-Francois Raskin _Strategy Synthesis for Global Window PCTL_ * Hugo Gimbert, Corto Mascle, Anca Muscholl, and Igor Walukiewicz _Distributed Controller Synthesis for Deadlock Avoidance_ * Xavier Allamigeon, Stephane Gaubert, Ricardo D. Katz, and Mateusz Skomra _Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games_ * Nathalie Bertrand, Nicolas Markey, Ocan Sankur, and Nicolas Waldburger _Parameterized Safety Verification of Round-based Shared-memory Systems_ ## Sketching and streaming * Aviad Rubinstein, and Junyao Zhao _Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2- Approximation_ * Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, and Rico Zenklusen _Streaming Submodular Maximization under Matroid Constraints_ * Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý _Streaming Algorithms for Geometric Steiner Forest_ * Moses Charikar, and Erik Waingarten _Polylogarithmic Sketches for Clustering_ * Amit Deshpande, and Rameshwar Pratap _One-pass Additive-error Subset Selection for $\ell_{p}$ Subspace approximation_ ## Coding theory * Tal Yankovitz, and Gil Cohen _LCC and LDC: Tailor-made Distance Amplification and a Refined Separation_ * Nicolas Resch, and Chen Yuan _Threshold Rates of Code Ensembles: Linear is Best_ * Dean Doron, and Mary Wootters _High-Probability List-Recovery, and Applications to Heavy Hitters_ * Ittai Rubinstein _Explicit and Efficient Construction of (nearly) Optimal Rate Codes for the Binary Deletion Channel and the Poisson Repeat Channel_ * Zhenjian Lu, Igor Oliveira, and Marius Zimand _Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity_ # Tuesday 14h00-15h00. Invited speaker 2 * Leslie Ann Goldberg _Some new (and old) Results on Contention Resolution_ # Tuesday 15h30-17h10. Paper session 2 ## Quantum * Chi-Ning Chou, Peter Love, Jonathan Shi, and Juspreet Singh Sandhu _Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond_ * Penghui Yao, Yitong Yin, and Xinyuan Zhang _Polynomial-Time Approximation of Zero-Free Partition Functions_ * Jaikumar Radhakrishnan, Shyam Dhamapurkar, and Shubham Pawar _Set Membership with Two Classical and Quantum Bit Probes_ * Sourav Chakraborty, Chandrima Kayal, and Manaswi Paraashar _Separations between Combinatorial Measures for Transitive Functions_ ## Computability and dynamic systems * Djamel Eddine Amir, and Mathieu Hoyrup _Computability of Finite Simplicial Complexes_ * Donald Stull _The Dimension Spectrum Conjecture for Planar Lines_ * Ville Salo, and Ilkka Törmä _What can Oracles Teach us about the Ultimate Fate of Life?_ * Jakob Piribauer, Ocan Sankur, and Christel Baier _The Variance-penalized Stochastic Shortest Path Problem_ ## Reconstruction problems * Josep Diaz, Varsha Dani, Cristopher Moore, and Thomas Hayes _Improved Reconstruction of Random Geometric Graphs_ * Andrew McGregor, and Rik Sengupta _Graph Reconstruction from Random Subgraphs_ * Akash Kumar, Anand Louis, and Rameesh Paul _Exact Recovery Algorithm for Planted Bipartite Graph in Semi-random Graphs_ * Guy Blanc, Jane Lange, and Li-Yang Tan _Reconstructing Decision Trees_ ## Game theory, networks, and distributed * William Kuszmaul, and Shyam Narayanan _Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game_ * Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, and Nicole Wein _Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost_ * Stavros Ioannidis, Bart de Keijzer, and Carmine Ventre _Strong Approximations and Irrationality in Financial Networks with Derivatives_ * Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, and Anna Melnichenko _Social Distancing Network Creation_ # Tuesday 18h00-21h00. Cocktail and vernissage of the exhibition for the 50 years of EATCS / ICALP # Wednesday 8h30-9h30. Invited speaker 3 * Constantinos Daskalakis _Equilibrium Computation, Deep Learning, and Multi-Agent (Reinforcement) Learning_ # Wednesday 10h00-12h05. Paper session 3 ## Counting and sampling * Charilaos Efthymiou _On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs._ * Ivona Bezakova, Andreas Galanis, Leslie Goldberg, and Daniel Stefankovic _Fast sampling via Spectral Independence beyond Bounded-degree Graphs_ * Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, and Eric Vigoda _Metastability of the Potts Ferromagnet on Random Regular Graphs_ * Andreas Galanis, Daniel Stefankovic, and Eric Vigoda _Approximating Observables is as Hard as Counting_ * Guoliang Qiu, Yanheng Wang, and Chihao Zhang _A Perfect Sampler for Hypergraph Independent Sets_ ## Tranducers and automata * Mika Göös, Stefan Kiefer, and Weiqiang Yuan _Lower Bounds for Unambiguous Automata via Communication Complexity_ * 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_ * Léo Exibard, Emmanuel Filiot, and Ayrat Khalimov _A Generic Solution to Register-bounded Synthesis With an Application to Discrete Orders_ * Leon Bohn, and Christof Löding _Passive Learning of Deterministic Büchi Automata by Combinations of DFAs_ * Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, and Georg Zetzsche _Reachability in Bidirected Pushdown VASS_ ## Property testing * Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury, and Sayantan Sen _Tolerant Bipartiteness Testing in Dense Graphs_ * Louis Esperet, and Sergey Norin _Testability and Local Certification of Monotone Properties in Minor-closed Classes_ * Omri Ben-Eliezer, Shoham Letzter, and Erik Waingarten _Finding Monotone Patterns in Sublinear Time, Adaptively_ * Talya Eden, Dana Ron, and Will Rosenbaum _Almost Optimal Bounds for Sublinear-Time Sampling of $k$-Cliques in Bounded Arboricity Graphs_ * Karl Bringmann, Alejandro Cassis, Nick Fischer, and Vasileios Nakos _Improved Sublinear-Time Edit Distance for Preprocessed Strings_ ## Dynamic algorithms and sensitivity oracles * Josh Alman, and Dean Hirsch _Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras_ * Surender Baswana, Koustav Bhanja, and Abhyuday Pandey _Minimum+1 (s,t)-cuts and Dual Edge Sensitivity Oracle_ * Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, and Martin Schirneck _Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances_ * Aaron Bernstein, Jan van den Brand, Maximilian Probst, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun _Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary_ * Aleksander B. G. Christiansen, and Eva Rotenberg _Fully-dynamic α + 2 Arboricity Decomposition and Implicit Colouring._ # Wednesday 14h00-16h05. Best papers session * Joakim Blikstad _Sublinear-round Parallel Matroid Intersection_ * Jakub Tětek _Approximate Triangle Counting via Sampling and Fast Matrix Multiplication_ * Gaëtan Douéneau-Tabot _Hiding Pebbles when the Output Alphabet is Unary_ * Ilan Newman, and Nithin Varma _Strongly Sublinear Algorithms for Testing Pattern Freeness_ * Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, and Szymon Toruńczyk _Twin-width and Types_ # Wednesday 16h45-17h30. EATCS Award 2022 * TBA _TBA_ # Wednesday 17h30-19h30. EATCS general assembly * _EATCS general assembly:\\ EATCS fellows, EATCS distinguished dissertation Award, Best Icalp papers, Best Icalp Student Papers_ # Thursday 8h30-9h30. Invited speaker 4 * Albert Atserias _Towards a Theory of Algorithmic Proof Complexity: Motivation and Directions_ # Thursday 10h00-12h05. Paper session 4 ## Computational Geometry * Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, and Andreas Wiese _Tight Approximation Algorithms for Two-dimensional Guillotine Strip Packing_ * Fedor Fomin, Petr Golovach, Tanmay Inamdar, and Meirav Zehavi _(Re)packing Equal Disks into Rectangle_ * Ziyun Huang, and Jinhui Xu _In-Range Farthest Point Queries and Related Problem in High Dimensions_ * Jacobus Conradi, and Anne Driemel _On Computing the k-Shortcut Fréchet Distance_ * Klaus Jansen, Arindam Khan, Marvin Lira, and K. V. N. Sreenivas _A PTAS for Packing Hypercubes into a Knapsack_ ## Parameterized complexity * Ramanujan M. Sridharan, Daniel Lokshtanov, and Fahad Panolan _Backdoor Sets on Nowhere Dense SAT_ * Bingkai Lin, Xuandi Ren, Yican Sun, and Xiuhan Wang _On Lower Bounds of Approximating Parameterized $k$-Clique_ * Ishay Haviv _A Fixed-Parameter Algorithm for the Kneser Problem_ * Clément Legrand-Duchesne, Ashutosh Rai, and Martin Tancer _Parameterized Complexity of Untangling Knots_ * Alexandra Lassota, Aleksander Łukasiewicz, and Adam Polak _Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs_ ## Approximation algorithms * Lin Chen, Xiaoyu Wu, and Guochuan Zhang _Approximation Algorithms for Interdiction Problem with Packing Constraints_ * Karl Bringmann, and Alejandro Cassis _Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution_ * Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, and Pasin Manurangsi _Improved Approximation Algorithms and Lower Bounds for Search- Diversification Problems_ * Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, and K. V. N. Sreenivas _Near-optimal Algorithms for Stochastic Online Bin Packing_ * Claire Mathieu, and Hang Zhou _A PTAS for Capacitated Vehicle Routing on Trees_ ## Optimization * Shunhua Jiang, Bento Natura, and Omri Weinstein _A Faster Interior-Point Method for Sum-of-Squares Optimization_ * Ming Ding, Rasmus Kyng, and Peng Zhang _Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions_ * Marcin Briański, Martin Koutecký, Daniel Kráľ, Kristýna Pekárková, and Felix Schröder _Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Anteger Programming_ * Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, and Peng Zhang _Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets_ * Mitchell Black, and Amir Nayyeri _Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes_ # Wednesday 14h30-15h50. Presburger Award and Gödel Prize 2022 * TBA _TBA_ * TBA _TBA_ # Thursday 16h00-17h40. Paper session 5 ## Homomorphisms * Martin Grohe, Gaurav Rattan, and Tim Seppelt _Homomorphism Tensors and Linear Equations_ * Sandra Kiefer, and Daniel Neuen _A Study of Weisfeiler-Leman Colorings on Planar Graphs_ * Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, and Kirill Simonov _The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique- Width_ * Balagopal Komarath, Anurag Pandey, and C. S. Rahul _Monotone Arithmetic Complexity of Graph Homomorphism Polynomials_ ## Process calculi and types * David Barozzini, Paweł Parys, and Jan Wróblewski _Unboundedness for Recursion Schemes: A Simpler Type System_ * Enguerrand Prebet _Functions and References in the pi-Calculus: Full Abstraction and Proof Techniques_ * Todd Schmid, Wojciech Rozowski, Alexandra Silva, and Jurriaan Rot _Processes Parametrised by an Algebraic Theory_ ## Learning theory, fairness, and privacy * Jan Pich, and Rahul Santhanam _Learning Algorithms versus Automatability of Frege Systems_ * Nathaniel Harms, and Yuichi Yoshida _Downsampling for Testing and Learning in Product Distributions_ * Niclas Boehmer, and Tomohiro Koana _The Complexity of Finding Fair Many-to-One Matchings_ * Jeremiah Blocki, Elena Grigorescu, and Tamalika Mukherjee _Privately Estimating Graph Parameters in Sublinear time_ ## Randomness in computation * Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro _Low-Degree Polynomials Extract from Local Sources_ * Shir Peleg, Gil Cohen, Dor Minzer, Aaron Potechin, and Amnon Ta-Shma _Expander Random Walks: The General Case and Limitations_ * Nikhil Bansal, Haotian Jiang, Raghu Meka, Sahil Singla, and Makrand Sinha _Smoothed Analysis of the Koml\'os Conjecture_ * Jakob Bæk Tejs Houen, and Mikkel Thorup _Understanding the Moments of Tabulation Hashing via Chaoses_ # Friday 8h30-9h30. Invited speaker 5 * Madhu Sudan _Streaming and Sketching Complexity of CSPs: A survey_ # Friday 10h00-12h05. Paper Session 6 ## Data structures, sorting, and string processing * Elahe Ghasemi, Vincent Jugé, and Ghazal Khalighinejad _Galloping in Fast-growth Natural Merge Sorts_ * Takaaki Nishimoto, Shunsuke Kanda, and Yasuo Tabei _An Optimal-Time RLBWT Construction in BWT-runs Bounded Space_ * Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan _Fully Functional Parameterized Suffix Trees in Compact Space_ * Debarati Das, Tomasz Kociumaka, and Barna Saha _Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding_ * Pawel Gawrychowski, and Karol Pokorski _Sublinear Dynamic Interval Scheduling (on one or multiple machines)_ ## Graphs and complexity * Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, and Raghunath Tewari _Dynamic Meta-theorems for Distance and Matching_ * Amina Doumane _Regular Expressions for Tree-Width 2 Graphs_ * Tamio-Vesa Nakajima, and Stanislav Živný _Linearly Ordered Colourings of Hypergraphs_ * Niel De Beaudrap, Aleks Kissinger, and John van de Wetering _Circuit Extraction for ZX-diagrams can be \#P-hard_ * Pawel Idziak, Piotr Kawałek, Jacek Krzaczkowski, and Armin Weiß _Satisfiability Problems for Finite Groups_ ## Graph distances and fault tolerance * Diptarka Chakraborty, Kushagra Chatterjee, and Keerti Choudhary _Pairwise Reachability Oracles and Preservers under Failures_ * 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_ * Chao Liao, Qingyun Chen, Bundit Laekhanukit, and Yuhao Zhang _Almost Tight Approximation Hardness for Single-Source Directed k-Edge- Connectivity_ * 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_ * Shimon Kogan, and Merav Parter _Beating Matrix Multiplication for $n^{1/3}$-Directed Shortcuts_ ## Complexity * Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann _A Structural Investigation of the Approximability of Polynomial-Time Problems_ * Theodoros Papamakarios, and Alexander Razborov _Space Characterizations of Complexity Measures and Size-space Trade-offs in Propositional Proof Systems_ * Amulya Musipatla, Ryan O'Donnell, Tselil Schramm, and Xinyu Wu _The SDP Value of Random 2CSPs_ * Luyining Gan, and Jie Han _The Decision Problem for Perfect Matchings in Dense Hypergraphs_ * David Caballero, Timothy Gomez, Robert Schweller, and Tim Wylie _Unique Assembly Verification in Two-Handed Self-Assembly_ # Thursday 19h30-22h30. Conference dinner # Friday 14h00-15h00. Invited speaker 6 * Stéphan Thomassé _TBA_ # Friday 15h30-16h45. Paper session 7 ## Online algorithms * Yossi Azar, Chay Machluf, Boaz Patt-Shamir, and Noam Touitou _Competitive Vertex Recoloring_ * Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh _Online Weighted Cardinality Joint Replenishment Problem with Delay_ ## Decremental algorithms * Jakub Łącki, and Yasamin Nazari _Near-Optimal Decremental Hopsets with Applications_ * Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian _Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching_ * Sepehr Assadi, Aaron Bernstein, and Aditi Dudeja _Decremental Matching in General Graphs_ ## Cryptography * Zvika Brakerski, Nico Döttling, Sanjam Garg, and Giulio Malavolta _Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices_ * Shweta Agrawal, Damien Stehle, and Anshu Yadav _Round-Optimal Lattice-Based Threshold Signatures, Revisited_ * Justin Holmgren, Andrea Lincoln, and Ron Rothblum _Delegation for Search Problems_ ## Counting and complexity * Surya Mathialagan, Virginia Vassilevska Williams, and Yinzhan Xu _Listing, Verifying and Counting Lowest Common Ancestors in DAGs: Algorithms and Fine-Grained Lower Bounds_ * Calvin Beideman, Karthekeyan Chandrasekaran, and Weihang Wang _Counting and Enumerating Optimum Cut Sets for Hypergraph $k$-partitioning problems for fixed $k$_ * Pierre Bergé, Édouard Bonnet, and Hugues Déprés _Deciding Twin-width at most 4 is NP-complete_

1 0

CiE 2022 Call for Participation
by acie＠acie.eu 17 May '22

17 May '22

================================= CiE 2022: CALL FOR PARTICIPATION ================================= Computability in Europe 2022: Revolutions and revelations in computability **CiE 2022 will be an on-site conference with some remote talks** Swansea, Wales, United Kingdom July 11-15, 2022 https://cs.swansea.ac.uk/cie2022/ Registration link: https://easychair.org/register/register.cgi?a=28759463 IMPORTANT DATES: ================ Early registration: May 31, 2022 Postgraduate research student travel grant application: May 31, 2022 Women in Computability travel grant application: May 31, 2022 Regular registration: June 30, 2022 * Information about travel and accommodation is available at https://cs.swansea.ac.uk/cie2022/travelandaccommodation * Information about travel grants appears below and at https://cs.swansea.ac.uk/cie2022/travelgrants CiE 2022 is the 18th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno (2020, virtually), and Ghent (2021, virtually). TUTORIAL SPEAKERS: ================== - Dora Giammarresi (Università di Roma Tor Vergata) - Noam Greenberg (Victoria University of Wellington) INVITED SPEAKERS: ================= - Erika Ábrahám (RWTH Aachen University) - Thierry Coquand (University of Gothenburg) - Liesbeth de Mol (Université de Lille) - Damir Dzhafarov (University of Connecticut) - Harvey Friedman (The Ohio State University) - Svetlana Selivanova (Korea Advanced Institute of Science and Technology - KAIST) SPECIAL SESSIONS: ================= - At the intersection of computability and other areas of mathematics, organised by Denis Hirschfeldt (University of Chicago) and Karen Lange (Wellesley College) Speakers: Meng-Che Ho (California State University, Northridge) Bjørn Kjos-Hanssen (University of Hawai`i at Mānoa) Elvira Mayordomo (Universidad de Zaragoza) Alexandra Shlapentokh (Eastern Carolina University) - Computability theory of blockchain technology, organised by Arnold Beckmann (Swansea University) and Anton Setzer (Swansea University) Speakers: Eli Ben-Sasson (StarkWare) Maurice Herlihy (Brown University) Philip Wadler (University of Edinburgh) There will also be a panel discussion with the speakers of this special session. - Computing Language: Love Letters, Large Models and NLP, organised by Liesbeth de Mol (Université de Lille) and Giuseppe Primiero (University of Milan) for the Council of the HaPoC Commission Speakers: Troy Astarte (Swansea University) Juan-Luis Gastaldi (ETH Zürich) Maël Pégny (Universität Tübingen) Jacopo Tagliabue (COVEO) - Computing with bio-molecules, organised by Jérôme Durand-Lose (Université d'Orleans) and Claudio Zandron (University of Milan Bicocca) Speakers: Giuditta Franco (University of Verona) Maria Dolores Jiménez-López (University of Tarragona) Nicolas Schabanel (CNRS - LIP, École Normale Supérieure de Lyon) Petr Sosik (Silesian University of Opava) - Constructive and reverse mathematics, organised by Samuele Maschio (Universita di Padova) and Takako Nemoto (Hiroshima Institute of Technology) Speakers: Makoto Fujiwara (Tokyo University of Science) Takayuki Kihara (Nagoya University) Robert Lubarsky (Florida Atlantic University) Huishan Wu (BLCU Beijing) - Reachability problems, organised by Paul Bell (Liverpool John Moores University) and Igor Potapov (University of Liverpool) Speakers: Olivier Bournez (École Polytechnique de Paris) Véronique Bruyère (Université de Mons) Kitty Meeks (University of Glasgow) James Worrell (University of Oxford) CONTRIBUTED PAPERS: =================== Contributed papers have been selected from submissions received by the PROGRAM COMMITTEE consisting of: Marcella Anselmo (University of Salerno) Verónica Becher (University of Buenos Aires) Ulrich Berger (Swansea University, co-chair) Katie Brodhead (Florida State University) Laura Crosilla (University of Oslo) Joel Day (Loughborough University) Gianluca Della Vedova (University of Milan) Leah Epstein (University of Haifa) Maribel Fernandez (King's College London) Ekaterina Fokina (TU Wien) Johanna Franklin (Hofstra University, co-chair) Lorenzo Galeotti (Amsterdam University College) Sandra Kiefer (RWTH Aachen University) Susana Ladra (University of Coruna) Maria Emilia Maietti (University of Padova) Florin Manea (University of Goettingen) Klaus Meer (Brandenburg University of Technology Cottbus) Dale Miller (LIX Polytechnique) Russell Miller (Queens College CUNY) Arno Pauly (Swansea University) Nadia Pisanti (University of Pisa) Solon Pissis (CWI Amsterdam) Giuseppe Primiero (University of Milan) Ramyaa Ramyaa (New Mexico Tech) Monika Seisenberger (Swansea University) Anton Setzer (Swansea University) Alexandra Shlapentokh (East Carolina University) Reed Solomon (University of Connecticut) Mariya Soskova (University of Wisconsin-Madison) Peter Van Emde Boas (University of Amsterdam) Andreas Weiermann (Ghent University) Andreas Wichert (University of Lisbon) The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. The CONFERENCE PROCEEDINGS will be published by LNCS, Springer-Verlag, in the ARCoSS (Advanced Research in Computing and Software Science) subline. WOMEN IN COMPUTABILITY: ======================= We are very happy to announce that within the framework of the Women in Computability program, we are able to offer some grants for junior women researchers who want to participate in CiE 2022. Applications for this grant should be sent to Liesbeth de Mol, liesbeth.demol(a)univ-lille3.fr, before May 31, 2022 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior women researchers who are presenting a paper (including informal presentations) at CiE 2022. Association CiE: https://www.acie.eu/ CiE Conference Series: https://www.acie.eu/cie-conference-series/ HOSTED BY: ========== School of Mathematics and Computer Science at the Computational Foundry, Bay Campus, Swansea University, Crymlyn Burrows, Skewen, Swansea SA1 8EN, United Kingdom This conference is in cooperation with the Association for Women in Mathematics and supports the Welcoming Environment Statement. SPONSORS: ========= We are grateful for support from the Institute for Coding in Wales, the London Mathematical Society, technocamps, the Deutsche Vereinigung für Mathematische Logik und für Grundlagenforschung der Exakten Wissenschaften, and Springer-Verlag. ORGANIZING COMMITTEE: ====================== Troy Astarte (Swansea University) Arnold Beckmann (Swansea University) Ulrich Berger (Swansea University) Tonicha Crook (Swansea University) Faron Moller (Swansea University) Bertie Mueller (Swansea University) Eike Neumann (Swansea University) Arno Pauly (Swansea University, chair) Olga Petrovska (Swansea University) Pierre Pradic (Swansea University) Markus Roggenbach (Swansea University) Monika Seisenberger (Swansea University) Anton Setzer (Swansea University) John Tucker (Swansea University) For questions, please contact the organisers at cie2022swansea(a)gmail.com.

1 0

[Vardi-list] FLoC 2022 Call for Student Volunteers
by Moshe Y Vardi 16 May '22

16 May '22

The organizers of FLoC 2022 invite students to apply to our volunteer program. Volunteers will receive a stipend (a variable amount towards registration and travel costs for students depending on the origin of travel) in exchange for volunteer work at the conference. FLoC’22 volunteers will be able to interact with speakers and participants, network with other researchers and meet graduate students from all over the world. See https://www.floc2022.org/volunteers See you at FLoC'22 Moshe _______________________________________________ Vardi-list mailing list Vardi-list(a)mailman.rice.edu https://mailman.rice.edu/mailman/listinfo/vardi-list

1 0

Structure meets Power 2022: deadline soon
by Anuj Dawar 14 May '22

14 May '22

**************************************** * STRUCTURE MEETS POWER 2022 * * (an ICALP workshop) * * * * Call for Contributions * **************************************** Workshop dates: 4 July 2022 (Paris and online) https://www.cst.cam.ac.uk/conference/structure-meets-power-2022 Scope ----- There is a remarkable divide in the field of logic in Computer Science, between two distinct strands: one focusing on semantics and compositionality (“Structure”), the other on expressiveness and complexity (“Power”). These two fundamental aspects of our field are studied using almost disjoint technical languages and methods, by almost disjoint research communities. We believe that bridging this divide is a major issue in Computer Science, and may hold the key to fundamental advances in the field. The aim this workshop is to attract investigators at the boundary of the two strands, and those on either side of the divide interested on establishing new connections. This is an ICALP 2022 affiliated workshop. This will be a hybrid event, however, on site participation is highly recommended. Important dates --------------- Abstract submission: 27 May 2022 (extended) Author notification: 5 June 2022 Registration: 20 June 2022 Invited speakers ---------------- * Libor Barto (Charles University) * Sandra Kiefer (RWTH Aachen University) * Bartek Klin (University of Oxford) Submissions ----------- Those wishing to speak at the workshop are invited to submit an Extended Abstract of up to three pages (including references) describing the content of the contributed presentation. Submissions should only have a single author -- the speaker. The co-authors are required to be clearly indicated in the abstract and later also in the slides. For submissions please use the EasyChair conference system: https://easychair.org/conferences/?conf=smp2022 We encourage talks of all levels of progress, including novel contributions, already published results, work in progress, as well as survey-type contributions. However, original contributions might be considered for a subsequent special issue, consisting of journal versions of selected extended abstracts. Depending on the number of submissions, contributed talks will be 20-30 minutes long. Registration ------------ There will be two types of participation, online and on-site participation. For online participation it is mandatory to fill in the following form: https://www.cst.cam.ac.uk/conference/structure-meets-power-2022/registratio… For on-site participation one must fill in the ICALP registration form: https://icalp2022.dakini-pco.com/ Note that online participation is free and on-site participation costs 50 euros which includes 2 coffee breaks and lunch. Organising and Programme Committee: ----------------------------------- * Samson Abramsky * Anuj Dawar * Tomas Jakl * Dan Marsden

1 0

ACKERMANN AWARD 2022: 2ND CALL FOR NOMINATIONS
by EACSL Mail-Account 13 May '22

13 May '22

ACKERMANN AWARD 2022 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS (Note: there are no changes since the first call for nominations. However, since the first call was sent out in February and the deadline is July, a reminder might be helpful. Apologies for the extra mail.) Nominations are invited for the 2022 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2020 and 31 December 2021 are eligible for nomination for the award. The deadline for submission is 1 July 2022. Submission details follow below. Nominations can be submitted from 1 March 2022 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de *** The Award The 2022 Ackermann award will be presented to the recipient(s) at CSL 2023, the annual conference of the EACSL. The award consists of * a certificate, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, * an invitation to the winner to publish the thesis in the FoLLI subseries of Springer LNCS, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * Christel Baier (TU Dresden); * Maribel Fernandez (King’s College London); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Delia Kesner (IRIF, U Paris); * Slawomir Lasota (U Warsaw); * Prakash Panangaden (McGill University); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund), the president of EACSL; * Alexandra Silva, (University College London), ACM SigLog representative; * James Worrell (U Oxford). *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 10 pages) of the thesis in ENGLISH (ps or pdf file); it is recommended to not squeeze as much material as possible into these (at most) 10 pages, but rather to use them for a gentle introduction and overview, stressing the novel results obtained in the thesis and their impact; 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick(a)tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick(a)tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 22 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text.

1 0