{"id":889,"date":"2025-04-04T08:45:56","date_gmt":"2025-04-04T08:45:56","guid":{"rendered":"http:\/\/synasc.ro\/2026-new\/?page_id=889"},"modified":"2026-02-06T13:07:52","modified_gmt":"2026-02-06T13:07:52","slug":"theory-of-computing","status":"publish","type":"page","link":"https:\/\/synasc.ro\/2026\/tracks\/theory-of-computing\/","title":{"rendered":"Theory of Computing"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

TOPICS OF INTEREST<\/h2>\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
  • data structures and algorithms<\/li>
  • combinatorial optimization<\/li>
  • formal languages and combinatorics on words<\/li>
  • graph-theoretic and combinatorial methods in computer science<\/li>
  • algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms<\/li>
  • computational complexity theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing<\/li>
  • logical approaches to complexity, including finite model theory<\/li>
  • algorithmic and computational learning theory<\/li>
  • aspects of computability theory, including computability in analysis and algorithmic information theory<\/li>
  • proof complexity<\/li>
  • computational social choice and game theory<\/li>
  • new computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to computability<\/li>
  • randomized methods, random graphs, threshold phenomena and typical-case complexity<\/li>
  • automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification<\/li>
  • applications of theory, including wireless and sensor networks, computational biology and computational economics<\/li>
  • experimental algorithmics<\/li><\/ul><\/div><\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t\t

    TRACK CHAIRS<\/h2>\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t
    • Mircea Marin<\/strong>, West University of Timisoara, Romania<\/li>
    • Gabriel Istrate<\/strong>, Institute e-Austria Timisoara, Romania<\/li><\/ul>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t
      \n\t\t\t\t\t

      PROGRAM COMMITTEE (TBC)<\/h2>\t\t\t\t<\/div>\n\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t
      • Cosmin Bonchi\u0219<\/strong>, West University of Timisoara, Romania<\/li>
      • Adrian Cr\u0103ciun<\/strong>, West University of Timisoara, Romania<\/li>
      • Elena Grigorescu<\/strong>, Purdue University, USA<\/li>
      • Tamio-Vesa Nakajima<\/strong>, University of Oxford, UK<\/li>
      • Alexandru Popa<\/strong>, University of Bucharest, Romania<\/li><\/ul>
        \u00a0<\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

        TOPICS OF INTEREST 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 […]<\/p>\n","protected":false},"author":27,"featured_media":0,"parent":152,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-889","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/pages\/889","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/users\/27"}],"replies":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/comments?post=889"}],"version-history":[{"count":19,"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/pages\/889\/revisions"}],"predecessor-version":[{"id":1507,"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/pages\/889\/revisions\/1507"}],"up":[{"embeddable":true,"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/pages\/152"}],"wp:attachment":[{"href":"https:\/\/synasc.ro\/2026\/wp-json\/wp\/v2\/media?parent=889"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}