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

Faculty positions at the University of Sydney

by Sasha Rubin

The School of Computer Science at the University of Sydney is searching for full-time faculty members at all ranks. Advert: https://tinyurl.com/y4djckaq Closing date: 11:30pm, Monday 30 November 2020 (Sydney Time) Although the advert mentions specific areas of interest, exceptional candidates in all areas are sought. Informal enquiries are welcome, and can be made to Sasha Rubin (sasha.rubin(a)sydney.edu.au<mailto:sasha.rubin@sydney.edu.au>)

3 years, 10 months

1
1
0 0

FSCD 2021: Call for Workshop Proposals

by Carsten Fuhs

-------------------------------------------------------------- Call for Workshop Proposals FSCD 2021 https://fscd2021.dc.uba.ar Buenos Aires, Argentina Main Conference: 19-22 July 2021 Workshops: 17-18 and 23-24 July 2021 -------------------------------------------------------------- FSCD 2021 will be the sixth edition of the International Conference on Formal Structures for Computation and Deduction. Due to the Covid 19 pandemic situation, the 2021 edition of FSCD and its satellite workshops will be held online. We invite proposals for workshops, tutorials or other satellite events, on any topic related to formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications. Satellite events will take place online on the 17-18 and 23-24 July, before and after the main conference (19-22 July). It is expected that satellite events would run for 1 or 2 days, and be open to participants of parallel events. PROPOSALS -------------------- Proposals must be limited to three pages and should be submitted via EasyChair https://easychair.org/conferences/?conf=fscd2021 (Workshops track) Each proposal should consist of the following two parts. 1) A description part including: - a short scientific justification of the proposed topic, Its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant); - a brief description (up to 120 words) of the event for the website and publicity material. 2) An organisational part including: - contact information for the workshop organisers; - name of the organiser in the role of FSCD Workshops Scheduling Committee member (*); - estimate of the number of workshop participants; - proposed format and agenda (e.g. paper presentations, tutorials, demo sessions, etc.) - potential invited speakers; - procedures for selecting papers and participants; - tentative schedule for paper submission and notification of acceptance; - plans for dissemination, if any (e.g. a journal special issue); - duration (which may vary from one day to two days); - preferred period (pre, or post main conference); - any other special requirements. (*) The FSCD Workshops Scheduling Committee will include one of the organisers of each accepted workshop and have the role to concoct a scientifically coherent program of all workshops mitigating superpositions of connected talks. This organisational effort will require that each workshop finalise their selection of talks and invited speakers within a common pertinent deadline to be defined so that possible overlaps can be minimised. Please, consider this when preparing the tentative schedule of your workshop proposal. The Organising Committee of FSCD will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs and availability of space and facilities. The organisers of satellite events are expected to create and maintain a website for the event; handle paper selection, reviewing and acceptance; draw up a tentative programme of talks; advertise their event though specialist mailing lists; prepare the informal pre-proceedings (if applicable) in a timely fashion; and arrange any post-proceedings. Some amount of financial support may be offered to workshops, depending on the number of participants. The FSCD Organising Committee will handle promotion of the event on the main conference website; integration of the event's programme into the overall timetable; registration of participants; arrangement of an appropriate virtual meeting room and technical support will be provided by the FSCD organising committee. IMPORTANT DATES -------------------- Submission of workshop proposals: 6 December, 2020 Notification of success of proposals: 20 December, 2020 -------------------- Best regards, Carlos Lopez Pombo, Mauricio Ayala-Rincon FSCD 2021 Workshop Chairs

3 years, 11 months

1
0
0 0

Call for Papers - ICALP 2021 - the 48th International Colloquium on Automata, Languages, and Programming

by Oana Andrei

================================== ICALP 2021 - First Call for Papers ================================== http://easyconferences.eu/icalp2021/ @ICALPconf<https://twitter.com/ICALPconf/> The 48th International Colloquium on Automata, Languages, and Programming (ICALP) will take place in Glasgow, Scotland, on 13-16 July 2021. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS)<https://eatcs.org>. As usual, ICALP will be preceded by a series of workshops, which will take place on 12 July 2021. COVID-19: We will monitor the global travel situation and consider whether the conference will be physical, virtual or hybrid. If there is a physical component, remote participation for both speakers and attendees will also be an option. =============== Important dates ======================= Submission deadline: Friday 12 February 2021, 23:59 AoE Notification: Wednesday 28 April 2021 Camera-ready deadline: Friday 7 May 2021 Deadlines are firm; late submissions will not be considered. =========================== Submissions and Proceedings =========================== ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Submission Guidelines --------------------- Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) and submitted via Easychair to the appropriate track of the conference. The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC. Best Paper Awards ----------------- As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Topics ====== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------- * Algorithmic and Complexity Aspects of Network Economics * Algorithmic Aspects of Networks and Networking * Algorithmic Aspects of Security and Privacy * Algorithms for Computational Biology * Algorithmic Game Theory and Mechanism Design * Approximation and Online Algorithms * Combinatorial Optimization * Combinatorics in Computer Science * Computational Complexity * Computational Geometry * Computational Learning Theory * Cryptography * Data Structures * Design and Analysis of Algorithms * Distributed and Mobile Computing * Foundations of Machine Learning * Graph Mining and Network Analysis * Parallel and External Memory Computing * Quantum Computing * Randomness in Computation * Theoretical Foundations of Algorithmic Fairness Track B: Automata, Logic, Semantics, and Theory of Programming ------------------------------------------------------------- * Algebraic and Categorical Models of Computation * Automata, Logic, and Games * Database Theory, Constraint Satisfaction Problems, and Finite Model Theory * Formal and Logical Aspects of Learning * Formal and Logical Aspects of Security and Privacy * Logic in Computer Science and Theorem Proving * Models of Computation: Complexity and Computability * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid, and Stochastic Systems * Principles and Semantics of Programming Languages * Program Analysis, Verification, and Synthesis * Type Systems and Typed Calculi =============================== ICALP 2021 Programme Committees =============================== Track A: Track A: Algorithms, Complexity and Games --------------------------------------------------- * Nikhil Bansal<https://www.win.tue.nl/~nikhil/> (CWI Amsterdam, Netherlands), Chair * Yossi Azar (Tel Aviv University, Israel) * Luca Becchetti (Sapienza University of Rome, Italy) * Aleksander Belov (University of Latvia, Latvia) * Eric Blais (University of Waterloo, Canada) * Niv Buchbinder (Tel Aviv University, Israel) * Kevin Buchin (TU Eindhoven, Netherlands) * Parinya Chalermsook (Aalto University, Finland) * Vincent Cohen-Addad (Google Research, Switzerland) * Shahar Dobzinski (Weizmann Institute, Israel) * Ran Duan (Tsinghua University, China) * Vida Dujmovic (University of Ottawa, Canada) * Yuval Filmus (Technion, Israel) * Samuel Fiorini (Université libre de Bruxelles, Belgium) * Andreas Galanis (University of Oxford, UK) * Mika Göös (EPFL, Switzerland) * Inge Li Gørtz (TU Denmark, Denmark) * Heng Guo (University of Edinburgh, UK) * Prahladh Harsha (TIFR, Mumbai, India) * Sungjin Im (UC Merced, USA) * Stacey Jeffery (CWI Amsterdam, Netherlands) * Iordanis Kerenidis (CNRS - Université Paris Diderot, France) * Michael Kapralov (EPFL, Switzerland) * Ravi Kumar (Google Research, USA) * Stefan Kratsch (HU Berlin, Germany) * Silvio Lattanzi (Google Research, Switzerland) * Shi Li (SUNY Buffalo, USA) * Konstantin Makarychev (Northwestern University, USA) * Marcin Mucha (University of Warsaw, Poland) * Wolfgang Mulzer (FU Berlin, Germany) * Jesper Nederlof (Utrecht University, Netherlands) * Aleksandar Nikolov (University of Toronto, Canada) * Neil Olver (LSE, UK) * Rasmus Pagh (IT University of Copenhagen, Denmark) * Merav Parter (Weizmann Institute, Israel) * Alexandros Psomas (Purdue University, USA) * Barna Saha (UC Berkeley, USA) * Thatchaphol Saranurak (University of Michigan, USA) * Rahul Savani (University of Liverpool, UK) * Mohit Singh (Georgia Tech, USA) * Sahil Singla (IAS/Princeton, USA) * Noah Stephens-Davidowitz (Cornell University, USA) * László Végh (LSE, UK) * Meirav Zehavi (Ben-Gurion University, Israel) Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------------------------------------- * James Worrell<http://www.cs.ox.ac.uk/people/james.worrell/home.html> (University of Oxford, UK), Chair * Parosh Aziz Abdulla (Uppsala University, Sweden) * S. Akshay (Indian Institute of Technology Bombay, India) * Nathalie Bertrand (Inria Rennes, France) * Michael Blondin (Université de Sherbrooke, Canada) * Olivier Carton (IRIF, Université de Paris, France) * Corina Cîrstea (University of Southampton, UK) * Dana Fisman (Ben Gurion University, Israel) * Paul Gastin (LSV, ENS Paris-Saclay, France) * Stefan Göller (University of Kassel, Germany) * Radha Jagadeesan (DePaul University Chicago, USA) * Bakhadyr Khoussainov (University of Auckland, New Zealand) * Emanuel Kieroński (Wrocław University, Poland) * Bartek Klin (Warsaw University, Poland) * Barbara König (University of Duisburg-Essen, Germany) * Laura Kovacs (Vienna University of Technology, Austria) * Ugo Dal Lago (University of Bologna and Inria, Italy) * Christoph Löding (RWTH Aachen University, Germany) * Madhavan Mukund (Chennai Mathematical Institute, India) * Sebastian Maneth (University of Bremen, Germany) * Richard Mayr (University of Edinburgh, UK) * Annabelle McIver (Macquarie University, Australia) * Sophie Pinchinat (IRISA, Université de Rennes, France) * Cristian Riveros (Pontificia Universidad Católica de Chile, Chile) * Davide Sangiorgi (University of Bologna and Inria, Italy) * Lijun Zhang (Institute of Software, Chinese Academy of Sciences, China) =============================== ICALP 2021 Organizing Committee =============================== [the FATA<https://www.gla.ac.uk/schools/computing/research/researchsections/fata-sect…> research section, School of Computing Science,<https://www.gla.ac.uk/schools/computing/> University of Glasgow<https://www.gla.ac.uk>] Simon Gay<http://www.dcs.gla.ac.uk/~simon/>, Conference Chair Oana Andrei<http://www.dcs.gla.ac.uk/~oandrei/> Ornela Dardha<http://www.dcs.gla.ac.uk/~ornela/> Jessica Enright<https://www.gla.ac.uk/schools/computing/staff/jessicaenright/> David Manlove<http://www.dcs.gla.ac.uk/~davidm/> Kitty Meeks<http://www.dcs.gla.ac.uk/~kitty/> Alice Miller<http://www.dcs.gla.ac.uk/~alice/> Gethin Norman<http://www.dcs.gla.ac.uk/~gethin/> Sofiat Olaosebikan<http://www.dcs.gla.ac.uk/~sofiat/> Michele Sevegnani<http://www.dcs.gla.ac.uk/~michele/> — Dr Oana Andrei Lecturer (Assistant Professor) | School of Computing Science University of Glasgow, UK http://www.dcs.gla.ac.uk/~oandrei | @OanaMAndrei<https://twitter.com/OanaMAndrei> Note: If I send email out of hours, I'm not expecting a reply out of hours.

3 years, 11 months

1
0
0 0

ICALP 2021 Call for Workshops

by Ornela Dardha

================================== ICALP 2021 Call for Workshops ================================== *** We are closely monitoring the development of the COVID-19 pandemic. If it is not viable to hold ICALP 2021 as a physical conference, we will run it virtually on the same dates. We will decide in January 2021 at the latest. If ICALP 2021 can go ahead as a physical conference, accepted authors may still present remotely. *** ICALP 2021 (http://easyconferences.eu/icalp2021/ <http://easyconferences.eu/icalp2021/>) will take place on the 13th - 16th of July 2021 in Glasgow, United Kingdom. The conference will be preceded by one day of workshops, held on July 12th. We invite proposals for workshops affiliated with ICALP 2021 on all topics covered by ICALP, as well as other areas of theoretical computer science. Proposals should be submitted no later than *** November 30th, 2020 *** by sending an email to the workshop selection committee (details at the end of the call). You should expect notification on the acceptance of your proposal by mid December 2020. A workshop proposal submission should consist of: - workshop's name and URL (if already available) - workshop's organisers together with their email addresses and web pages; - short description of the area covered by the workshop and the motivation behind it; - expected number of participants (if available, please include the data of previous years); - planned format of the event; - date preference (July 10th or 11th). As for the format, a standard option is a full one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organisers or selected among submissions. Deviations from this standard are also warmly welcome, including a shorter or a longer time span than a full day, or other elements of the schedule like open problem sessions, discussion panels, or working sessions. If you plan to have invited speakers, please specify their expected number and, if possible, tentative names. If you plan a call for papers or for contributed talks followed by a selection procedure, the submission date should be scheduled after ICALP 2021 notification (April 28, 2021), while the notification should take place before the early registration deadline. In your submission please include details on the schedule, planned procedure of selecting papers and/or contributed talks. If you plan to have published proceedings of your workshop, please provide the name of the publisher. Please be advised that ICALP 2021 is not able to provide any financial support for publishing workshop proceedings. Important dates: Workshop Proposals Deadline: Monday November 30, 2020 Workshop Notification: Monday December 14, 2020 Workshops: Monday July 12, 2021 Conference: Tuesday July 13 - Friday July 16, 2021 Workshop selection committee: Ornela Dardha ornela.dardha(a)glasgow.ac.uk <mailto:ornela.dardha@glasgow.ac.uk> Gethin Norman gethin.norman(a)glasgow.ac.uk <mailto:gethin.norman@glasgow.ac.uk>

3 years, 11 months

1
0
0 0

ICALP 2021 Call for Papers

by Simon Gay

================================== ICALP 2021 - First Call for Papers ================================== http://easyconferences.eu/icalp2021/ The 48th International Colloquium on Automata, Languages, and Programming (ICALP) will take place in Glasgow, Scotland, on 13-16 July 2021. 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 12 July 2021. COVID-19: We will monitor the global travel situation and consider whether the conference will be physical, virtual or hybrid. If there is a physical component, remote participation for both speakers and attendees will also be an option. =============== Important dates ======================= Submission deadline: Friday 12 February 2021, 23:59 AoE Notification: Wednesday 28 April 2021 Camera-ready deadline: Friday 7 May 2021 Deadlines are firm; late submissions will not be considered. =========================== Submissions and Proceedings =========================== ICALP proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. This is a series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge. Submission Guidelines --------------------- Authors are invited to submit an extended abstract of no more than 12 pages, excluding references presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) and submitted via Easychair to the appropriate track of the conference. The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC. Best Paper Awards ----------------- As in previous editions of ICALP, there will be best paper and best student paper awards for each track of the conference. In order to be eligible for a best student paper award, a paper should be authored only by students and should be marked as such upon submission. Topics ====== Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A: Algorithms, Complexity and Games ----------------------------------------- * Algorithmic and Complexity Aspects of Network Economics * Algorithmic Aspects of Networks and Networking * Algorithmic Aspects of Security and Privacy * Algorithms for Computational Biology * Algorithmic Game Theory and Mechanism Design * Approximation and Online Algorithms * Combinatorial Optimization * Combinatorics in Computer Science * Computational Complexity * Computational Geometry * Computational Learning Theory * Cryptography * Data Structures * Design and Analysis of Algorithms * Distributed and Mobile Computing * Foundations of Machine Learning * Graph Mining and Network Analysis * Parallel and External Memory Computing * Quantum Computing * Randomness in Computation * Theoretical Foundations of Algorithmic Fairness Track B: Automata, Logic, Semantics, and Theory of Programming ------------------------------------------------------------- * Algebraic and Categorical Models of Computation * Automata, Logic, and Games * Database Theory, Constraint Satisfaction Problems, and Finite Model Theory * Formal and Logical Aspects of Learning * Formal and Logical Aspects of Security and Privacy * Logic in Computer Science and Theorem Proving * Models of Computation: Complexity and Computability * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid, and Stochastic Systems * Principles and Semantics of Programming Languages * Program Analysis, Verification, and Synthesis * Type Systems and Typed Calculi =============================== ICALP 2021 Programme Committees =============================== Track A: Track A: Algorithms, Complexity and Games --------------------------------------------------- * Nikhil Bansal (CWI Amsterdam, Netherlands), Chair * Yossi Azar (Tel Aviv University, Israel) * Luca Becchetti (Sapienza University of Rome, Italy) * Aleksander Belov (University of Latvia, Latvia) * Eric Blais (University of Waterloo, Canada) * Niv Buchbinder (Tel Aviv University, Israel) * Kevin Buchin (TU Eindhoven, Netherlands) * Parinya Chalermsook (Aalto University, Finland) * Vincent Cohen-Addad (Google Research, Switzerland) * Shahar Dobzinski (Weizmann Institute, Israel) * Ran Duan (Tsinghua University, China) * Vida Dujmovic (University of Ottawa, Canada) * Yuval Filmus (Technion, Israel) * Samuel Fiorini (Université libre de Bruxelles, Belgium) * Andreas Galanis (University of Oxford, UK) * Mika Göös (EPFL, Switzerland) * Inge Li Gørtz (TU Denmark, Denmark) * Heng Guo (University of Edinburgh, UK) * Prahladh Harsha (TIFR, Mumbai, India) * Sungjin Im (UC Merced, USA) * Stacey Jeffery (CWI Amsterdam, Netherlands) * Iordanis Kerenidis (CNRS - Université Paris Diderot, France) * Michael Kapralov (EPFL, Switzerland) * Ravi Kumar (Google Research, USA) * Stefan Kratsch (HU Berlin, Germany) * Silvio Lattanzi (Google Research, Switzerland) * Shi Li (SUNY Buffalo, USA) * Konstantin Makarychev (Northwestern University, USA) * Marcin Mucha (University of Warsaw, Poland) * Wolfgang Mulzer (FU Berlin, Germany) * Jesper Nederlof (Utrecht University, Netherlands) * Aleksandar Nikolov (University of Toronto, Canada) * Neil Olver (LSE, UK) * Rasmus Pagh (IT University of Copenhagen, Denmark) * Merav Parter (Weizmann Institute, Israel) * Alexandros Psomas (Purdue University, USA) * Barna Saha (UC Berkeley, USA) * Thatchaphol Saranurak (University of Michigan, USA) * Rahul Savani (University of Liverpool, UK) * Mohit Singh (Georgia Tech, USA) * Sahil Singla (IAS/Princeton, USA) * Noah Stephens-Davidowitz (Cornell University, USA) * László Végh (LSE, UK) * Meirav Zehavi (Ben-Gurion University, Israel) Track B: Automata, Logic, Semantics, and Theory of Programming --------------------------------------------------------------- * James Worrell (University of Oxford, UK), Chair * Parosh Aziz Abdulla (Uppsala University, Sweden) * S. Akshay (Indian Institute of Technology Bombay, India) * Nathalie Bertrand (Inria Rennes, France) * Michael Blondin (Université de Sherbrooke, Canada) * Olivier Carton (IRIF, Université de Paris, France) * Corina Cîrstea (University of Southampton, UK) * Dana Fisman (Ben Gurion University, Israel) * Paul Gastin (LSV, ENS Paris-Saclay, France) * Stefan Göller (University of Kassel, Germany) * Radha Jagadeesan (DePaul University Chicago, USA) * Bakhadyr Khoussainov (University of Auckland, New Zealand) * Emanuel Kieroński (Wrocław University, Poland) * Bartek Klin (Warsaw University, Poland) * Barbara König (University of Duisburg-Essen, Germany) * Laura Kovacs (Vienna University of Technology, Austria) * Ugo Dal Lago (University of Bologna and Inria, Italy) * Christoph Löding (RWTH Aachen University, Germany) * Madhavan Mukund (Chennai Mathematical Institute, India) * Sebastian Maneth (University of Bremen, Germany) * Richard Mayr (University of Edinburgh, UK) * Annabelle McIver (Macquarie University, Australia) * Sophie Pinchinat (IRISA, Université de Rennes, France) * Cristian Riveros (Pontificia Universidad Católica de Chile, Chile) * Davide Sangiorgi (University of Bologna and Inria, Italy) * Lijun Zhang (Institute of Software, Chinese Academy of Sciences, China) =============================== ICALP 2021 Organizing Committee =============================== Simon Gay, Conference Chair Oana Andrei Ornela Dardha Jessica Enright David Manlove Kitty Meeks Alice Miller Gethin Norman Sofiat Olaosebikan Michele Sevegnani

3 years, 11 months

1
0
0 0

LICS 2021 Call for Papers

by Sam Staton

CALL FOR PAPERS Thirty-Sixth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) June / July 2021 (Rome) Co-located with ITP 2021 and ICTCS 2021 http://easyconferences.eu/lics2021/cfp/ SCOPE The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. COVID-19 The organizers are carefully monitoring the development of the COVID-19 pandemic, and take guidance from the health authorities, to determine whether LICS 2021 will be held physically, virtually or in a hybrid manner. IMPORTANT DATES Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE). Titles and Short Abstracts Due: 20 January 2021 Full Papers Due: 25 January 2021 Author Feedback/Rebuttal Period: 10-14 March 2021 Author Notification: 31 March 2021 Workshops: 27 June -- 28 June 2021 Conference: 29 June -- 2 July 2021 (tentative) Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://easychair.org/conferences/?conf=lics2021. SUBMISSION INSTRUCTIONS Every paper must be submitted in the IEEE Proceedings 2-column 10pt format (IEEEtran.cls V1.8b) and may be at most 12 pages, excluding references. Paper selection will be merit-based, with no a priori limit on the number of accepted papers. Papers authored or co-authored by members of the program committee are not allowed. Please see the website for further formatting and submission instructions. LICS 2021 will use a lightweight double-blind reviewing process. Following this process means that reviewers will not see the authors’ names or affiliations as they initially review a paper. The authors’ names will then be revealed to the reviewers only once their reviews have been submitted. Please see the website for further details and requirements from the double-blind process. LICS DISTINGUISHED PAPERS (NEW) Starting 2021, around 10% of accepted LICS papers will be selected as distinguished papers. These are papers that, in the view of the LICS program committee, make exceptionally strong contribution to the field and should be read by a broad audience due their relevance, originality, significance and clarity. KLEENE AWARD FOR BEST STUDENT PAPER An award in honour of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. SPECIAL ISSUES Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science. PUBLICATION The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course.

3 years, 11 months

1
0
0 0

LICS 2021 Call for Workshops

by Sam Staton

36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2021) Call for Workshop Proposals http://easyconferences.eu/lics2021/ * The thirty-sixth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'21) will be held in Rome, Italy, on June 29-July 2, 2021. The workshops will take place on June 27-28, 2021. * Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. * Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Expected number of participants, providing data on previous years if the workshop has already been organised in the past. - Procedures for selecting participants and papers. - Potential invited speakers. - A discussion of the proposed format, whether it should be a physical meeting only, a virtual meeting only, or a combination thereof, and whether you need special equipments or technologies. - An agenda. - Plans for dissemination (for example, special issues of journals). Proposals should be sent to Frédéric Blanqui: frederic.blanqui(a)inria.fr * IMPORTANT DATES: - Submission deadline: December 6, 2020 - Notification: December 18, 2020 - Program of the workshops ready: May 27, 2021 - Workshops: June 27-28, 2021 - LICS conference: June 29-July 2, 2021 * The workshops selection committee consists of the LICS Workshops Chair, the LICS General Chair, the LICS PC Chairs and the LICS Conference Chairs. * COVID-19: the organisers are watching the evolution of the pandemic very closely and will make a decision later on whether or not the meeting can be held in-person in Rome or not.

3 years, 11 months

1
0
0 0

LATA 2020 & 2021: extended submission deadline October 26

by IRDTA

LATA 2020 & 2021: extended submission deadline October 26*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/ ******************************************************************************* * Extended submission deadline: October 26 * 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 26, 2020 – EXTENDED - 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 years, 12 months

1
0
0 0

CfP: Natural Language Processing in Artificial Intelligence - NLPinAI 2021 Online 4-6 February, 2021

by Roussanka Loukanova

CALL FOR PAPERS Natural Language Processing in Artificial Intelligence - NLPinAI 2021 Online Streaming 4-6 February, 2021 http://www.icaart.org/NLPinAI.aspx?y=2021 Special Session within the 13th International Conference on Agents and Artificial Intelligence - ICAART 2021 http://www.icaart.org ------------------------------------------------------------- SCOPE Computational and technological developments that incorporate natural language are proliferating. Adequate coverage encounters difficult problems related to partiality, underspecification, and context-dependency, which are signature features of information in nature and natural languages. Furthermore, agents (humans or computational systems) are information conveyors, interpreters, or participate as components of informational content. Generally, language processing depends on agents' knowledge, reasoning, perspectives, and interactions. The session covers theoretical work, applications, approaches, and techniques for computational models of information and its presentation by language (artificial, human, or natural in other ways). The goal is to promote computational systems of intelligent natural language processing and related models of thought, mental states, reasoning, and other cognitive processes. TOPICS We invite contributions relevant to the following topics, without being limited to them: - Type theories for applications to language and information processing - Computational grammar - Computational syntax - Computational semantics of natural languages - Computational syntax-semantics interface - Interfaces between morphology, lexicon, syntax, semantics, speech, text, pragmatics - Parsing - Multilingual processing - Large-scale grammars of natural languages - Interfaces between morphology, lexicon, syntax, semantics, speech, text, pragmatics - Models of computation and algorithms for natural language processing - Computational models of partiality, underspecification, and context-dependency - Models of situations, contexts, and agents, for applications to language processing - Information about space and time in language models and processing - Models of computation and algorithms for linguistics - Data science in language processing - Machine learning of language - Interdisciplinary methods - Integration of formal, computational, model theoretic, graphical, diagrammatic, statistical, and other related methods - Logic for information extraction or expression in written and spoken language - Language processing based on biological fundamentals of information and languages - Computational neuroscience of language IMPORTANT DATES Paper Submission: November 26, 2020 Authors Notification: December 14, 2020 Camera Ready and Registration: December 22, 2020 PAPER SUBMISSION Prospective authors are invited to submit papers in any of the topics listed above. Instructions for preparing the manuscript (in LaTeX and Word styles) are available on the ICAART pages. Paper Templates: http://www.icaart.org/Templates.aspx Guidelines: http://www.icaart.org/Guidelines.aspx Papers must be submitted electronically via the web-based submission system using the button SUBMIT PAPER on the pages of NLPinAI 2021 at ICAART 2021. PUBLICATIONS After thorough reviewing by the special session program committee, all accepted papers will be published in a special section of the conference proceedings book - under an ISBN reference and on digital support - and submitted for indexation by Thomson Reuters Conference Proceedings Citation Index (CPCI/ISI), DBLP, EI (Elsevier Engineering Village Index), Scopus, Semantic Scholar and Google Scholar. SCITEPRESS is a member of CrossRef (http://www.crossref.org/) and every paper is given a DOI (Digital Object Identifier). All papers presented at the conference venue will be available at the SCITEPRESS Digital Library We expect a post-conference, post-proceedings Special Issue with extended publications based on selected papers presented at NLPinAI 2021, ICAART 2021. A book of selected works based on NLPinAI 2020 at ICAART 2020 is on its way to appear: Natural Language Processing in Artificial Intelligence - NLPinAI 2020. Book series: Studies in Computational Intelligence (SCI). CHAIR: Roussanka Loukanova CONTACT: Roussanka Loukanova (rloukanova by gmail)

3 years, 12 months

1
0
0 0

Computability in Europe 2021 CALL FOR PAPERS

by acie＠acie.eu

(Apologies for multiple postings.) ========================= FIRST CALL FOR PAPERS: ========================= CiE 2021: Connecting with computability 5 - 9 July 2021 website: www.CiE2021.ugent.be [1] **Due to the current pandemic CiE 2021 will be held as a virtual conference.** CiE 2021 is the seventeenth conference organized by the Association Computability in Europe. The /Computability in Europe/ conference (CiE) series has built up a strong tradition for developing a scientific program which is interdisciplinary at its core bringing together all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in CS and other disciplines such as biology, mathematics, history, philosophy, and physics. For more information about the CiE conferences and the Association CiE, please have a look at: https://www.acie.eu/ [2]. CiE 2021 will be the second CiE conference that is organized as a virtual event and aims at a high-quality meeting that allows and invites active participation from all participants. It will be hosted virtually by Ghent University. 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) and virtually in Salerno (2020) PLENARY SPEAKERS ========================= * Laura Crosilla (University of Oslo, Norway) * Markus Lohrey (Universität Siegen. Germany) * Russell Miller (tutorial speaker, CUNY, US) * Joan Rand Moschovakis (UCLA, US) * Joël Ouaknine (Max Planck Institute for software systems, Germany) * Christine Tasson (tutorial speaker, Université Paris Diderot, France) * Keita Yokoyama (Japan Advanced Institute of Science and Technology, Japan) * Henry Yuen (University of Toronto, Canada) SPECIAL SESSIONS ========================= _/Classical Computability theory: Open problems and solutions/_ Noam Greenberg (Victoria University of Wellington, New Zealand) and Steffen Lempp (University of Wisconsin) _/Proof theory and computation/_ David Fernández Duque (Ghent University, Belgium) and Juan Pablo Aguilera (Ghent University, Belgium) _/Quantum computation and information/_ Harry Buhrman (Universiteit van Amsterdam, Netherlands) and Frank Verstraete (Ghent University, Belgium) /Church's thesis in constructive mathematics (HaPoC session)/ Marianna Antonutti-Marfori (Ludwig-Maximilians-Universität München, Germany) and Alberto Naibo (Université Paris 1 Panthéon-Sorbonne) _/Computational geometry/_ Maike Buchin (Ruhr-Universität Bochum, Germany) and Maarten Löffler (Utrecht University, Netherlands) /Computational Pangenomics/ Nadia Pisanti (University of Pisa, Italy) and Solon Pissis (University of Amsterdam, Netherlands) WOMEN IN COMPUTABILITY ========================= The Computability in Europe conference series has a long tradition in setting up a Women in Computability program. For CiE 2021 we plan a Women in Computability workshop combined with an online mentoring program. For more details on the Special Interest Group Women in Computability, see: https://www.acie.eu/cie-conference-series/cie-cs-women-in-computability/ [3] IMPORTANT DATES: ========================= Deadline for article registration (abstract submission): January 17, 2021 Deadline for article submission: February 5, 2021 Notification of acceptance: April 13, 2021 Final versions due: April 27, 2021 Deadline for informal presentations submission: May 1, 2021 The notifications of acceptance for informal presentations will be sent a few days after submission. ORGANIZED BY: ========================= Department of Mathematics WE16, Ghent University Organizing Committee: Juan Pablo Aguilera (Ghent University) David Bélanger (Ghent University) Liesbeth De Mol (CNRS, Université de Lille) David Fernández-Duque (chair, Ghent University) Fedor Pakhomov (Ghent University) Frederik Van De Putte (Ghent University) Andreas Weiermann (Ghent University) CONTRIBUTED PAPERS: ========================= The Programme Committee cordially invites all researchers (European and non-European) to submit their papers in computability related areas for presentation at the conference and inclusion in the proceedings. Papers building bridges between different parts of the research community are particularly welcome. Papers should be in English and anonymized. They must be submitted in PDF format, using the LNCS style (available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip [4]) and should have a maximum of 10 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Authors should submit their papers electronically using EasyChair: https://easychair.org/conferences/?conf=cie2021 Abstracts should be submitted by January 17th 2021, followed by the full papers to be submitted by February 5 2021. Each submitted paper will be peer-reviewed by a panel of PC members based on originality, significance, technical soundness, clarity of exposition, and relevance for the conference. For each accepted paper, at least one author is required to register for the conference and should plan to present the paper. The CONFERENCE PROCEEDINGS will be published with LNCS, Springer Verlag. INFORMAL PRESENTATIONS: ========================= Continuing the tradition of past CiE conferences, in addition to the formal presentations based on the LNCS proceedings volume, CiE 2021 will host a track of informal presentations, that are prepared very shortly before the conference and inform the participants about current research and work in progress. The deadline for the submission of abstracts for informal presentations is May 1st, 2021. PROGRAMME COMMITTEE ========================= Marianna Antonutti Marfori (Ludwig Maximilian University of Munich) Nathalie Aubrun (CNRS, Université Paris-Saclay) Christel Baier (TU Dresden) Nikolay Bazhenov (Sobolev Institute of Mathematics) Marie-Pierre Béal (Université Paris-Est) Arnold Beckmann (Swansea University) David Bélanger (Ghent University) Joel Day (Loughborough University) Liesbeth De Mol (CNRS, Université de Lille, PC co-chair) Carola Doerr (Sorbonne University, CNRS) Jérôme Durand-Lose (Université d'Orléans) David Fernández-Duque (Ghent University) Zuzana Haniková (Academy of Sciences of the Czech Republic) Mathieu Hoyrup (LORIA) Assia Mahboubi (INRIA) Florin Manea (University of Göttingen) Irène Marcovici (Université de Lorraine) Klaus Meer (BTU Cottbus-Senftenberg) Ludovic Patey (Institut Camille Jordan) Cinzia Pizzi (University of Padova) Giuseppe Primiero (University of Milan) Simona Ronchi Della Rocca (Università di Torino) Paul Schafer (University of Leeds) Svetlana Selivanova (KAIST) Monika Seisenberger (Swansea University) Alexander Shen (CNRS & Univ. Montpellier 2) Alexandra Soskova (Sofia University) Mariya Soskova (University of Wisconsin-Madison) Frank Stephan (National University of Singapore) Peter Van Emde Boas (Universiteit van Amsterdam) Sergey Verlan (Université Paris Est - Créteil Val de Marne) Andreas Weiermann (Ghent University, PC co-chair) Damien Woods (Maynooth University) Links: ------ [1] http://www.cie2021.ugent.be/ [2] https://www.acie.eu/ [3] https://www.acie.eu/cie-conference-series/cie-cs-women-in-computability/ [4] ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip

3 years, 12 months

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory October 2020