Difference between revisions of "FCT 2011"

From Openresearch
Jump to: navigation, search
Line 26: Line 26:
 
* computational algebra
 
* computational algebra
  
*Formal methods:
+
Formal methods:
          o algebraic and categorical methods
+
* algebraic and categorical methods
          o automata and formal languages
+
* automata and formal languages
          o computability and nonstandard computing models
+
* computability and nonstandard computing models
          o database theory
+
* database theory
          o foundations of concurrency and distributed systems
+
* foundations of concurrency and distributed systems
          o logics and model checking
+
* logics and model checking
          o models of reactive, hybrid and stochastic systems
+
* models of reactive, hybrid and stochastic systems
          o principles of programming languages
+
* principles of programming languages
          o program analysis and transformation
+
* program analysis and transformation
          o specification, refinement and verification
+
* specification, refinement and verification
          o security
+
* security
          o type systems
+
* type systems
*Emerging fields:
+
 
          o ad hoc, dynamic, and evolving systems
+
Emerging fields:
          o algorithmic game theory
+
* ad hoc, dynamic, and evolving systems
          o computational biology
+
* algorithmic game theory
          o foundations of cloud computing and ubiquitous systems
+
* computational biology
          o quantum computation
+
* foundations of cloud computing and ubiquitous systems
 +
* quantum computation
 +
 
 
==Submissions==
 
==Submissions==
 
==Important Dates==
 
==Important Dates==

Revision as of 10:52, 21 April 2021

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...

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

Important Dates

Facts about "FCT 2011"
AcronymFCT 2011 +
End dateAugust 25, 2011 +
Event in seriesFCT +
Event typeSymposium +
Has coordinates59° 54' 48", 10° 44' 20"Latitude: 59.913330555556
Longitude: 10.738969444444
+
Has location cityOslo +
Has location countryCategory:Norway +
Homepagehttp://fct11.ifi.uio.no/ +
IsAEvent +
Ordinal18 +
Start dateAugust 22, 2011 +
Title18th Fundamentals of Computation Theory +