Difference between revisions of "FCT 1993"

Latest revision as of 19: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
Loading map... {"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"280px","height":"280px","centre":false,"title":"","label":"","icon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"image layers":[],"overlays":[],"resizable":false,"fullscreen":false,"scrollwheelzoom":true,"cluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","clicktarget":"","imageLayers":[],"locations":[{"text":"","title":"","link":"","lat":46.2546312,"lon":20.1486016,"icon":""}],"imageoverlays":null}

Committees
General chairs:	Zoltan Esik
PC chairs:	L. Babai, S.L. Bloom, L. Budach
Table of Contents
Contents 1 Topics

The 9th Fundamentals of Computation Theory (FCT) 1993

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

@@ Line 9: / Line 9: @@
 |City=Szeged
 |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
 ==Topics==
-- Semantics and logical concepts in the theory of computing and formal specification
+*Semantics and logical concepts in the theory of computing and formal specification
-- Automata and formal languages
+*Automata and formal languages
-- Computational geometry, algorithmic aspects of algebra and algebraic geometry,
+*Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography
-cryptography
+*Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts)
-- Complexity (sequential, parallel, distributed computing, structure, lower
+*Algorithms (efficient, probabilistic, parallel, sequential, distributed)
-bounds, complexity of analytical problems, general concepts)
+*Counting and combinatorics in connection with mathematical computer science
-- Algorithms (efficient, probabilistic, parallel, sequential, distributed)
-- Counting and combinatorics in connection with mathematical computer science