Difference between revisions of "FCT 2019"
Jump to navigation
Jump to search
Tim Holzheim (talk | contribs) (Added page provenance(#264) and contribution type(#271)) |
|||
| (5 intermediate revisions by one other user not shown) | |||
| Line 10: | Line 10: | ||
|City=Copenhagen | |City=Copenhagen | ||
|Country=Denmark | |Country=Denmark | ||
| + | |Paper deadline=2019/04/14 | ||
| + | |Notification=2019/05/19 | ||
| + | |Camera ready=2019/06/02 | ||
|has general chair=Thomas Hildebrandt | |has general chair=Thomas Hildebrandt | ||
|has program chair=Leszek Gasieniec, Jesper Jansson | |has program chair=Leszek Gasieniec, Jesper Jansson | ||
|has Keynote speaker=Libor Barto, Bernard Chazelle, Kousha Etessami, Torben Hagerup | |has Keynote speaker=Libor Barto, Bernard Chazelle, Kousha Etessami, Torben Hagerup | ||
| + | |Submitted papers=45 | ||
| + | |Accepted papers=21 | ||
| + | |has Proceedings Link=https://link.springer.com/content/pdf/10.1007%2F978-3-030-25027-0.pdf | ||
| + | |has Proceedings DOI=https://doi.org/10.1007/978-3-030-25027-0 | ||
| + | |has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F978-3-030-25027-0 | ||
|Year=2019 | |Year=2019 | ||
|DblpConferenceId=fct/fct2019 | |DblpConferenceId=fct/fct2019 | ||
|wikicfpId=128861 | |wikicfpId=128861 | ||
| + | |pageCreator=Wf | ||
| + | |pageEditor=Tolga.karaarslan | ||
| + | |contributionType=1 | ||
}} | }} | ||
The 22nd Fundamentals of Computation Theory (FCT) 2019 | The 22nd Fundamentals of Computation Theory (FCT) 2019 | ||
| Line 22: | Line 33: | ||
==Topics== | ==Topics== | ||
Algorithms: | Algorithms: | ||
| − | algorithm design and optimization | + | *algorithm design and optimization |
| − | data structures | + | *data structures |
| − | combinatorics and analysis of algorithms | + | *combinatorics and analysis of algorithms |
| − | randomized algorithms | + | *randomized algorithms |
| − | approximation algorithms | + | *approximation algorithms |
| − | parameterized and exact algorithms | + | *parameterized and exact algorithms |
| − | computational algebra and number theory | + | *computational algebra and number theory |
| − | computational geometry | + | *computational geometry |
| − | parallel algorithms | + | *parallel algorithms |
| − | distributed algorithms and protocols | + | *distributed algorithms and protocols |
| − | online algorithms | + | *online algorithms |
| − | streaming algorithms | + | *streaming algorithms |
| − | algorithmic game theory | + | *algorithmic game theory |
| − | computational biology | + | *computational biology |
Complexity: | Complexity: | ||
| − | + | *models of computation | |
| − | + | *computational complexity | |
| − | + | *decidability | |
| − | + | *Boolean/algebraic circuits and functions | |
| − | + | *randomized computation | |
| − | + | *derandomization | |
| − | + | *interactive proofs | |
| − | + | *cryptography | |
| − | + | *quantum computation | |
| − | + | *complexity theory | |
| − | + | *lower bounds | |
| − | + | *counting complexity | |
Formal methods: | Formal methods: | ||
| − | + | *algebraic and categorical methods | |
| − | + | *automata and formal languages | |
| − | + | *database theory | |
| − | + | *foundations of concurrency and distributed systems | |
| − | + | *logic and model checking | |
| − | + | *models of reactive, hybrid, and stochastic systems | |
| − | + | *principles of programming languages | |
| − | + | *program analysis and transformation | |
| − | + | *security | |
| − | + | *specification, refinement, and verification | |
| − | + | *type systems | |
| − | + | *ad hoc, dynamic, and evolving systems | |
| − | + | *foundations of cloud computing and ubiquitous systems | |
==Submissions== | ==Submissions== | ||
| + | Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics covered by the symposium. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. If relevant, authors have to disclose information on strongly-related papers that are in the publication or reviewing pipeline elsewhere. It is required that each accepted paper will be presented at the symposium by one of its authors. | ||
| + | |||
| + | Submissions must not exceed 12 pages (excluding references), formatted according to the LNCS style plus an optional, clearly marked appendix of reasonable length (to be read at the discretion of the program committee). The first page must include an indication of whether the paper is eligible for the best student paper award. | ||
| + | |||
| + | Papers are to be submitted electronically through EasyChair at the following link: [Log in to EasyChair for FCT 2019] | ||
| + | |||
| + | |||
==Important Dates== | ==Important Dates== | ||
| + | Full-paper submission: April 14, 2019 (AoE)<br> | ||
| + | Notification to authors: May 19, 2019<br> | ||
| + | Camera-ready submission: June 2, 2019<br> | ||
| + | Symposium: August 11–14, 2019 | ||
Latest revision as of 20:17, 1 April 2022
| FCT 2019 | |
|---|---|
22nd Fundamentals of Computation Theory
| |
| Ordinal | 22 |
| Event in series | FCT |
| Dates | 2019/08/12 (iCal) - 2019/08/14 |
| Homepage: | https://di.ku.dk/fct2019/ |
| Location | |
| Location: | Copenhagen, Denmark |
| Important dates | |
| Papers: | 2019/04/14 |
| Notification: | 2019/05/19 |
| Camera ready due: | 2019/06/02 |
| Papers: | Submitted 45 / Accepted 21 (46.7 %) |
| Committees | |
| General chairs: | Thomas Hildebrandt |
| PC chairs: | Leszek Gasieniec, Jesper Jansson |
| Keynote speaker: | Libor Barto, Bernard Chazelle, Kousha Etessami, Torben Hagerup |
| Table of Contents | |
The 22nd Fundamentals of Computation Theory (FCT) 2019
Topics
Algorithms:
- algorithm design and optimization
- data structures
- combinatorics and analysis of algorithms
- randomized algorithms
- approximation algorithms
- parameterized and exact algorithms
- computational algebra and number theory
- computational geometry
- parallel algorithms
- distributed algorithms and protocols
- online algorithms
- streaming algorithms
- algorithmic game theory
- computational biology
Complexity:
- models of computation
- computational complexity
- decidability
- Boolean/algebraic circuits and functions
- randomized computation
- derandomization
- interactive proofs
- cryptography
- quantum computation
- complexity theory
- lower bounds
- counting complexity
Formal methods:
- algebraic and categorical methods
- automata and formal languages
- database theory
- foundations of concurrency and distributed systems
- logic and model checking
- models of reactive, hybrid, and stochastic systems
- principles of programming languages
- program analysis and transformation
- security
- specification, refinement, and verification
- type systems
- ad hoc, dynamic, and evolving systems
- foundations of cloud computing and ubiquitous systems
Submissions
Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics covered by the symposium. Simultaneous submission to other conferences or workshops with published proceedings is not allowed. If relevant, authors have to disclose information on strongly-related papers that are in the publication or reviewing pipeline elsewhere. It is required that each accepted paper will be presented at the symposium by one of its authors.
Submissions must not exceed 12 pages (excluding references), formatted according to the LNCS style plus an optional, clearly marked appendix of reasonable length (to be read at the discretion of the program committee). The first page must include an indication of whether the paper is eligible for the best student paper award.
Papers are to be submitted electronically through EasyChair at the following link: [Log in to EasyChair for FCT 2019]
Important Dates
Full-paper submission: April 14, 2019 (AoE)
Notification to authors: May 19, 2019
Camera-ready submission: June 2, 2019
Symposium: August 11–14, 2019