finite-model-theory September 2020

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

2 Teilnehmer
2 Diskussionen

Open positions for PhD students at RWTH Aachen

von Grädel, Erich

====================================================================== Various Open Positions for Research Assistants/Associates in the post-graduate program UnRAVeL “Uncertainty and Randomness in Algorithms, Verification and Logic” at RWTH Aachen University, Aachen, Germany https://www.unravel.rwth-aachen.de/ ====================================================================== Context. The RWTH Aachen University is looking for enthusiastic and highly qualified doctoral researchers. Various positions are available within the interdisciplinary Research Training Group (RTG) UnRAVeL founded by Deutsche Forschungsgemeinschaft (DFG). The key emphasis of an RTG is on the qualification of doctoral researchers with a focused research program and a structured training strategy. The RTG UnRAVeL aims to significantly advance probabilistic modelling and analysis for uncertainty by developing new theories, algorithms, and tool-supported verification techniques, and to apply them to core problems from security (e.g., probabilistic protocols), planning (robotics and railway engineering), and safety and performance analysis (railway systems). To tackle these research challenges, theoretical computer scientists from computer-aided verification, automata, logic and games, algorithms and complexity, together with experts from management science (robust optimization), applied computer science (robotics and security), and railway engineering intensively cooperate within the RTG UnRAVeL. Required profile. Candidates must have (or soon obtain) a master degree in Computer Science, Mathematics or related area and have completed their studies with excellent grades. You should have interest in performing original, highly competitive scientific research, publishing your results in top conferences and scientific journals. Self-motivation and the ability to work both independently and as a team player in local and international research groups are expected. Fluency in English is required; proficiency in German is helpful but not compulsory. How to apply? Your written application should contain: - a curriculum vitae - a transcript of records (list of courses and grades) - a cover letter including a statement of interest in (some of) the RTG topics (Algorithms and Complexity, Verification, Logic, or Application Scenarios) that can be found on our web-site, and - a recommendation letter e.g., by your master thesis supervisor(s). All documents should be formatted as a single pdf-file. You should send your application ultimately by ** October 30, 2020 (AoE) ** to the e-mail address: unravel-appl(a)cs.rwth-aachen.de<mailto:unravel-appl@cs.rwth-aachen.de>. We check applications once they are received, and will conduct interview until our vacancies are filled. What do we offer? We offer a stimulating international research environment, the possibility to participate in highly competitive and interdisciplinary research and the opportunity to involve students in your research through project work. Doctoral researchers have a status as employee with a salary according to the German federal employee scale TV-L E13; the exact salary is subject to your family situation. The duration of the positions is three years. RWTH Aachen University offers excellent facilities for professional and personal development. Starting date of the positions: January 1, 2021 and June 1, 2021. Enquiries can be directed to Prof. Joost-Pieter Katoen (e-mail: katoen(a)cs.rwth-aachen.de<mailto:katoen@cs.rwth-aachen.de>). RWTH Aachen University is certified as a “Family-Friendly University”. We particularly welcome and encourage applications from women, disabled persons and ethnic minority groups, recognizing they are underrepresented across RWTH Aachen University. The principles of fair and open competition apply and appointments will be made on merit.

3 Jahre, 7 Monate

LATA 2020 & 2021: 2nd call for papers

von IRDTA

LATA 2020 & 2021: 2nd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ******************************************************************************* 14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ******************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 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. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan 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 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata 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) Marie-Pierre Béal (University of Paris-Est, FR) 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) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) 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) Mikhail Volkov (Ural Federal University, RU) 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. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 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 Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) 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://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 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

3 Jahre, 7 Monate

2024

2023

2022

2021

2020

2019

2018

finite-model-theory September 2020