(mobo import Concept___Events_With_Metrics-migrated) |
Curator 100 (talk | contribs) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 3: | Line 3: | ||
|Title=20th Fundamentals of Computation Theory | |Title=20th Fundamentals of Computation Theory | ||
|Ordinal=20 | |Ordinal=20 | ||
| − | | | + | |In Event Series=Event Series:FCT |
| − | | | + | |Single Day Event=no |
| + | |Start Date=2015/08/17 | ||
| + | |End Date=2015/08/19 | ||
| + | |Event Status=as scheduled | ||
| + | |Event Mode=on site | ||
| + | |Venue=Radisson Blu | ||
|City=Gdansk | |City=Gdansk | ||
| + | |Region=Pomerania | ||
|Country=Country:PL | |Country=Country:PL | ||
| + | |Academic Field=Computer Science | ||
| + | |Official Website=https://sites.google.com/site/fct2015gdansk/ | ||
| + | |DOI=10.25798/hhbb-jq13 | ||
| + | |Type=Symposium | ||
|Has coordinator=Gdańsk University of Technology, Gdansk University | |Has coordinator=Gdańsk University of Technology, Gdansk University | ||
|has general chair=Pawel Zylinski | |has general chair=Pawel Zylinski | ||
| Line 17: | Line 27: | ||
|pageEditor=User:Curator 75 | |pageEditor=User:Curator 75 | ||
|contributionType=1 | |contributionType=1 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
|Notification Deadline=2015/06/04 | |Notification Deadline=2015/06/04 | ||
|Submission Deadline=2015/04/26 | |Submission Deadline=2015/04/26 | ||
| + | }} | ||
| + | {{Organizer | ||
| + | |Contributor Type=organization | ||
| + | |Organization=Gdańsk University of Technology | ||
| + | }} | ||
| + | {{Organizer | ||
| + | |Contributor Type=organization | ||
| + | |Organization=University of Gdańsk | ||
}} | }} | ||
{{Event Metric | {{Event Metric | ||
| Line 37: | Line 49: | ||
==Topics== | ==Topics== | ||
Algorithms: | Algorithms: | ||
| − | * algorithm design and optimization | + | *algorithm design and optimization |
| − | * approximation, randomized, and heuristic methods | + | *approximation, randomized, and heuristic methods |
| − | * circuits and boolean functions | + | *circuits and boolean functions |
| − | * combinatorics and analysis of algorithms | + | *combinatorics and analysis of algorithms |
| − | * computational algebra | + | *computational algebra |
| − | * computational complexity | + | *computational complexity |
| − | * computational geometry | + | *computational geometry |
| − | * online algorithms | + | *online algorithms |
| − | * streaming algorithms | + | *streaming algorithms |
| − | * distributed and parallel computing | + | *distributed and parallel computing |
Formal methods: | Formal methods: | ||
| − | * algebraic and categorical methods | + | *algebraic and categorical methods |
| − | * automata and formal languages | + | *automata and formal languages |
| − | * computability and nonstandard computing models | + | *computability and nonstandard computing models |
| − | * database theory | + | *database theory |
| − | * foundations of concurrency and distributed systems | + | *foundations of concurrency and distributed systems |
| − | * logics and model checking | + | *logics and model checking |
| − | * models of reactive, hybrid and stochastic systems | + | *models of reactive, hybrid and stochastic systems |
| − | * principles of programming languages | + | *principles of programming languages |
| − | * program analysis and transformation | + | *program analysis and transformation |
| − | * specification, refinement and verification | + | *specification, refinement and verification |
| − | * security | + | *security |
| − | * type systems | + | *type systems |
Emerging fields: | Emerging fields: | ||
| − | * ad hoc, dynamic and evolving systems | + | *ad hoc, dynamic and evolving systems |
| − | * algorithmic game theory | + | *algorithmic game theory |
| − | * computational biology | + | *computational biology |
| − | * foundations of cloud computing and ubiquitous systems | + | *foundations of cloud computing and ubiquitous systems |
| − | * quantum information and quantum computing | + | *quantum information and quantum computing |
| Line 75: | Line 87: | ||
*a cover page containing: the title of the paper, the names and affiliations of all the authors, and an abstract of at least one paragraph detailing the main contributions of the paper, | *a cover page containing: the title of the paper, the names and affiliations of all the authors, and an abstract of at least one paragraph detailing the main contributions of the paper, | ||
| − | *a self-contained exposition of the contribution of the paper of at most 11 pages' length (excluding the cover page and references) in A4 format, typeset in at least 11pt font, with standard line spacing and reasonable page margins. | + | *a self-contained exposition of the contribution of the paper of at most 11 pages' length (excluding the cover page and references) in A4 format, typeset in at least 11pt font, with standard line spacing and reasonable page margins. |
It is expected that the full version of each submitted paper should be ready at the time of submission. Any proofs or additional material which do not fit into the submission page limit must be provided in a clearly marked Appendix, to be read at the discretion of the Program Committee. Alternatively, authors can provide a full version of their paper in the Appendix, or upload the full version of the paper to a public repository (such as arXiv or hal) and provide the appropriate reference within the Easy Chair submission. | It is expected that the full version of each submitted paper should be ready at the time of submission. Any proofs or additional material which do not fit into the submission page limit must be provided in a clearly marked Appendix, to be read at the discretion of the Program Committee. Alternatively, authors can provide a full version of their paper in the Appendix, or upload the full version of the paper to a public repository (such as arXiv or hal) and provide the appropriate reference within the Easy Chair submission. | ||
Latest revision as of 09:30, 7 July 2023
Deadlines
|
||
| Submission |
|
||
| Notification |
Metrics
Submitted Papers
60
Accepted Papers
27
Venue
Radisson Blu, Gdansk, Pomerania, Poland
The 20th Fundamentals of Computation Theory (FCT) 2015
Topics
Algorithms:
- algorithm design and optimization
- approximation, randomized, and heuristic methods
- circuits and boolean functions
- combinatorics and analysis of algorithms
- computational algebra
- computational complexity
- computational geometry
- online algorithms
- streaming algorithms
- distributed and parallel computing
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 information and quantum computing
Submissions
Submissions must be made electronically via the Easy Chair website in PDF format and consist of the following elements:
- a cover page containing: the title of the paper, the names and affiliations of all the authors, and an abstract of at least one paragraph detailing the main contributions of the paper,
- a self-contained exposition of the contribution of the paper of at most 11 pages' length (excluding the cover page and references) in A4 format, typeset in at least 11pt font, with standard line spacing and reasonable page margins.
It is expected that the full version of each submitted paper should be ready at the time of submission. Any proofs or additional material which do not fit into the submission page limit must be provided in a clearly marked Appendix, to be read at the discretion of the Program Committee. Alternatively, authors can provide a full version of their paper in the Appendix, or upload the full version of the paper to a public repository (such as arXiv or hal) and provide the appropriate reference within the Easy Chair submission.
Important Dates
Submission deadline: April 25, 2015 April 26, 2015, AoE (resubmission possible until April 29, AoE)
Notification to authors: June 4, 2015
Final version: June 12, 2015
Symposium: August 17-19, 2015
