Difference between revisions of "FCT 2009"
| Line 23: | Line 23: | ||
==Topics== | ==Topics== | ||
| − | * Algorithms: algorithm design and optimization; combinatorics and analysis of | + | * Algorithms: algorithm design and optimization; combinatorics and analysis of algorithms; computational complexity; approximation, randomized, and |
| − | algorithms; computational complexity; approximation, randomized, and | + | heuristic methods; parallel and distributed computing; circuits and boolean functions; online algorithms; machine learning and artificial |
| − | heuristic methods; parallel and distributed computing; circuits and | ||
| − | boolean functions; online algorithms; machine learning and artificial | ||
intelligence; computational geometry; computational algebra; ... | intelligence; computational geometry; computational algebra; ... | ||
| − | * Formal methods: automata and formal languages; computability and nonstandard | + | * Formal methods: automata and formal languages; computability and nonstandard computing models; algebraic and categorical methods; logics and model |
| − | computing models; algebraic and categorical methods; logics and model | + | checking; principles of programming languages; program analysis and transformation; specification, refinement and verification; type |
| − | checking; principles of programming languages; program analysis and | + | systems; concurrency theory; database theory, semi-structured data and finite model theory; models of reactive, hybrid and stochastic |
| − | transformation; specification, refinement and verification; type | ||
| − | systems; concurrency theory; database theory, semi-structured data | ||
| − | and finite model theory; models of reactive, hybrid and stochastic | ||
systems; ... | systems; ... | ||
| Line 41: | Line 36: | ||
algorithmic game theory; ... | algorithmic game theory; ... | ||
| − | Authors are invited to submit a draft of a full paper with at most 12 pages | + | Authors are invited to submit a draft of a full paper with at most 12 pages in the LNCS style. The paper should provide sufficient detail to allow the |
| − | in the LNCS style. The paper should provide sufficient detail to allow the | + | Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous |
| − | Program Committee to evaluate its validity, quality, and relevance. If | ||
| − | necessary, detailed proofs can be attached as an appendix. Simultaneous | ||
submission to other conferences with published proceedings or journals is not | submission to other conferences with published proceedings or journals is not | ||
allowed. | allowed. | ||
Revision as of 11:23, 21 April 2021
| FCT 2009 | |
|---|---|
17th Fundamentals of Computation Theory
| |
| Ordinal | 17 |
| Event in series | FCT |
| Dates | 2009/09/02 (iCal) - 2009/09/04 |
| Homepage: | http://fct2009.im.pwr.wroc.pl/ |
| Location | |
| Location: | Wroclaw, Poland |
Loading map... | |
| Important dates | |
| Submissions: | 2009/04/09 |
| Camera ready due: | 2009/05/22 |
| Papers: | Submitted 67 / Accepted 29 (43.3 %) |
| Table of Contents | |
Contents | |
The 17th Fundamentals of Computation Theory (FCT) 2009
Topics
- Algorithms: algorithm design and optimization; combinatorics and analysis of algorithms; computational complexity; approximation, randomized, and
heuristic methods; parallel and distributed computing; circuits and boolean functions; online algorithms; machine learning and artificial intelligence; computational geometry; computational algebra; ...
- Formal methods: automata and formal languages; computability and nonstandard computing models; algebraic and categorical methods; logics and model
checking; principles of programming languages; program analysis and transformation; specification, refinement and verification; type systems; concurrency theory; database theory, semi-structured data and finite model theory; models of reactive, hybrid and stochastic systems; ...
- Emerging fields: security and cryptography; ad hoc and mobile systems;
quantum computation; computational biology;high performance computing; algorithmic game theory; ...
Authors are invited to submit a draft of a full paper with at most 12 pages in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance. If necessary, detailed proofs can be attached as an appendix. Simultaneous submission to other conferences with published proceedings or journals is not allowed.
Submissions
Important Dates
| Acceptance rate | 43.3 + |
| Accepted papers | 29 + |
| Acronym | FCT 2009 + |
| Camera ready due | May 22, 2009 + |
| End date | September 4, 2009 + |
| Event in series | FCT + |
| Event type | Symposium + |
| Has coordinates | 51° 6' 32", 17° 1' 58"Latitude: 51.108977777778 Longitude: 17.032669444444 + |
| Has location city | Wroclaw + |
| Has location country | Category:Poland + |
| Homepage | http://fct2009.im.pwr.wroc.pl/ + |
| IsA | Event + |
| Ordinal | 17 + |
| Start date | September 2, 2009 + |
| Submission deadline | April 9, 2009 + |
| Submitted papers | 67 + |
| Title | 17th Fundamentals of Computation Theory + |
