Difference between revisions of "FCT 1993"
Jump to navigation
Jump to search
Tim Holzheim (talk | contribs) (Added page provenance(#264) and contribution type(#271)) |
|||
| (9 intermediate revisions by one other user not shown) | |||
| Line 9: | Line 9: | ||
|City=Szeged | |City=Szeged | ||
|Country=Hungary | |Country=Hungary | ||
| + | |has general chair=Zoltan Esik | ||
| + | |has program chair=L. Babai, S.L. Bloom, L. Budach | ||
| + | |Accepted papers=40 | ||
| + | |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 | ||
| + | |DblpConferenceId=fct/fct93 | ||
| + | |pageCreator=Tolga.karaarslan | ||
| + | |pageEditor=Tolga.karaarslan | ||
| + | |contributionType=1 | ||
}} | }} | ||
The 9th Fundamentals of Computation Theory (FCT) 1993 | 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 | ||
Latest revision as of 20:17, 1 April 2022
| FCT 1993 | |
|---|---|
9th Fundamentals of Computation Theory
| |
| Ordinal | 9 |
| Event in series | FCT |
| Dates | 1993/08/23 (iCal) - 1993/08/27 |
| Location | |
| Location: | Szeged, Hungary |
| Committees | |
| General chairs: | Zoltan Esik |
| PC chairs: | L. Babai, S.L. Bloom, L. Budach |
| Table of Contents | |
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