finite-model-theory September 2019

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

4 Teilnehmer
4 Diskussionen

The Highlights of Logic, Games, and Automata advertisement mailing list

von Nathanaël Fijalkow

The annual Highlights of Logic, Games, and Automata conference has grown into a well-known and well-attended event, with already 7 past editions ( http://highlights-conference.org/). We would like to introduce a new tool for strengthening its community: an advertisement mailing list. This is the place to post about job openings (including PhD studentships and research internships), calls for events, and other announcements relevant to the research community working on Logic, Games, and Automata, broadly construed. *Please consider signing up here:* https://diff.u-bordeaux.fr/sympa/info/highlights_community or by sending an email to sympa(a)diff.u-bordeaux.fr with subject line: subscribe highlights_community Firstname Lastname The list is moderated to make sure that the emails are pertinent. It is not meant to be a discussion forum, so only "announcements" will be disseminated. There are several features offered by the sympa manager, including: publicly available archives, digests, RSS. Please note that this is a different mailing list than labri.highlights(a)diff.u-bordeaux.fr, which is exclusively used for announcements of the Highlights of Logic, Games, and Automata conference (and collocated events).

4 Jahre, 6 Monate

Third CFP - RAMiCS 2020

von Michael Winter

THIRD CALL FOR PAPERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08. April to 11. April 2020, Palaiseau, France URL: http://ramics18.gforge.inria.fr/ IMPORTANT DATES: Abstract Submission: 06. October 2019 Paper Submission: 13. October 2019 Author Notification: 15. December 2019 Final Version: 16. January 2020 RAMiCS 2020: 08. April to 11. April 2020 INVITED TALKS: Christel Baier, Technische Universitaet Dresden, Germany Manfred Droste, Universitaet Leipzig, Germany Daniela Petrisan, Universite Paris Diderot, France 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. 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 WATA 2020 WATA 2020, the 10th International Workshop on Weighted Automata: Theory and Applications, will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage participants to combine the two events. SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2020 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: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane PPS, France Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Stef Joosten Open Universiteit, Netherlands Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh University College London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

4 Jahre, 7 Monate

LATA 2020: 2nd call for papers

von IRDTA

LATA 2020: 2nd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 Milan, Italy March 2-6, 2020 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://lata2020.irdta.eu ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. VENUE: LATA 2020 will take place in Milan, the third largest economy among European cities and one of the Four Motors for Europe. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Tero Harju (University of Turku, FI) Jeffrey Heinz (Stony Brook University, US) Lane A. Hemaspaandra (University of Rochester, US) Marcin Jurdziński (University of Warwick, UK) Juhani Karhumäki (University of Turku, FI) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) François Le Gall (Kyoto University, JP) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Tomáš Vojnar (Brno University of Technology, CZ) Mikhail Volkov (Ural Federal University, RU) James Worrell (University of Oxford, UK) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2020 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://lata2020.irdta.eu/registration DEADLINES (all at 23:59 CET): Paper submission: October 18, 2019 Notification of paper acceptance or rejection: November 25, 2019 Final version of the paper for the LNCS proceedings: December 2, 2019 Early registration: December 2, 2019 Late registration: February 17, 2020 Submission to the journal special issue: June 6, 2020 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

4 Jahre, 7 Monate

Post Doctoral position in Parameterized Complexity at TU Wien, Vienna, Austria

von Mihaela Rozman

There is an opening for a postdoc position at the Algorithms and Complexity group at TU Wien (Vienna University of Technology), Vienna, Austria. - The position is for two years with the possibility of an extension. - The position is research-only, but interested candidates have the opportunity get involved in teaching. - The employment is full-time (40 hrs/week) and the salary is internationally competitive (the yearly entry-level gross salary is approx. 53K for postdocs). - The working language at the university is English, knowledge of German is not required. REQUIREMENTS Required are a PhD degree in Computer Science or related area and excellent knowledge of algorithms and complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Some background in graph theory, combinatorics, satisfiability, computational logic, or constraint satisfaction is of advantage. APPLICATION -Applications must be made by September 27, 2019. -The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references. INFORMAL INQUIRES - Informal inquires by email (Stefan Szeider, <sz[AT]ac.tuwien.ac.at>) are welcome.

4 Jahre, 7 Monate

2024

2023

2022

2021

2020

2019

2018

finite-model-theory September 2019