{"id":211,"date":"2016-09-09T13:54:44","date_gmt":"2016-09-09T13:54:44","guid":{"rendered":"http:\/\/math.utu.fi\/cie2017\/?page_id=211"},"modified":"2017-06-15T16:01:22","modified_gmt":"2017-06-15T16:01:22","slug":"special-sessions","status":"publish","type":"page","link":"https:\/\/math.utu.fi\/cie2017\/special-sessions\/","title":{"rendered":"Special Sessions"},"content":{"rendered":"<h3>Algorithmics for biology<\/h3>\n<p>Organized by <strong><em>Paola Bonizzoni<\/em><\/strong> (Milano, Italy) and <strong><em>Veli M\u00e4kinen<\/em><\/strong> (Helsinki, Finland).<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><em><a href=\"https:\/\/bioinf.mpi-inf.mpg.de\/homepage\/index.php?&amp;account=marschal\">Tobias Marschall<\/a><\/em> (Max-Planck-Institut\u00a0f\u00fcr\u00a0Informatik, Germany)<br \/>\n<strong>A Guided Tour to Computational Haplotyping<\/strong><\/li>\n<\/ul>\n<ul>\n<li><em><a href=\"http:\/\/www.dei.unipd.it\/~vandinfa\/\">Fabio Vandin<\/a><\/em> (University of Padova, Italy)<br \/>\n<strong>Algorithms for Cancer Mutation Networks<\/strong><\/li>\n<\/ul>\n<ul>\n<li><em><a href=\"http:\/\/www-igm.univ-mlv.fr\/~koutcher\/\">Gregory Kucherov<\/a> <\/em>(University Paris-Est Marne-la-Vall\u00e9e, France)<br \/>\n<strong>Modern algorithmic techniques for biosequence search<\/strong><\/li>\n<\/ul>\n<ul>\n<li><em><a href=\"https:\/\/gianluca.dellavedova.org\">Gianluca Della Vedova<\/a><\/em> (University of Milano-Bicocca, Italy)<br \/>\n<strong>Character-based Phylogeny Construction and its Application to Tumor Evolution<\/strong><\/li>\n<\/ul>\n<hr \/>\n<h3>Combinatorics and algorithmics on words<\/h3>\n<p>Organized by <strong><em>Tero Harju<\/em><\/strong> (Turku, Finland) and<br \/>\n<strong><em>Dirk Nowotka<\/em><\/strong> (Kiel, Germany).<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><a href=\"http:\/\/www.karlin.mff.cuni.cz\/~holub\/indexen.htm\">Stepan Holub<\/a> (Charles University in Prague, Czech Republic)<br \/>\n<strong>Formalizing a Fragment of Combinatorics on Words<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.lirmm.fr\/~ochem\/\">Pascal Ochem<\/a> (Universit\u00e9 de Montpellier, France)<br \/>\n<strong>Pattern avoidance<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/math.nsc.ru\/~puzynina\/\">Svetlana Puzynina<\/a> (Universit\u00e9 Paris Diderot, France, and Sobolev Institute of Mathematics, Russia)<br \/>\n<strong>On variations of Morse and Hedlund theorem<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/ion.uwinnipeg.ca\/~nrampers\/\">Narad Rampersad<\/a> (University of Winnipeg, Canada)<br \/>\n<strong>Formulas with reversal<\/strong><\/li>\n<\/ul>\n<hr \/>\n<h3>Computability in analysis, algebra, and geometry<\/h3>\n<p>Organized by <strong><em>Julia Knight<\/em><\/strong> (Notre Dame, USA) and<br \/>\n<strong><em>Andrey Morozov<\/em><\/strong> (Novosibirsk, Russia).<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><a href=\"https:\/\/www.math.purdue.edu\/~sbasu\/\">Saugata Basu<\/a> (Purdue University, USA)<br \/>\n<strong>Complexity in different contexts<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.daimi.au.dk\/~korovina\/\"> Margarita Korovina<\/a> (University of Aarhus, Denmark)<br \/>\n<strong>Outline of Partial Computability in Computable Topology<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"https:\/\/math.berkeley.edu\/people\/faculty\/alexander-melnikov\">Alexander Melnikov<\/a> (University of California, Berkeley, USA)<br \/>\n<strong>Eliminating unbounded search in computable algebra<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/qcpages.qc.cuny.edu\/~rmiller\/\">Russell Miller<\/a> (City University of New York, USA)<br \/>\n<strong>Computable Transformations of Structures<\/strong><\/li>\n<\/ul>\n<hr \/>\n<h3>Cryptography and information theory<\/h3>\n<p>Organized by <strong><em>Delaram Kahrobaei<\/em><\/strong> (New York, USA) and<br \/>\n<strong><em>Helger Lipmaa<\/em><\/strong> (Tartu, Estonia)<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><a href=\"https:\/\/ekashefi.wordpress.com\/\">Elham Kashefi and Luka Music<\/a> (University of Edinburgh-Scotland, Universit\u00e9 Pierre et Marie Curie, France)<br \/>\n<strong>Garbled Quantum Computation<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"https:\/\/www.inf.ed.ac.uk\/people\/staff\/Aggelos_Kiayias.html\">Aggelos Kiayias<\/a> (University of Edinburgh, Scotland)<br \/>\n<strong>Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.unisa.it\/docenti\/ivanvisconti\/en\/index?nv=docenti.unisa.it\/ivan.visconti\">Ivan Visconti<\/a> (Universit\u00e0 degli Studi di Salerno, Italy)<br \/>\n<strong>Delayed-Input Cryptographic Protocols<\/strong><\/li>\n<\/ul>\n<hr \/>\n<h3>Formal languages and automata theory<\/h3>\n<p>Organized by<strong><em> Juhani Karhum\u00e4ki<\/em><\/strong> (Turku, Finland) and<br \/>\n<strong><em>Alexander Okhotin<\/em><\/strong> (St. Petersburg, Russia).<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><a href=\"http:\/\/research.cs.queensu.ca\/~ksalomaa\/\">Kai Salomaa<\/a> (Queen&#8217;s University at Kingston, Canada)<br \/>\n<strong>State Complexity of Neighbourhoods of Regular Languages<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.informatik.uni-giessen.de\/staff\/kutrib.html\">Martin Kutrib<\/a> (Justus-Liebig-Universit\u00e4t Gie\u00dfen, Germany)<br \/>\n<strong>Reversibility in Finite-State Devices<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"https:\/\/www.irif.fr\/~colcombe\/\">Thomas Colcombet<\/a> (Universit\u00e9 Paris Diderot, France)<br \/>\n<strong>Hybrid-set-vector automata and gluing of categories<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.ii.uni.wroc.pl\/~aje\/\">Artur Jez<\/a> (University of Wroc\u0142aw, Poland)<br \/>\n<strong>Recompression: new approach to word equations<\/strong><\/li>\n<\/ul>\n<hr \/>\n<h3>History and philosophy of computing<\/h3>\n<p><strong>Topic:<\/strong> History and foundations of recursion, in memory of R\u00f3sza P\u00e9ter.<\/p>\n<p>Organized by <em><strong><span class=\"st\">Liesbeth De Mol<\/span><\/strong><\/em> (Lille, France) and <strong><em>Giuseppe Primiero <\/em><\/strong>(London, United Kingdom).<\/p>\n<p><strong>Speakers:<\/strong><\/p>\n<ul>\n<li><a href=\"http:\/\/www.math.helsinki.fi\/logic\/people\/juliette.kennedy\/\">Juliette Kennedy <\/a>(University of Helsinki, Finland)<br \/>\n<strong>G\u00f6del\u2019s Reception of Turing\u2019s Model of Computability: the Shift of Perception in 1934<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.helsinki.fi\/~vonplato\/\">Jan von Plato<\/a> (University of Helsinki, Finland)<br \/>\n<strong>Rosa Politzer and the beginnings of the theory of computable functions<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/www.hectorzenil.net\/main.html\">Hector Zenil<\/a> (University of Oxford, UK, and Karolinska Institute, Sweden)<br \/>\n<strong>Computability and Causality<br \/>\n<\/strong><\/li>\n<\/ul>\n<ul>\n<li><a href=\"http:\/\/homepages.cs.ncl.ac.uk\/cliff.jones\/\">Cliff Jones<\/a> (Newcastle University, UK)<br \/>\n<strong>Turing\u2019s 1949 paper in context<\/strong><\/li>\n<\/ul>\n<p><strong>\u00a0<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Algorithmics for biology Organized by Paola Bonizzoni (Milano, Italy) and Veli M\u00e4kinen (Helsinki, Finland). Speakers: Tobias Marschall (Max-Planck-Institut\u00a0f\u00fcr\u00a0Informatik, Germany) A Guided Tour to Computational Haplotyping Fabio Vandin (University of Padova, Italy) Algorithms for Cancer Mutation Networks Gregory Kucherov (University Paris-Est Marne-la-Vall\u00e9e, France) Modern algorithmic techniques for biosequence search Gianluca Della Vedova (University of Milano-Bicocca, Italy) &hellip; <a href=\"https:\/\/math.utu.fi\/cie2017\/special-sessions\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Special Sessions<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":9,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-211","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/211","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/users\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/comments?post=211"}],"version-history":[{"count":31,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/211\/revisions"}],"predecessor-version":[{"id":1713,"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/pages\/211\/revisions\/1713"}],"wp:attachment":[{"href":"https:\/\/math.utu.fi\/cie2017\/wp-json\/wp\/v2\/media?parent=211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}