{"id":513,"date":"2013-04-21T16:28:24","date_gmt":"2013-04-21T20:28:24","guid":{"rendered":"http:\/\/www.podc.org\/?page_id=513"},"modified":"2021-10-29T09:37:19","modified_gmt":"2021-10-29T14:37:19","slug":"2013-accepted-papers","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2013\/2013-accepted-papers\/","title":{"rendered":"Program"},"content":{"rendered":"

Download the scheduled program<\/a> as pdf.<\/p>\n

Regular papers<\/h2>\n

Dan Alistarh, James Aspnes, George Giakkoupis, and Philipp Woelfel<\/i>
\nSub-logarithmic Randomized Loose Renaming<\/p>\n

Vassos Hadzilacos and Sam Toueg<\/i>
\nOn Deterministic Abortable Objects<\/p>\n

Edmund Wong and Lorenzo Alvisi<\/i>
\nWhat\u2019s a Little Collusion Between Friends?<\/p>\n

Nicolas Braud-Santoni, Rachid Guerraoui, and Florian Huc<\/i>
\nFast Byzantine Agreement<\/p>\n

Yuval Emek and Roger Wattenhofer<\/i>
\nStone Age Distributed Computing<\/p>\n

Yoann Dieudonne, Andrzej Pelc, and Vincent Villain<\/i>
\nHow to Meet Asynchronously at Polynomial Cost<\/p>\n

Swan Dubois and Rachid Guerraoui<\/i>
\nIntroducing Speculation in Self-Stabilization – An Application to Mutual Exclusion<\/p>\n

Alex Scott, Peter Jeavons, and Lei Xu<\/i>
\nFeedback from nature: an optimal distributed algorithm for maximal independent set selection<\/p>\n

Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian<\/i>
\nBroadcast in Radio Networks with Collision Detection<\/p>\n

Michel Raynal and Julien Stainer<\/i>
\nRound-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors<\/p>\n

Allison Lewko and Mark Lewko<\/i>
\nOn the Complexity of Asynchronous Agreement Against Powerful Adversaries<\/p>\n

Hagit Attiya, Armando Castaneda, Maurice Herlihy, and Ami Paz<\/i>
\nUpper Bound on the Complexity of Solving Hard Renaming<\/p>\n

Yuezhou Lv and Thomas Moscibroda<\/i>
\nFair and Resilient Incentive Tree Mechanisms<\/p>\n

Gang Xu, George Amariucai, and Yong Guan<\/i>
\nDelegation of Computation with Verification Outsourcing: Curious Verifiers<\/p>\n

Hillel Avni, Nir Shavit, and Adi Suissa<\/i>
\nLeaplist: Lessons Learned in Designing TM-Supported Range Queries<\/p>\n

Hagit Attiya, Danny Hendler, and Smadar Levy<\/i>
\nAn O(1)-Barriers Optimal RMRs Mutual Exclusion Algorithm<\/p>\n

Nitin Vaidya and Vijay Garg<\/i>
\nByzantine Vector Consensus in Complete Graphs<\/p>\n

Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, and Calvin
\nNewport<\/i>
\nMaximal Independent Sets in Multichannel Radio Networks<\/p>\n

Mohsen Eftekhari, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce,
\nLata Narayanan, Jaroslav Opatrny, and Sunil Shende<\/i>
\nDistributed Local Algorithms for Barrier Coverage using Relocatable Sensors<\/p>\n

Mohsen Ghaffari, Nancy Lynch, and Calvin Newport<\/i>
\nThe Cost of Radio Network Broadcast for Different Models of Unreliable Links<\/p>\n

Ralf Klasing, Adrian Kosowski, Dominik Pajak, and Thomas Sauerwald<\/i>
\nThe Multi-Agent Rotor-Router on the Ring: A Deterministic Alternative to Parallel Random Walks<\/p>\n

Oksana Denysyuk and Luis Rodrigues<\/i>
\nByzantine Renaming in Synchronous Systems with t < N<\/p>\n

Christoph Lenzen and David Peleg<\/i>
\nEfficient Distributed Source Detection with Limited Bandwidth<\/p>\n

Rachid Guerraoui, Florian Huc, and Anne-Marie Kermarrec<\/i>
\nHighly Dynamic Distributed Computing with Byzantine Failures<\/p>\n

Pierre Fraigniaud, Mika G\u00f6\u00f6s, Amos Korman, and Jukka Suomela<\/i>
\nWhat can be decided locally without identifiers?<\/p>\n

Marijke Bodlaender, Magnus M. Halldorsson, and Pradipta Mitra<\/i>
\nConnectivity and Aggregation in Multihop Wireless Networks<\/p>\n

Chrysovalandis Agathangelou, Chryssis Georgiou, and Marios
\nMavronicolas<\/i>
\nA Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane<\/p>\n

Hagit Attiya, Alexey Gotsman, Sandeep Hans, and Noam Rinetzky<\/i>
\nA Programming Language Perspective on Transactional Memory Consistency<\/p>\n

Shiri Chechik<\/i>
\nCompact Routing Schemes with Improved Stretch<\/p>\n

Christoph Lenzen and Danny Dolev<\/i>
\nEarly-Deciding Consensus is Expensive<\/p>\n

Rotem Oshman and Nir Shavit<\/i>
\nThe SkipTrie: Low-Depth Concurrent Search without Rebalancing<\/p>\n

Dariusz Kowalski and Achour Mostefaoui<\/i>
\nSynchronous Byzantine Agreement with Nearly a Cubic Number of
\nCommunication Bits<\/p>\n

Ji Zhu, Stratis Ioannidis, Nidhi Hegde, and Laurent Massoulie<\/i>
\nStable and Scalable Universal Swarms<\/p>\n

Trevor Brown, Faith Ellen, and Eric Ruppert<\/i>
\nPragmatic Primitives for Non-blocking Data Structures<\/p>\n

Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh
\nTrehan<\/i>
\nOn the Complexity of Universal Leader Election<\/p>\n

John Augustine, Gopal Pandurangan, and Peter Robinson<\/i>
\nFast Byzantine Agreement in Dynamic Networks<\/p>\n

Christoph Lenzen<\/i>
\nOptimal Deterministic Routing, and Sorting on the Congested Clique<\/p>\n

Brief Announcements:<\/h2>\n

Rachit Agarwal and Brighten Godfrey<\/i>
\nA Simple Stretch 2 Distance Oracle<\/p>\n

Seda Davtyan, Kishori Konwar, and Alexander Shvartsman<\/i>
\nSelf-Stabilizing Resource Discovery Algorithm<\/p>\n

Michael Gorelik and Danny Hendler<\/i>
\nAn Asymmetric Flat-Combining Based Queue Algorithm<\/p>\n

Armando Castaneda, Yannai A. Gonczarowski, and Yoram Moses<\/i>
\nPareto Optimal Solutions to Consensus and Set Consensus<\/p>\n

Wojciech Wawrzyniak<\/i>
\nA local constant-factor approximation algorithm for MDS problem in anonymous network<\/p>\n

Chen Chen, Roman Vitenberg, and Hans-Arno Jacobsen<\/i>
\nConstructing Fault-Tolerant Overlay Networks for Topic-based Publish\/Subscribe<\/p>\n

Martin Hoefer and Thomas Sauerwald<\/i>
\nThreshold Load Balancing in Networks<\/p>\n

Calvin Newport<\/i>
\nA Shorter and Stronger Proof of an $Omega(Dlog{(n\/D)})$ Lower Bound for Broadcast in Radio Networks<\/p>\n

Annu John, Igor Konnov, Ulrich Schmid, Helmut Veith, and Josef Widder<\/i>
\nParameterized Model Checking of Fault-tolerant Distributed Algorithms by Abstraction<\/p>\n

Zahra Aghazadeh, Wojciech Golab, and Philipp Woelfel<\/i>
\nResettable Objects and Efficient Memory Reclamation for Concurrent Algorithms<\/p>\n

Lu Zhang, Xueyan Tang, and Bingsheng He<\/i>
\nOn Minimum Interaction Time for Continuous Distributed Interactive Computing<\/p>\n

Valerie King and Jared Saia<\/i>
\nByzantine Agreement with a Strong Adversary in Polynomial Expected Time<\/p>\n

Lelia Blin and Sebastien Tixeuil<\/i>
\nDeterministic Self-Stabilizing Leader Election with O(log log n)-bits<\/p>\n

Josh Karlin, Joud Khoury, Jared Saia, and Mahdi Zamani<\/i>
\nFreedom not Fear: Scalable Anonymous Communication with Byzantine Adversary<\/p>\n

Jeremy Fineman, Calvin Newport, and Tonghe Wang<\/i>
\nFair Maximal Independent Sets in Trees<\/p>\n

Raissa D’Souza and Samuel Johnson<\/i>
\nBrokerage and Closure in A Strategic Model of Social Capital<\/p>\n

Sam Whitlock, Scott Shenker, and Colin Scott<\/i>
\nTechniques for Programmatically Troubleshooting Distributed Systems<\/p>\n","protected":false},"excerpt":{"rendered":"

Download the scheduled program as pdf.<\/p>\n

Regular papers <\/p>\n

Dan Alistarh, James Aspnes, George Giakkoupis, and Philipp Woelfel Sub-logarithmic Randomized Loose Renaming<\/p>\n

Vassos Hadzilacos and Sam Toueg On Deterministic Abortable Objects<\/p>\n

Edmund Wong and Lorenzo Alvisi What\u2019s a Little Collusion Between Friends?<\/p>\n

Nicolas Braud-Santoni, Rachid Guerraoui, and Florian Huc Fast Byzantine Agreement<\/p>\n

Yuval Emek and Roger […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":6,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-513","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/513","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=513"}],"version-history":[{"count":1,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/513\/revisions"}],"predecessor-version":[{"id":1285,"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/pages\/513\/revisions\/1285"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2013\/wp-json\/wp\/v2\/media?parent=513"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}