{"id":770,"date":"2013-09-03T16:33:20","date_gmt":"2013-09-03T20:33:20","guid":{"rendered":"http:\/\/www.podc.org\/?page_id=770"},"modified":"2021-10-29T09:38:04","modified_gmt":"2021-10-29T14:38:04","slug":"podc2015","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2015\/","title":{"rendered":"PODC 2015"},"content":{"rendered":"<h2 style=\"text-align: center;\">Donostia-San Sebasti\u00e1n, Spain<br \/>\nJuly 21-23, 2015<\/h2>\n<h2>News<\/h2>\n<ul>\n<li>The <a href=\"https:\/\/www.podc.org\/podc2015\/?p=1377\">PODC 2015 Proceedings<\/a> are now available on-line.<\/li>\n<li>Congratulations to our <a href=\"\/?p=1379\">2015 Dijkstra Prize<\/a> winners:\n<ul>\n<li><a href=\"http:\/\/dl.acm.org\/citation.cfm?id=806707\">Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols<\/a>, by <a href=\"http:\/\/www.cs.huji.ac.il\/%7Ebenor\/\">Michael Ben-Or<\/a> in <em>Proceedings of the Second ACM Symposium on Principles of Distributed Computing<\/em>, pages 27-30, August 1983<\/li>\n<li><a href=\"http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=4568104\">Randomized Byzantine Generals<\/a>, by <a href=\"http:\/\/www.seas.harvard.edu\/directory\/rabin\">Michael O. Rabin<\/a> in <em>Proceedings of Twenty-Fourth IEEE Annual Symposium on Foundations of Computer Science<\/em>, pages 403-409, November 1983<\/li>\n<\/ul>\n<\/li>\n<li>Congratulations to our <a href=\"\/?p=1365\">2015 Dissertation Award<\/a> winner:\n<ul>\n<li><a href=\"http:\/\/www.openu.ac.il\/Personal_sites\/leonid-barenboim\">Leonid Barenboim<\/a> will receive the Doctoral Dissertation Award for &#8220;Efficient Network Utilization in Locality-Sensitive Distributed Algorithms.&#8221;<\/li>\n<\/ul>\n<\/li>\n<li>Congratulations to our PODC 2015 award winners:\n<ul>\n<li><a href=\"http:\/\/www.openu.ac.il\/Personal_sites\/leonid-barenboim\">Leonid Barenboim<\/a> will receive the Best Paper award for &#8220;Deterministic (Delta+1) Coloring in Sublinear (in Delta) Time, in Static, Dynamic and Faulty Networks.&#8221;<\/li>\n<li><a href=\"http:\/\/people.csail.mit.edu\/ghaffari\/\">Mohsen Ghaffari<\/a> will receive the Best Student Paper award for &#8220;Near-Optimal Scheduling of Distributed Algorithms.&#8221;<\/li>\n<\/ul>\n<\/li>\n<li>The invited speakers for PODC 2015 are\n<ul>\n<li><a href=\"http:\/\/www.cs.berkeley.edu\/~christos\/\">Christos Papadimitriou<\/a><\/li>\n<li><a href=\"http:\/\/research.google.com\/pubs\/author3060.html\">Moti Yung<\/a><\/li>\n<li><a href=\"http:\/\/www.hni.uni-paderborn.de\/alg\/mitarbeiter\/fmadh\/\">Friedhelm Meyer auf der Heide<\/a><\/li>\n<\/ul>\n<\/li>\n<li>See the list of <a href=\"\/podc2015\/?p=1317\">accepted papers and brief announcements<\/a> for PODC 2015. Authors should see the <a href=\"http:\/\/www.sheridanprinting.com\/typedept\/podc.htm\">author instructions<\/a> to learn how to submit the final versions of their papers and announcements.<\/li>\n<li>See a <a href=\"\/data\/podc2015\/PODC-2015-Donostia-San-Sebastian.ppt\">Donostia-San Sebasti\u00e1n slide show<\/a> prepared for PODC 2015.<\/li>\n<li>Follow PODC on Twitter <a href=\"http:\/\/www.twitter.com\/#!\/@podc_conference\">@podc_conference<\/a> and hash tag <a href=\"http:\/\/www.twitter.com\/search?q=%23PODC2015Spain\">#PODC2015Spain<\/a>.<\/li>\n<\/ul>\n<ul>\n<li><a href=\"\/podc2014\">PODC 2014<\/a> was held in Paris and the <a href=\"\/podc2014\/?p=1167\">PODC 2014 conference proceedings<\/a> are now available online.<\/li>\n<\/ul>\n<h2>Scope<\/h2>\n<p>Original contributions to the theory, design, analysis, implementation, or application of distributed systems and networks, and, <em>in particular, of conceptually innovative results<\/em> are solicited. Topics of interest include, but are not limited to:<\/p>\n<ul>\n<li>algorithms for distributed systems and their complexity<\/li>\n<li>cluster, cloud, grid and high-performance computing<\/li>\n<li>communication networks: protocols, architectures, services, applications<\/li>\n<li>concurrent programming, synchronization, shared and transactional memory<\/li>\n<li>cryptographic protocols and system security<\/li>\n<li>distributed operating systems, databases and programming languages<\/li>\n<li>dynamic, adaptive and machine learning based distributed algorithms<\/li>\n<li>formal methods, semantics and verification of concurrent systems<\/li>\n<li>fault tolerance, reliability, availability of distributed systems<\/li>\n<li>game-theoretic approaches to distributed computing<\/li>\n<li>information theory, codes and reliable communication<\/li>\n<li>Internet applications, social networks and complex networks<\/li>\n<li>multiprocessor and multi-core architectures and algorithms<\/li>\n<li>nanonetworks and biological distributed algorithms<\/li>\n<li>quantum and optics based distributed algorithms<\/li>\n<li>self-stabilizing, self-organizing and autonomic systems<\/li>\n<li>sensor, mobile, ad-hoc, robot and peer-to-peer networks<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Donostia-San Sebasti\u00e1n, Spain July 21-23, 2015 News The PODC 2015 Proceedings are now available on-line. Congratulations to our 2015 Dijkstra Prize winners: Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, by Michael Ben-Or in Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 27-30, August 1983 Randomized Byzantine Generals, by Michael [&#8230;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":3,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-770","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/770","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/comments?post=770"}],"version-history":[{"count":5,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/770\/revisions"}],"predecessor-version":[{"id":1383,"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/pages\/770\/revisions\/1383"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2015\/wp-json\/wp\/v2\/media?parent=770"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}