m (Text replacement - "Homepage=" to "Official Website=") |
Curator 100 (talk | contribs) |
||
| Line 3: | Line 3: | ||
|Title=17th Fundamentals of Computation Theory | |Title=17th Fundamentals of Computation Theory | ||
|Ordinal=17 | |Ordinal=17 | ||
| − | | | + | |In Event Series=Event Series:FCT |
| − | | | + | |Single Day Event=no |
| + | |Start Date=2009/09/02 | ||
| + | |End Date=2009/09/04 | ||
| + | |Event Status=as scheduled | ||
| + | |Event Mode=on site | ||
| + | |Venue=University of Wrocław | ||
|City=Wroclaw | |City=Wroclaw | ||
| + | |Region=Lower Silesia | ||
|Country=Country:PL | |Country=Country:PL | ||
| + | |Academic Field=Computer Science | ||
| + | |Official Website=http://fct2009.im.pwr.wroc.pl/ | ||
| + | |Type=Symposium | ||
|Has coordinator=Maciej G¸ebala | |Has coordinator=Maciej G¸ebala | ||
|has general chair=Miroslaw Kutylowski | |has general chair=Miroslaw Kutylowski | ||
| Line 17: | Line 26: | ||
|pageEditor=User:Curator 75 | |pageEditor=User:Curator 75 | ||
|contributionType=1 | |contributionType=1 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
|Camera-Ready Deadline=2009/05/22 | |Camera-Ready Deadline=2009/05/22 | ||
|Submission Deadline=2009/04/09 | |Submission Deadline=2009/04/09 | ||
| + | }} | ||
| + | {{Organizer | ||
| + | |Contributor Type=organization | ||
| + | |Organization=University of Wrocław | ||
}} | }} | ||
{{Event Metric | {{Event Metric | ||
| Line 37: | Line 44: | ||
==Topics== | ==Topics== | ||
| − | * Algorithms: algorithm design and optimization; combinatorics and analysis of algorithms; computational complexity; approximation, randomized, and | + | *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 | 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 computing models; algebraic and categorical methods; logics and model | + | *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 | 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; concurrency theory; database theory, semi-structured data and finite model theory; models of reactive, hybrid and stochastic | ||
systems; ... | systems; ... | ||
| − | * Emerging fields: security and cryptography; ad hoc and mobile systems; | + | *Emerging fields: security and cryptography; ad hoc and mobile systems; |
quantum computation; computational biology;high performance computing; | quantum computation; computational biology;high performance computing; | ||
algorithmic game theory; ... | algorithmic game theory; ... | ||
Revision as of 14:10, 15 May 2023
|
||
| Submission |
|
||
| Camera-Ready |
University of Wrocław, Wroclaw, Lower Silesia, Poland
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.
Important Dates
Submission Deadline: 9 April, 2009, 23:59 GMT
Author Notification: 15 May, 2009
Camera Ready Manuscript Due: 22 May, 2009
