{"id":44,"date":"2022-02-25T08:24:51","date_gmt":"2022-02-25T08:24:51","guid":{"rendered":"https:\/\/synasc.ro\/2022\/?page_id=44"},"modified":"2022-04-12T15:58:53","modified_gmt":"2022-04-12T15:58:53","slug":"theory-of-computing","status":"publish","type":"page","link":"https:\/\/synasc.ro\/2022\/theory-of-computing\/","title":{"rendered":"Theory of Computing"},"content":{"rendered":"\n<ul class=\"wp-block-list\"><li>data structures and algorithms<\/li><li>combinatorial optimization<\/li><li>formal languages and combinatorics on words<\/li><li>graph-theoretic and combinatorial methods in computer science<\/li><li>algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms<\/li><li>computational complexity theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing<\/li><li>logical approaches to complexity, including finite model theory<\/li><li>algorithmic and computational learning theory<\/li><li>aspects of computability theory, including computability in analysis and algorithmic information theory<\/li><li>proof complexity<\/li><li>computational social choice and game theory<\/li><li>new computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to computability <\/li><li>randomized methods, random graphs, threshold phenomena and typical-case complexity<\/li><li>automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification<\/li><li>applications of theory, including wireless and sensor networks, computational biology and computational economics<\/li><li>experimental algorithmics<\/li><\/ul>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Track Chairs:<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\"><li>Mircea Marin, West University of Timisoara, Romania<\/li><li>Gabriel Istrate, Institute e-Austria Timisoara, Romania<\/li><\/ul>\n\n\n\n<p><strong>Program Committee<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\"><li>Cosmin Bonchis West University Timisoara, Romania<\/li><li>Adrian Craciun West University Timisoara, Romania<\/li><li>Elena Grigorescu Purdue University, USA<\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>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, boolean complexity, communication complexity, average-case complexity, derandomization and property testing logical approaches to complexity, including finite model theory algorithmic and computational [&hellip;]<\/p>\n","protected":false},"author":23,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-44","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/pages\/44","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/users\/23"}],"replies":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/comments?post=44"}],"version-history":[{"count":4,"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/pages\/44\/revisions"}],"predecessor-version":[{"id":278,"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/pages\/44\/revisions\/278"}],"wp:attachment":[{"href":"https:\/\/synasc.ro\/2022\/wp-json\/wp\/v2\/media?parent=44"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}