Difference between revisions of "FCT 2009"

From Openresearch
Jump to: navigation, search
 
(4 intermediate revisions by the same user not shown)
Line 12: Line 12:
 
|Country=Poland
 
|Country=Poland
 
|Camera ready=2009/05/22
 
|Camera ready=2009/05/22
 +
|Has coordinator=Maciej G¸ebala
 +
|has general chair=Miroslaw Kutylowski
 +
|has program chair=Miroslaw Kutylowski, Witold Charatonik
 
|Submitted papers=67
 
|Submitted papers=67
 
|Accepted papers=29
 
|Accepted papers=29
Line 19: Line 22:
 
}}
 
}}
 
The 17th Fundamentals of Computation Theory (FCT) 2009
 
The 17th Fundamentals of Computation Theory (FCT) 2009
 
  
  
 
==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 38:
 
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.  
  
  
==Submissions==
 
 
==Important Dates==
 
==Important Dates==
 +
Submission Deadline: 9 April, 2009, 23:59 GMT <br>
 +
Author Notification: 15 May, 2009<br>
 +
Camera Ready Manuscript Due: 22 May, 2009

Latest revision as of 11:28, 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 %)
Committees
Organizers: Maciej G¸ebala
General chairs: Miroslaw Kutylowski
PC chairs: Miroslaw Kutylowski, Witold Charatonik
Table of 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.


Important Dates

Submission Deadline: 9 April, 2009, 23:59 GMT
Author Notification: 15 May, 2009
Camera Ready Manuscript Due: 22 May, 2009