FCT 2011

FCT 2011
18th Fundamentals of Computation Theory
Ordinal	18
Event in series	FCT
Dates	2011/08/22 (iCal) - 2011/08/25
Homepage:	http://fct11.ifi.uio.no/
Location
Location:	Oslo, Norway
Loading map... {"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"280px","height":"280px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"wmsoverlay":false,"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"overlaylayers":[],"resizable":false,"enablefullscreen":false,"scrollwheelzoom":true,"markercluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","locations":[{"text":"\u003Cb\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E\u003C/b\u003E\u003Chr /\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E","title":"","link":"","lat":59.9133301,"lon":10.7389701,"icon":""}],"imageoverlays":null}
Table of Contents

The 18th Fundamentals of Computation Theory (FCT) 2011

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:

• algebraic and categorical methods
• automata and formal languages
• computability and nonstandard computing models
• database theory
• foundations of concurrency and distributed systems
• logics and model checking
• models of reactive, hybrid and stochastic systems
• principles of programming languages
• program analysis and transformation
• specification, refinement and verification
• security
• type systems

Emerging fields:

• ad hoc, dynamic, and evolving systems
• algorithmic game theory
• computational biology
• foundations of cloud computing and ubiquitous systems
• quantum computation

Submissions

The submission drafts should have at most 12 pages and be formated 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. Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=fct2011