(mobo import Concept___Events-migrated) |
(mobo import Concept___Events_With_Metrics-migrated) |
||
(One intermediate revision by the same user not shown) | |||
Line 8: | Line 8: | ||
|has general chair=Zoltan Esik | |has general chair=Zoltan Esik | ||
|has program chair=L. Babai, S.L. Bloom, L. Budach | |has program chair=L. Babai, S.L. Bloom, L. Budach | ||
− | |||
|has Proceedings DOI=https://doi.org/10.1007/3-540-57163-9 | |has Proceedings DOI=https://doi.org/10.1007/3-540-57163-9 | ||
|has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F3-540-57163-9 | |has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F3-540-57163-9 | ||
Line 22: | Line 21: | ||
|Event Mode=on site | |Event Mode=on site | ||
}} | }} | ||
+ | {{Event Deadline}} | ||
+ | {{Event Metric | ||
+ | |Number Of Accepted Papers=40 | ||
+ | }} | ||
+ | {{S Event}} | ||
The 9th Fundamentals of Computation Theory (FCT) 1993 | The 9th Fundamentals of Computation Theory (FCT) 1993 | ||
Latest revision as of 13:47, 18 October 2022
Deadlines
Metrics
Accepted Papers
40
Venue
Szeged, Hungary
Warning: Venue is missing. The map might not show the exact location.
The 9th Fundamentals of Computation Theory (FCT) 1993
Topics
- Semantics and logical concepts in the theory of computing and formal specification
- Automata and formal languages
- Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography
- Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts)
- Algorithms (efficient, probabilistic, parallel, sequential, distributed)
- Counting and combinatorics in connection with mathematical computer science