November 2019 - finite-model-theory

by Anuj Dawar

The Gödel Prize 2020 - Call for Nominations Deadline: February 15, 2020 The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery, Special Interest Group on Algorithms and Computation Theory (ACM SIGACT). The award is presented annually, with the presentation taking place alternately at the International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The 28th Gödel Prize will be awarded at the 47th International Colloquium on Automata, Languages, and Programming to be held during 8-12 July, 2020 in Beijing. The Prize is named in honour of Kurt Gödel in recognition of his major contributions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous “P versus NP” question. The Prize includes an award of USD 5,000. Award Committee: The 2020 Award Committee consists of Samson Abramsky (University of Oxford), Anuj Dawar (Chair, University of Cambridge), Joan Feigenbaum (Yale University), Robert Krauthgamer (Weizmann Institute), Daniel Spielman (Yale University) and David Zuckerman (University of Texas, Austin). Nominations: Nominations for the award should be submitted by email to the Award Committee Chair: anuj.dawar(a)cl.cam.ac.uk. Please make sure that the Subject line of all nominations and related messages begin with “Goedel Prize 2020.” To be considered, nominations for the 2020 Prize must be received by February 15, 2020. Those intending to submit a nomination should contact the Award Committee chair by email well in advance to discuss it. For full details on eligibility and requirements, please see http://eatcs.org/index.php/goedel-prize http://www.sigact.org/prizes/gödel.html or contact the Award Committee chair, Anuj Dawar <anuj.dawar(a)cl.cam.ac.uk> -- Anuj.Dawar(a)cl.cam.ac.uk Professor of Logic and Algorithms Department of Computer Science and Technology University of Cambridge Phone: +44 1223 334408 15 J.J. Thomson Avenue Fax: +44 1223 334678 Cambridge CB3 0FD, UK. http://www.cl.cam.ac.uk/users/ad260

4 years, 10 months

1
0
0 0

ICALP-LICS 2020 Second Call for Workshops

by Sam Staton

ICALP 2020 (http://econcs.pku.edu.cn/icalp2020/) and LICS 2020 (https://lics.siglog.org/lics20/) will take place in co-location from 8th till 12th of July 2020 in Beijing, China. The conferences will be preceded by two days of joint workshops, held on July 6th and 7th. We invite proposals of workshops affiliated with ICALP-LICS 2020 on all topics covered by ICALP and LICS, as well as other areas of theoretical computer science. Proposals should be submitted no later than *** November 30th, 2019 *** by sending an email to frederic.blanqui(a)inria.fr. Due to limited space of the venue we might not be able to accommodate all the proposed workshops. You should expect notification on the acceptance of your proposal by mid December 2019. A workshop proposal submission should consist of: - workshop's name and URL (if already available) - workshop's organizers 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 6th or 7th). As for the format, a standard option is a one-day workshop consisting of invited talks by leading experts and of shorter contributed talks, either directly invited by the organizers 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 2020 and LICS 2020 notification, while the notification should take place considerably before the early registration deadline. In your submission please include details, in particular the time schedule, of the 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-LICS 2020 is not able to provide any financial support for publishing workshop proceedings. We expect the workshops to be financially independent. The expenses related to the participation of invited speakers, production of workshop materials, etc. should be covered from independent sources. On top of standard ICALP/LICS registration fee there will be a moderate registration fee for the workshops that will cover coffee breaks. This workshop fee will be waived for maximum two invited speakers for each workshop. Workshop selection committee: Frédéric Blanqui Naoki Kobayashi Yuqin Kong Michał Pilipczuk Zhilin Wu Lijun Zhang

4 years, 10 months

1
0
0 0

TTCS 2020 - Call for papers

by Renato Neves

The Third IFIP International Conference on Topics in Theoretical Computer Science (TTCS 2020) http://cs.ipm.ac.ir/ttcs/2020 Institute for Research in Fundamental Sciences (IPM) Tehran, Iran, July 1-3, 2020 *** Submission Deadline: January 12, 2020 *** ================================================== ------------------------------ Scope ------------------------------ TTCS is a bi-annual conference series, intending to serve as a forum for novel and high-quality research in all areas of Theoretical Computer Science. The conference is held in cooperation with the European Association for Theoretical Computer Science (EATCS). The proceedings will be published in the Springer LNCS series. TTCS is organized in 2 tracks. Topics of interest include but are not limited to: Track A: Algorithms and Complexity - algorithms and data structures, - algorithmic coding theory, - algorithmic graph theory and combinatorics, - approximation algorithms, - computational complexity, - computational geometry, - computational learning theory, - economics and algorithmic game theory, - fixed-parameter algorithms, - machine learning, - optimization, - parallel and distributed algorithms, - quantum computing, - randomness in computing, - theoretical cryptography. Track B: Logic, Semantics, and Programming Theory - algebra and coalgebra in computer science, - concurrency theory, - coordination languages, - formal verification and model-based testing, - logic in computer science, - methods, models of computation and reasoning for embedded, hybrid, and cyber-physical systems, - stochastic and probabilistic specification and reasoning, - theoretical aspects of other CS-related research areas, e.g. computational science, databases, information retrieval, and networking, - theory of programming languages, - type theory. ------------------------------ Important Dates ------------------------------ - Full Paper Submission: January 12, 2020 - Author notification: March 12, 2020 - Camera-ready paper: April 1, 2020 - Conference: July 1-3, 2020 ------------------------------ Submissions ------------------------------ Research papers are solicited in all areas of theoretical computer science. All papers will undergo a rigorous review process and will be judged based on their originality, soundness, significance of the results, and relevance to the theme of the conference. Papers should be written in English. Research papers should not exceed 15 pages in the LNCS style format. All technical details necessary for a proper evaluation of a submission must be included in the submission or in a clearly-labeled appendix, to be consulted at the discretion of program committee members. Multiple and/or concurrent submission to other scientific venues is not allowed and will result in rejection as well as notification to the other venue. Any case of plagiarism (including self-plagiarism from earlier publications) will result in rejection as well as notification to the authors' institutions. TTCS 2020 proceedings will be published by Springer, in the Lecture Notes in Computer Science series, in accordance to the contract between Springer Nature Switzerland AG and the International Federation for Information Processing (IFIP). Papers should be submitted to the appropriate track through EasyChair at https://easychair.org/conferences/?conf=ttcs2020 ------------------------------ Programme Committee ------------------------------ Track A: Algorithms and Complexity Mohammad Ali Abam, Sharif University of Technology, Iran (PC co-chair) Sepehr Assadi, Rutgers University, USA Mohammad Hossein Bateni, GoogleRresearch, USA Salman Beigy, IPM, Iran Hossein Esfandiari, Harvard University, USA Omid Etesami, IPM, Iran Marc van Kreveld, Utrecht University, Netherlands Mohammad Mahdian, Google Research, USA Mohammad Mahmoody, University of Virginia, USA Vahab Mirrokni, Google Research, USA Gunter Rote, FU Berlin, Germany Mohammadreza Salavatipour, University of Alberta, Canada Masoud Seddighin, IPM, Iran Saeed Seddighin, Harvard University, USA Michiel Smid, Carleton Univesity, Canada Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran Track B: Logic, Semantics, and Programming Theory Farhad Arbab, CWI, The Netherlands Kyungmin Bae, Pohang University of Science and Technology, South Korea Christel Baier, Technische Universitat Dresden, Germany Luis S. Barbosa, University of Minho, Portugal (PC co-chair) Mario Benevides, Universidade Federal do Rio de Janeiro, Brazil Simon Bliduze, INRIA Lille, France Filippo Bonchi, University of Pisa, Italy Marcello Bonsangue, University of Leiden, The Netherlands Flavio Corradini University of Camerino, Italy Fredrik Dahlqvist, UCL, UK Sergey Goncharov, FAU Erlangen-Nurnberg, Germany Hossein Hojjat, Rochester Institute of Technology, USA Mohammad Izadi, Sharif University of Technology, Iran Sung-Shik Jongmans, Open University, The Netherlands Alexander Knapp, University of Augsburg, Germany Jan Kretinsky, Munich University of Technology, Germany Alexandre Madeira, University of Aveiro, Portugal Stefan Mitsch, Carnegie Mellon University, USA Mohammad Reza Mousavi, University of Leicester, UK Renato Neves, INESC TEC, Portugal Peter Olveczky, University of Oslo, Norway Prakash Panangaden, McGill University, Canada Elaine Pimentel, UFRN, Brazil Subodh Sharma, IIT Delhi, India Pawel Sobocinski, Taltech, Estonia Ana Sokolova, University of Salzburg, Austria Carolyn Talcott, Stanford University, USA Benoit Valiron, LRI, France Naijun Zhan, Chinese Academy of Science, China Link to the online cfp: https://easychair.org/cfp/TTCS2020

4 years, 10 months

1
0
0 0

Barry Cooper Prize - Call for Nominations

by Gianluca Della Vedova

A Call for Nominations for the S.Barry Cooper Prize is now open. Nominations for the award should be submitted by email to the Award Committee Chair Anuj Dawar (University of Cambridge) anuj.dawar(a)cl.cam.ac.uk Any emails and related messages should have the subject line starting with “S. Barry Cooper Prize 2020”. To be considered, nominations for the 2020 Prize must be received by 17 January, 2020. A nomination package should include: 1. A statement of motivation for awarding the prize to the nominee, including: the nominee’s outstanding results, their seminal and lasting theory building and/or exceptional service to the research communities, as the case may be. These should be supported by at least one of – A list of the most important publications, accompanied by a brief summary of the technical content of the papers and a brief explanation of their significance. Where possible, this should include pointers to online versions of the publications. – A statement explaining the role played and the exceptional services rendered by the nominee, in the research communities involved in computability and related areas. 2. A support letter or letters signed by at least two members of the scientific community. The nomination package must be in English, but it may include reference to publications in other languages. Selection Process ================= The Award Committee is solely responsible for the selection of the winner of the award. All matters relating to the selection process that are not specified here are left to the discretion of the Award Committee, whose decision will be final.

4 years, 10 months

1
0
0 0

Call for nominations Presburger Award 2020 (deadline Feb. 15, 2020)

by Anca Muscholl

[Please distribute] The Presburger Award for Young Scientists 2020 Call for Nominations Deadline: 15 February 2020 Starting in 2010, the European Association for Theoretical Computer Science (EATCS) established the Presburger Award. The Award is conferred annually at the International Colloquium on Automata, Languages and Programming (ICALP) to a young scientist (in exceptional cases to several young scientists) for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers. The Award is named after Mojzesz Presburger who accomplished his path-breaking work on decidability of the theory of addition (today called Presburger arithmetic) as a student in 1929. Nominations for the Presburger Award can be submitted by any member or group of members of the theoretical computer science community except the nominee and his/her advisors for the master thesis and the doctoral dissertation. Nominated scientists have to be at most 35 years old on January 1st of the year of the nomination (i.e., for the Presburger Award of 2020 the birth year should be 1984 or later). The Presburger Award Committee of 2020 consists of Thore Husfeldt (Lund University and IT University of Copenhagen), Meena Mahajan (The Institute of Mathematical Sciences, Chennai) and Anca Muscholl (LaBRI, Bordeaux, chair). Nominations, consisting of a two page justification and (links to) the respective papers, as well as additional supporting letters, should be sent by e-mail to: presburger-award(a)eatcs.org The subject line of every nomination should start with Presburger Award 2020, and the message must be received before February 15th, 2020. The award includes an amount of 1000 Euro and an invitation to ICALP 2020 for a lecture. _____________________________________________ Previous Winners: Mikolaj Bojanczyk, 2010 Patricia Bouyer-Decitre, 2011 Venkatesan Guruswami, Mihai Patrascu 2012 Erik Demaine, 2013 David Woodruff, 2014  Xi Chen, 2015 Mark Braverman, 2016 Alexandra Silva, 2017 Karl Bringmann, Kasper Green Larsen 2019   Official website: http://www.eatcs.org/index.php/presburger

4 years, 10 months

1
0
0 0

ICGI 2020 - First call for papers

by Remi Eyraud

** *The 15th International Conference on Grammatical Inference* *** August 26-28, 2020 Manhattan, New-York, USA Submission deadline: May 1st, 2020 https://icgi2020.lis-lab.fr *Apologies for eventual multiple receptions* It is our pleasure to inform you about ICGI 2020, the major forum for presentation and discussion of original research papers on all aspects of grammar learning. ICGI, which has been organized bi-annually since early nineties, will be hosted this time at the NYC SUNY Global Center on Park Avenue, New-York, USA. ICGI 2020 is the place to present your work on learning formal grammars, finite state machines, context-free grammars, Markov models, or any models related to language theory, stochastic or not. Both theoretical work and experimental analyses are welcomed as submissions. This year we especially encourage submissions related to connectionist models such as neural networks, since the tutorials of the first day will focus on that topic. Topics of interest - Theoretical aspects of grammatical inference: learning paradigms, learnability results, complexity of learning - Empirical and theoretical research on query learning, active learning, and other interactive learning paradigms - Empirical and theoretical research on methods using or including, but not limited to, spectral learning, state-merging, distributional learning, statistical relational learning, statistical inference and/or Bayesian learning - Learning algorithms for language classes inside and outside the Chomsky hierarchy. Learning tree and graph grammars. - Learning probability distributions over strings, trees or graphs, or transductions thereof. - Learning with contextualized data: for instance, Grammatical inference from strings or trees paired with semantics representations, or learning by situated agents and robots. - Experimental and theoretical analysis of different approaches to grammar induction, including artificial neural networks, statistical methods, symbolic methods, information-theoretic approaches, minimum description length, complexity-theoretic approaches, heuristic methods, etc. - Novel approaches to grammatical inference: induction by DNA computing or quantum computing, evolutionary approaches, new representation spaces, etc. - Successful applications of grammatical learning to tasks in fields including, but not limited to, natural language processing and computational linguistics, model checking and software verification, bioinformatics, robotic planning and control, and pattern recognition. Types of Contributions We welcome three types of papers: - Formal and/or technical papers describe original solutions (theoretical, methodological or conceptual) in the field of grammatical inference. A technical paper should clearly describe the situation or problem tackled, the relevant state of the art, the position or solution suggested and the benefits of the contribution. - Position papers can describe completely new research positions or approaches, open problems. Current limits can be discussed. In all cases rigor in presentation will be required. Such papers must describe precisely the situation, problem, or challenge addressed, and demonstrate how current methods, tools, ways of reasoning, may be inadequate. - Tool papers describing a new tool for grammatical inference. The tool must be publicly available and the paper has to contain several use-case studies describing the use of the tool. In addition, the paper should clearly describe the implemented algorithms, input parameters and syntax, and the produced output. Selected authors will be encouraged to submit an extended version of their work to an upcoming special issue of an international journal (to be announced). Guidelines for authors Accepted papers will be published within the Proceedings of Machine Learning Research series (http://proceedings.mlr.press/). They must be submitted in pdf format through EasyChair. The total length of the paper should not exceed 12 pages on A4-size paper. The prospective authors are strongly recommended to use the JMLR style file for LaTeX (https://ctan.org/tex-archive/macros/latex/contrib/jmlr) since it will be the required format of final published version. The conference proceedings will be submitted for indexing to the Web of Science Database. Important Dates Deadline for submissions is: May 1, 2020 Notification of acceptance: June 15, 2020 Camera-ready copy: July 15, 2020 Conference: August 26-28, 2020 Conference Chairs: Jane Chandlee, Haverford College Rémi Eyraud, QARMA team, Aix-Marseille University Jeffrey Heinz, Stony Brook University Adam Jardine, Rutgers University Program committee consists of almost thirty recognizable researchers (names will appear on the website soon). For any enquiries regarding general issues, the program, or if you are a potential sponsor, please contact one of the conference chair. We look forward to seeing you at ICGI 2020. Sincerely, Adam, Jane, Jeffrey, Rémi * -- Rémi EYRAUD Associate professor /LABORATOIRE D'INFORMATIQUE ET SYSTÈMES (LIS) <https://www.lis-lab.fr/> - QARMA team <https://qarma.lis-lab.fr/>/ Aix-Marseille Université - CMI/LIS, 39 rue F. Joliot Curie, F-13013 Marseille Site : https://pageperso.lis-lab.fr/~remi.eyraud/ - Email : remi.eyraud(a)lis-lab.fr <mailto:remi.eyraud@lis-lab.fr> Phone: +33(0)4 91 05 46 52 - Office 502

4 years, 10 months

1
0
0 0

FSCD-IJCAR - Call For Workshop Proposals

by Giulio Manzonetto

(Apologies for the cross postings.) -------------------------------------------------------------------- Call for Workshop Proposals FSCD 2020 http://fscd2020.org IJCAR 2020 http://ijcar2020.org Paris, France Main Conference: 30 June - 3 July 2020 Workshops: 29 June, 4-5 July 2020 -------------------------------------------------------------------- FSCD 2020 will be the fifth edition of the International Conference on Formal Structures for Computation and Deduction. IJCAR 2020 will be the tenth International Joint Conference on Automated Reasoning. We invite proposals for workshops, tutorials or other satellite events, on any topic to related formal structures in computation, deduction and automated reasoning, from theoretical foundations to tools and applications. Satellite events will take place on the 29 June and 4-5 July, before and after the main conference (30 June - 5 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=fscdijcar2020ws (or, by email to ws.org(a)ijcar-fscd-2020.org). 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 organizers; - proposed affiliated conference; - 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 conferences); - any other special requirements. The Organizing Committee of FSCD-IJCAR will determine the final list of accepted workshops based on the recommendations from the Workshop Chairs of the hosting conferences and availability of space and facilities. The organizers 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-IJCAR organizing 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 meeting room; and provision of lunch and coffee breaks for participants. IMPORTANT DATES -------------------- Submission of workshop proposals: 15 November, 2019 Notification of success of proposals: 1 December, 2019 Main conference: 30 June - 3 July 2020 Workshop dates: 29 June, 4-5 July 2020 -------------------- Best wishes, Giulio Manzonetto, Workshop Chair

4 years, 10 months

1
0
0 0

Simons-Berkeley Research Fellowships for spring of 2021 on theory and practice of NP and beyond

by Jakob Nordström

Dear colleagues, The call for applications for research fellowships (postdoc positions) at the Simons Institute at UC Berkeley for 2020-21 has now been posted at https://simons.berkeley.edu/fellows2020 with an application deadline of December 15. We wish to highlight the semester program "Satisfiability: Theory, Practice, and Beyond" (https://simons.berkeley.edu/programs/sat2021), which will run in the spring of 2021 in parallel with "Theoretical Foundations of Computer Systems" (https://simons.berkeley.edu/programs/tfcs2021). Simons-Berkeley Research Fellowships are intended for up-and-coming researchers who are getting close to defending their PhD degree or are at most 6 years past it at the start of the academic year 2020-21. This includes researchers who already hold junior faculty or postdoctoral positions. In particular, applicants who expect to have postdoc positions at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow, subject to the approval of the home institution. The Institute expects to award about 30 Fellowships in 2020-21; the majority of these are for one semester, but several appointments for a full academic year are expected to be made. In each semester of residence, each Fellow will normally participate in at least one of the ongoing programs at the Institute -- please indicate if you are applying for the SAT semester program. Salaries and benefits are competitive, and assistance with visas and housing will be provided. The Institute particularly encourages applications from women and minority candidates. If interdisciplinary research at the crossroads between theory and practice of SAT and other hard problems in logic and/or combinatorics seems interesting to you (also including going beyond NP to areas such as SMT solving, constraint programming, and mixed integer linear programming), then you are strongly encouraged to apply! All help with distributing this announcement further would be much appreciated. Best regards, Jakob Nordström On behalf of the organizing committee for the SAT semester program, Albert Atserias, Sam Buss, Vijay Ganesh, Antonina Kolokolova, and Jakob Nordström Jakob Nordström, Associate Professor University of Copenhagen and KTH Royal Institute of Technology Phone: +46 70 742 21 98 http://www.csc.kth.se/~jakobn/

4 years, 10 months

1
0
0 0

ICALP - call for papers - Correction

by Anuj Dawar

The call for papers for ICALP circulated yesterday had an error on it. The submission deadline given was incorrect. A correct version is below. --- Call for Papers - ICALP 2020 July 8-12 2020, Beijing, China Paper Submission: February 12, 2020, AoE https://easychair.org/conferences/?conf=icalp2020 ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2020 will be hosted at Peking University, in co-location with LICS 2020 (ACM/IEEE Symposium on Logic in Computer Science). Submission Guidelines: see https://easychair.org/conference /?conf=icalp2020 Important Dates submission: February 12, 2020, AoE notifications: April 15, 2020 camera ready: April 28, 2020 Topics: ICALP 2020 will have the two traditional tracks A (Algorithms, Complexity and Games) and B (Automata, Logic, Semantics and Theory of Programming). Papers presenting original, unpublished research on all aspects of theoretical computer science are sought. Typical, but not exclusive topics are: Track A -- Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memor Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks Track B -- Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi Chairs General chair: Xiaotie Deng (Peking University) PC Track A chair: Artur Czumaj (University of Warwick) PC Track B chair: Anuj Dawar (University of Cambridge) Venue The conference will be held at the Peking University, see http://econcs.pku.edu.cn/icalp2020/ Contact All questions about submissions should be emailed to the PC Track chairs: Artur Czumaj A.Czumaj(a)warwick.ac.uk Anuj Dawar Anuj.Dawar(a)cl.cam.ac.uk

4 years, 10 months

1
0
0 0

ICALP - Call for Papers

by Anuj Dawar

Call for Papers - ICALP 2020 July 8-12 2020, Beijing, China Paper Submission: February 20, 2020, AoE https://easychair.org/conferences/?conf=icalp2020 ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2020 will be hosted at Peking University, in co-location with LICS 2020 (ACM/IEEE Symposium on Logic in Computer Science). Submission Guidelines: see https://easychair.org/conferences/?conf=icalp2020 Important Dates submission: February 20, 2020, AoE notifications: April 15, 2020 camera ready: April 28, 2020 Topics: ICALP 2020 will have the two traditional tracks A (Algorithms, Complexity and Games) and B (Automata, Logic, Semantics and Theory of Programming). Papers presenting original, unpublished research on all aspects of theoretical computer science are sought. Typical, but not exclusive topics are: Track A -- Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memory Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks Track B -- Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi Chairs General chair: Xiaotie Deng (Peking University) PC Track A chair: Artur Czumaj (University of Warwick) PC Track B chair: Anuj Dawar (University of Cambridge) Venue The conference will be held at the Peking University, see http://econcs.pku.edu.cn/icalp2020/ Contact All questions about submissions should be emailed to the PC Track chairs: Artur Czumaj A.Czumaj(a)warwick.ac.uk Anuj Dawar Anuj.Dawar(a)cl.cam.ac.uk

4 years, 10 months

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory November 2019