{"id":834,"date":"2013-09-26T15:30:05","date_gmt":"2013-09-26T19:30:05","guid":{"rendered":"http:\/\/www.podc.org\/?page_id=834"},"modified":"2021-10-29T09:37:19","modified_gmt":"2021-10-29T14:37:19","slug":"2013-proceedings","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2013\/2013-proceedings\/","title":{"rendered":"PODC 2013 Proceedings"},"content":{"rendered":"<div class=\"podc2013\">\n<div id=\"DLtoc\">\n<div id=\"DLheader\"><a class=\"DLcitLink\" title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"http:\/\/dldev.acm.org\/citation.cfm?id=2484239\"><img loading=\"lazy\" decoding=\"async\" class=\"DLlogo\" alt=\"Digital Library logo\" src=\"http:\/\/dldev.acm.org\/img\/dllogo.png\" width=\"30\" height=\"30\" \/>Full Citation in the ACM Digital Library<\/a><\/div>\n<div id=\"DLcontent\">\n<h2>SESSION: Keynote addresses<\/h2>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837591\">Plenary talk<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Michael Merritt<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837592\">Athena lecture: distributed computing theory for wireless networks and mobile systems<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Nancy A. Lynch<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837593\">Programming models for extreme-scale computing<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Marc Snir<\/li>\n<\/ul>\n<h2>SESSION: Concurrent data structures and objects<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Michel Raynal<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837594\">On deterministic abortable objects<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Vassos Hadzilacos<\/li>\n<li class=\"nameList Last\">Sam Toueg<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837505\">Pragmatic primitives for non-blocking data structures<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Trevor Brown<\/li>\n<li class=\"nameList\">Faith Ellen<\/li>\n<li class=\"nameList Last\">Eric Ruppert<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837506\">The SkipTrie: low-depth concurrent search without rebalancing<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Rotem Oshman<\/li>\n<li class=\"nameList Last\">Nir Shavit<\/li>\n<\/ul>\n<h2>SESSION: Routing and distributed algorithms<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">James Aspnes<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837507\">Compact routing schemes with improved stretch<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Shiri Chechik<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837508\">Optimal deterministic routing and sorting on the congested clique<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Christoph Lenzen<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837509\">Brief announcement: fair maximal independent sets in trees<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Jeremy Fineman<\/li>\n<li class=\"nameList\">Calvin Newport<\/li>\n<li class=\"nameList Last\">Tonghe Wang<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837500\">Brief announcement: threshold load balancing in networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Martin Hoefer<\/li>\n<li class=\"nameList Last\">Thomas Sauerwald<\/li>\n<\/ul>\n<h2>SESSION: Byzantine agreement<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Keren Censor-Hillel<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837501\">Fast byzantine agreement<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Nicolas Braud-Santoni<\/li>\n<li class=\"nameList\">Rachid Guerraoui<\/li>\n<li class=\"nameList Last\">Florian Huc<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837555\">Byzantine vector consensus in complete graphs<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Nitin H. Vaidya<\/li>\n<li class=\"nameList Last\">Vijay K. Garg<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837556\">Fast byzantine agreement in dynamic networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">John Augustine<\/li>\n<li class=\"nameList\">Gopal Pandurangan<\/li>\n<li class=\"nameList Last\">Peter Robinson<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837557\">Synchronous byzantine agreement with nearly a cubic number of communication bits<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dariusz R. Kowalski<\/li>\n<li class=\"nameList Last\">Achour Most\u00e9faoui<\/li>\n<\/ul>\n<h2>SESSION: Distributed algorithms and their complexity<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837558\">How to meet asynchronously at polynomial cost<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yoann Dieudonn\u00e9<\/li>\n<li class=\"nameList\">Andrzej Pelc<\/li>\n<li class=\"nameList Last\">Vincent Villain<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837559\">On the complexity of universal leader election<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Shay Kutten<\/li>\n<li class=\"nameList\">Gopal Pandurangan<\/li>\n<li class=\"nameList\">David Peleg<\/li>\n<li class=\"nameList\">Peter Robinson<\/li>\n<li class=\"nameList Last\">Amitabh Trehan<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837550\">Brief announcement: a simple stretch 2 distance oracle<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Rachit Agarwal<\/li>\n<li class=\"nameList Last\">Philip Brighten Godfrey<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837551\">Brief announcement: pareto optimal solutions to consensus and set consensus<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Armando Casta\u00f1eda<\/li>\n<li class=\"nameList\">Yannai A. Gonczarowski<\/li>\n<li class=\"nameList Last\">Yoram Moses<\/li>\n<\/ul>\n<h2>SESSION: Brief announcements<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Phillip Gibbons<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837552\">Brief announcement: self-stabilizing resource discovery algorithm<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Seda Davtyan<\/li>\n<li class=\"nameList\">Kishori M. Konwar<\/li>\n<li class=\"nameList Last\">Alexander A. Shvartsman<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837553\">Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Annu John<\/li>\n<li class=\"nameList\">Igor Konnov<\/li>\n<li class=\"nameList\">Ulrich Schmid<\/li>\n<li class=\"nameList\">Helmut Veith<\/li>\n<li class=\"nameList Last\">Josef Widder<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837554\">Brief announcement: on minimum interaction time for continuous distributed interactive computing<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Lu Zhang<\/li>\n<li class=\"nameList\">Xueyan Tang<\/li>\n<li class=\"nameList Last\">Bingsheng He<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837565\">Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">L\u00e9lia Blin<\/li>\n<li class=\"nameList Last\">S\u00e9bastien Tixeuil<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837566\">Brief announcement: scalable anonymous communication with byzantine adversary<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Josh Karlin<\/li>\n<li class=\"nameList\">Joud Khoury<\/li>\n<li class=\"nameList\">Jared Saia<\/li>\n<li class=\"nameList Last\">Mahdi Zamani<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837567\">Brief announcement: brokerage and closure in a strategic model of social capital<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Samuel D. Johnson<\/li>\n<li class=\"nameList Last\">Raissa M. D&#8217;Souza<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837568\">Brief announcement: techniques for programmatically troubleshooting distributed systems<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sam Whitlock<\/li>\n<li class=\"nameList\">Colin Scott<\/li>\n<li class=\"nameList Last\">Scott Shenker<\/li>\n<\/ul>\n<h2>SESSION: Distributed algorithms and their complexity<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Fabian Kuhn<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837569\">Stone age distributed computing<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yuval Emek<\/li>\n<li class=\"nameList Last\">Roger Wattenhofer<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837560\">Feedback from nature: an optimal distributed algorithm for maximal independent set selection<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Alex Scott<\/li>\n<li class=\"nameList\">Peter Jeavons<\/li>\n<li class=\"nameList Last\">Lei Xu<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837561\">What can be decided locally without identifiers?<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Pierre Fraigniaud<\/li>\n<li class=\"nameList\">Mika G\u00f6\u00f6s<\/li>\n<li class=\"nameList\">Amos Korman<\/li>\n<li class=\"nameList Last\">Jukka Suomela<\/li>\n<\/ul>\n<h2>SESSION: Fault tolerance in distributed systems<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Chryssis Georgiou<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837562\">Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michel Raynal<\/li>\n<li class=\"nameList Last\">Julien Stainer<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837563\">Highly dynamic distributed computing with byzantine failures<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Rachid Guerraoui<\/li>\n<li class=\"nameList\">Florian Huc<\/li>\n<li class=\"nameList Last\">Anne-Marie Kermarrec<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837564\">Brief announcement: constructing fault-tolerant overlay networks for topic-based publish\/subscribe<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Chen Chen<\/li>\n<li class=\"nameList\">Roman Vitenberg<\/li>\n<li class=\"nameList Last\">Hans-Arno Jacobsen<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837575\">Brief announcement: byzantine agreement with a strong adversary in polynomial expected time<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Valerie King<\/li>\n<li class=\"nameList Last\">Jared Saia<\/li>\n<\/ul>\n<h2>SESSION: Renaming and mutual exclusion<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Eric Ruppert<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837576\">Upper bound on the complexity of solving hard renaming<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hagit Attiya<\/li>\n<li class=\"nameList\">Armando Casta\u00f1eda<\/li>\n<li class=\"nameList\">Maurice Herlihy<\/li>\n<li class=\"nameList Last\">Ami Paz<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837577\">Randomized loose renaming in <i>o<\/i>(log log <i>n<\/i>) time<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dan Alistarh<\/li>\n<li class=\"nameList\">James Aspnes<\/li>\n<li class=\"nameList\">George Giakkoupis<\/li>\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837578\">Byzantine renaming in synchronous systems with t &lt; N<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Oksana Denysyuk<\/li>\n<li class=\"nameList Last\">Lu\u00eds Rodrigues<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837579\">An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hagit Attiya<\/li>\n<li class=\"nameList\">Danny Hendler<\/li>\n<li class=\"nameList Last\">Smadar Levy<\/li>\n<\/ul>\n<h2>SESSION: Social and peer to peer networks and mobile robots<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Darek Kowalski<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837570\">Fair and resilient incentive tree mechanisms<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yuezhou Lv<\/li>\n<li class=\"nameList Last\">Thomas Moscibroda<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837571\">What&#8217;s a little collusion between friends?<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Edmund L. Wong<\/li>\n<li class=\"nameList Last\">Lorenzo Alvisi<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837572\">A distributed algorithm for gathering many fat mobile robots in the plane<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Chrysovalandis Agathangelou<\/li>\n<li class=\"nameList\">Chryssis Georgiou<\/li>\n<li class=\"nameList Last\">Marios Mavronicolas<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837573\">Stable and scalable universal swarms<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Ji Zhu<\/li>\n<li class=\"nameList\">Stratis Ioannidis<\/li>\n<li class=\"nameList\">Nidhi Hegde<\/li>\n<li class=\"nameList Last\">Laurent Massoulie<\/li>\n<\/ul>\n<h2>SESSION: Byzantine agreement and self-stabilization<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Danny Hendler<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837574\">Early-deciding consensus is expensive<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Danny Dolev<\/li>\n<li class=\"nameList Last\">Christoph Lenzen<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837585\">On the complexity of asynchronous agreement against powerful adversaries<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Allison Lewko<\/li>\n<li class=\"nameList Last\">Mark Lewko<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837586\">Introducing speculation in self-stabilization: an application to mutual exclusion<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Swan Dubois<\/li>\n<li class=\"nameList Last\">Rachid Guerraoui<\/li>\n<\/ul>\n<h2>SESSION: Shared and transactional memory<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Panagiota Fatourou<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837587\">Leaplist: lessons learned in designing tm-supported range queries<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hillel Avni<\/li>\n<li class=\"nameList\">Nir Shavit<\/li>\n<li class=\"nameList Last\">Adi Suissa<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837588\">A programming language perspective on transactional memory consistency<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Hagit Attiya<\/li>\n<li class=\"nameList\">Alexey Gotsman<\/li>\n<li class=\"nameList\">Sandeep Hans<\/li>\n<li class=\"nameList Last\">Noam Rinetzky<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837589\">Brief announcement: an asymmetric flat-combining based queue algorithm<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Gorelik<\/li>\n<li class=\"nameList Last\">Danny Hendler<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837580\">Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Zahra Aghazadeh<\/li>\n<li class=\"nameList\">Wojciech Golab<\/li>\n<li class=\"nameList Last\">Philipp Woelfel<\/li>\n<\/ul>\n<h2>SESSION: Radio and wireless networks<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Luis Rodrigues<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837581\">Randomized broadcast in radio networks with collision detection<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList\">Bernhard Haeupler<\/li>\n<li class=\"nameList Last\">Majid Khabbazian<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837582\">Maximal independent sets in multichannel radio networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Sebastian Daum<\/li>\n<li class=\"nameList\">Mohsen Ghaffari<\/li>\n<li class=\"nameList\">Seth Gilbert<\/li>\n<li class=\"nameList\">Fabian Kuhn<\/li>\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837583\">The cost of radio network broadcast for different models of unreliable links<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList\">Nancy Lynch<\/li>\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837584\">Connectivity and aggregation in multihop wireless networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Marijke H.L. Bodlaender<\/li>\n<li class=\"nameList\">Magn\u00fas M. Halld\u00f3rsson<\/li>\n<li class=\"nameList Last\">Pradipta Mitra<\/li>\n<\/ul>\n<h2>SESSION: Sensor network, graph algorithms and system security<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Seth Gilbert<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837595\">The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Ralf Klasing<\/li>\n<li class=\"nameList\">Adrian Kosowski<\/li>\n<li class=\"nameList\">Dominik Paj\u0105k<\/li>\n<li class=\"nameList Last\">Thomas Sauerwald<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837596\">Efficient distributed source detection with limited bandwidth<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Christoph Lenzen<\/li>\n<li class=\"nameList Last\">David Peleg<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837597\">Distributed algorithms for barrier coverage using relocatable sensors<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Eftekhari<\/li>\n<li class=\"nameList\">Evangelos Kranakis<\/li>\n<li class=\"nameList\">Danny Krizanc<\/li>\n<li class=\"nameList\">Oscar Morales-Ponce<\/li>\n<li class=\"nameList\">Lata Narayanan<\/li>\n<li class=\"nameList\">Jaroslav Opatrny<\/li>\n<li class=\"nameList Last\">Sunil Shende<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837598\">Delegation of computation with verification outsourcing: curious verifiers<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Gang Xu<\/li>\n<li class=\"nameList\">George Amariucai<\/li>\n<li class=\"nameList Last\">Yong Guan<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837599\">Brief announcement: a shorter and stronger proof of an \u03a9(d log(n\/d)) lower bound for broadcast in radio networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Calvin Newport<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dldev.acm.org\/authorize?6837590\">Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Wojciech Wawrzyniak<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p> Full Citation in the ACM Digital Library SESSION: Keynote addresses Plenary talk Michael Merritt Athena lecture: distributed computing theory for wireless networks and mobile systems Nancy A. Lynch Programming models for extreme-scale computing Marc Snir SESSION: Concurrent data structures and objects Michel Raynal On deterministic abortable objects Vassos Hadzilacos Sam Toueg Pragmatic primitives for [&#8230;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-834","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/834","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/comments?post=834"}],"version-history":[{"count":1,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/834\/revisions"}],"predecessor-version":[{"id":1280,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/834\/revisions\/1280"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/media?parent=834"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}