{"id":598,"date":"2015-01-27T14:16:37","date_gmt":"2015-01-27T12:16:37","guid":{"rendered":"http:\/\/synasc.ro\/2017\/?page_id=598"},"modified":"2018-04-20T14:06:31","modified_gmt":"2018-04-20T12:06:31","slug":"advances-in-the-theory-of-computing-2","status":"publish","type":"page","link":"https:\/\/synasc.ro\/2018\/tracks\/advances-in-the-theory-of-computing-2\/","title":{"rendered":"Advances in the Theory of Computing"},"content":{"rendered":"<ul>\n<li><strong>Chairs<\/strong>\n<ul style=\"list-style-type: circle;\">\n<li>Gabriel Istrate, Research Institute e-Austria Timisoara, Romania<\/li>\n<li>Florin Manea, Christian-Albrechts-University, Kiel, Germany<\/li>\n<li>Mircea Marin, West University of Timisoara, Romania<\/li>\n<\/ul>\n<\/li>\n<li><strong>Topics<\/strong>\n<ul style=\"list-style-type: circle;\">\n<li>Data Structures and algorithms<\/li>\n<li>Combinatorial Optimization<\/li>\n<li>Formal languages and Combinatorics on Words<\/li>\n<li>Graph-theoretic and Combinatorial methods in Computer Science<\/li>\n<li>Algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms<\/li>\n<li>Computational Complexity Theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing<\/li>\n<li>Logical approaches to complexity, including finite model theory<\/li>\n<li>Algorithmic and computational learning theory<\/li>\n<li>Aspects of computability theory, including computability in analysis and algorithmic information theory<\/li>\n<li>Proof complexity<\/li>\n<li>Computational social choice and game theory<\/li>\n<li>New computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to computability<\/li>\n<li>Randomized methods, random graphs, threshold phenomena and typical-case complexity<\/li>\n<li>Automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification<\/li>\n<li>Applications of theory, including wireless and sensor networks, computational biology and computational economics<\/li>\n<li>Experimental algorithmics<\/li>\n<\/ul>\n<\/li>\n<li><strong>PC members<\/strong>\n<ul style=\"list-style-type: circle;\">\n<li>Joel Day (Kiel)<\/li>\n<li>Gabriel Istrate (Timisoara)<\/li>\n<li>Florin Manea (Kiel)<\/li>\n<li>Mircea Marin (Timisoara)<\/li>\n<li>Barnaby Martin (Durham)<\/li>\n<li>Igor Potapov (Liverpool)<\/li>\n<li>Markus Schmid (Trier)<\/li>\n<li>Henning Schnoor (Kiel)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Chairs Gabriel Istrate, Research Institute e-Austria Timisoara, Romania Florin Manea, Christian-Albrechts-University, Kiel, Germany Mircea Marin, West University of Timisoara, Romania Topics Data Structures and algorithms Combinatorial Optimization Formal languages and Combinatorics on Words Graph-theoretic and Combinatorial methods in Computer Science Algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms Computational Complexity Theory, including structural complexity, [&hellip;]<\/p>\n","protected":false},"author":4,"featured_media":0,"parent":102,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-598","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/pages\/598","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/comments?post=598"}],"version-history":[{"count":18,"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/pages\/598\/revisions"}],"predecessor-version":[{"id":1765,"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/pages\/598\/revisions\/1765"}],"up":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/pages\/102"}],"wp:attachment":[{"href":"https:\/\/synasc.ro\/2018\/wp-json\/wp\/v2\/media?parent=598"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}