{"id":1167,"date":"2014-07-16T10:19:35","date_gmt":"2014-07-16T15:19:35","guid":{"rendered":"http:\/\/www.podc.org\/?page_id=1167"},"modified":"2021-10-29T09:36:45","modified_gmt":"2021-10-29T14:36:45","slug":"2014-proceedings","status":"publish","type":"page","link":"https:\/\/www.podc.org\/podc2014\/2014-proceedings\/","title":{"rendered":"PODC 2014 Proceedings"},"content":{"rendered":"<div class=\"podc2014\">\n<div id=\"DLtoc\">\n<div id=\"DLheader\">\n<a class=\"DLcitLink\" title=\"Go to the ACM Digital Library for additional information about this proceeding\" href=\"http:\/\/dl.acm.org\/citation.cfm?id=2611462\"><img loading=\"lazy\" decoding=\"async\" class=\"DLlogo\" src=\"http:\/\/dl.acm.org\/img\/dllogo.png\" alt=\"Digital Library logo\" width=\"30\" height=\"30\" \/>Full Citation in the ACM Digital Library<\/a><\/p>\n<\/div>\n<div id=\"DLcontent\">\n<h2>SESSION: Keynote lecture<\/h2>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937692\">Rational and resilient protocols<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Silvio Micali<\/li>\n<\/ul>\n<h2>SESSION: Session 1<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Jennifer Welch<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937693\">Signature-free asynchronous byzantine consensus with t &lt; n\/3 and o(n<sup>2<\/sup>) messages<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Achour Mostefaoui<\/li>\n<li class=\"nameList\">Hamouma Moumen<\/li>\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:\/\/dl.acm.org\/authorize?6937670\">Asynchronous MPC with a strict honest majority using non-equivocation<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Backes<\/li>\n<li class=\"nameList\">Fabian Bendun<\/li>\n<li class=\"nameList\">Ashish Choudhury<\/li>\n<li class=\"nameList Last\">Aniket Kate<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937671\">Distributing the setup in universally composable multi-party computation<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Jonathan Katz<\/li>\n<li class=\"nameList\">Aggelos Kiayias<\/li>\n<li class=\"nameList\">Hong-Sheng Zhou<\/li>\n<li class=\"nameList Last\">Vassilis Zikas<\/li>\n<\/ul>\n<h2>SESSION: Session 2<\/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:\/\/dl.acm.org\/authorize?6937672\">The future(s) of shared data structures<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Alex Kogan<\/li>\n<li class=\"nameList Last\">Maurice Herlihy<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937673\">A paradox of eventual linearizability in shared memory<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Rachid Guerraoui<\/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:\/\/dl.acm.org\/authorize?6937674\">Brief announcement: are lock-free concurrent algorithms practically wait-free?<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dan Alistarh<\/li>\n<li class=\"nameList\">Keren Censor-Hillel<\/li>\n<li class=\"nameList Last\">Nir Shavit<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937685\">Brief announcement: a generic construction for nonblocking dual containers<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Joseph Izraelevitz<\/li>\n<li class=\"nameList Last\">Michael L. Scott<\/li>\n<\/ul>\n<h2>SESSION: Session 3<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Stefan Schmid<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937686\">Multi-message broadcast with abstract MAC layers and unreliable links<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mohsen Ghaffari<\/li>\n<li class=\"nameList\">Erez Kantor<\/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:\/\/dl.acm.org\/authorize?6937687\">Consensus with an abstract MAC layer<\/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:\/\/dl.acm.org\/authorize?6937688\">Simple and efficient local codes for distributed stable network construction<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Othon Michail<\/li>\n<li class=\"nameList Last\">Paul G. Spirakis<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937689\">Linear-in-delta lower bounds in the LOCAL model<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Mika G\u00f6\u00f6s<\/li>\n<li class=\"nameList\">Juho Hirvonen<\/li>\n<li class=\"nameList Last\">Jukka Suomela<\/li>\n<\/ul>\n<h2>SESSION: Session 4<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Nitin H. Vaidya<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937680\">Anonymous networks: randomization = 2-hop coloring<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yuval Emek<\/li>\n<li class=\"nameList\">Christoph Pfister<\/li>\n<li class=\"nameList\">Jochen Seidel<\/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:\/\/dl.acm.org\/authorize?6937681\">Beyond set disjointness: the communication complexity of finding the intersection<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Joshua Brody<\/li>\n<li class=\"nameList\">Amit Chakrabarti<\/li>\n<li class=\"nameList\">Ranganath Kondapally<\/li>\n<li class=\"nameList\">David P. Woodruff<\/li>\n<li class=\"nameList Last\">Grigory Yaroslavtsev<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937682\">Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Ofer Feinerman<\/li>\n<li class=\"nameList\">Bernhard Haeupler<\/li>\n<li class=\"nameList Last\">Amos Korman<\/li>\n<\/ul>\n<h2>SESSION: Session 5<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Moti Yung<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937683\">Estimation for monotone sampling: competitiveness and customization<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Edith Cohen<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937684\">Distributed algorithms for the Lov\u00e1sz local lemma and graph coloring<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Kai-Min Chung<\/li>\n<li class=\"nameList\">Seth Pettie<\/li>\n<li class=\"nameList Last\">Hsin-Hao Su<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937695\">Brief announcement: towards security and privacy for outsourced data in the multi-party setting<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Matteo Maffei<\/li>\n<li class=\"nameList\">Giulio Malavolta<\/li>\n<li class=\"nameList\">Manuel Reinert<\/li>\n<li class=\"nameList Last\">Dominique Schr\u00f6der<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937696\">Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Messaoud Doudou<\/li>\n<li class=\"nameList\">Jose M. Barcelo<\/li>\n<li class=\"nameList\">Ordinas<\/li>\n<li class=\"nameList\">Djamel Djenouri<\/li>\n<li class=\"nameList\">Jorge Garcia Vidal<\/li>\n<li class=\"nameList Last\">Nadjib Badache<\/li>\n<\/ul>\n<h2>SESSION: Keynote lecture<\/h2>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937697\">Coding theory for scalable media delivery<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Michael G. Luby<\/li>\n<\/ul>\n<h2>SESSION: Session 6<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Alexander Schvartsman<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937698\">Distributed connectivity decomposition<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Keren Censor-Hillel<\/li>\n<li class=\"nameList\">Mohsen Ghaffari<\/li>\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:\/\/dl.acm.org\/authorize?6937699\">Can quantum communication speed up distributed computation?<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Elkin<\/li>\n<li class=\"nameList\">Hartmut Klauck<\/li>\n<li class=\"nameList\">Danupon Nanongkai<\/li>\n<li class=\"nameList Last\">Gopal Pandurangan<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937690\">Optimal gossip with direct addressing<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Bernhard Haeupler<\/li>\n<li class=\"nameList Last\">Dahlia Malkhi<\/li>\n<\/ul>\n<h2>SESSION: Session 7<\/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:\/\/dl.acm.org\/authorize?6937691\">Complexity tradeoffs for read and update operations<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Danny Hendler<\/li>\n<li class=\"nameList Last\">Vitaly Khait<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937694\">Concurrent updates with RCU: search tree as an example<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Maya Arbel<\/li>\n<li class=\"nameList Last\">Hagit Attiya<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937605\">Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michel Raynal<\/li>\n<li class=\"nameList\">Julien Stainer<\/li>\n<li class=\"nameList Last\">Gadi Taubenfeld<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937606\">Brief announcement: concurrency-aware linearizability<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Nir Hemed<\/li>\n<li class=\"nameList Last\">Noam Rinetzky<\/li>\n<\/ul>\n<h2>SESSION: Session 8<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Vassos Hadzilacos<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937607\">Software-improved hardware lock elision<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yehuda Afek<\/li>\n<li class=\"nameList\">Amir Levy<\/li>\n<li class=\"nameList Last\">Adam Morrison<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937608\">A generalized asynchronous computability theorem<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Eli Gafni<\/li>\n<li class=\"nameList\">Petr Kuznetsov<\/li>\n<li class=\"nameList Last\">Ciprian Manolescu<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937609\">Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Dan Alistarh<\/li>\n<li class=\"nameList\">Oksana Denysyuk<\/li>\n<li class=\"nameList\">Lu\u00eds Rodrigues<\/li>\n<li class=\"nameList Last\">Nir Shavit<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937600\">Dynamic-sized nonblocking hash tables<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yujie Liu<\/li>\n<li class=\"nameList\">Kunlong Zhang<\/li>\n<li class=\"nameList Last\">Michael Spear<\/li>\n<\/ul>\n<h2>SESSION: Session 9<\/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:\/\/dl.acm.org\/authorize?6937601\">Trade-offs between selection complexity and performance when searching the plane without communication<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Christoph Lenzen<\/li>\n<li class=\"nameList\">Nancy Lynch<\/li>\n<li class=\"nameList\">Calvin Newport<\/li>\n<li class=\"nameList Last\">Tsvetomira Radeva<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937602\">Improved distributed steiner forest construction<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Christoph Lenzen<\/li>\n<li class=\"nameList Last\">Boaz Patt-Shamir<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937603\">Spanners and sparsifiers in dynamic streams<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Michael Kapralov<\/li>\n<li class=\"nameList Last\">David Woodruff<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937604\">Time versus cost tradeoffs for deterministic rendezvous in networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Avery Miller<\/li>\n<li class=\"nameList Last\">Andrzej Pelc<\/li>\n<\/ul>\n<h2>SESSION: 2013 ACM A.M. turing award lecture<\/h2>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937615\">An incomplete history of concurrency chapter 1. 1965&#8211;1977<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Leslie Lamport<\/li>\n<\/ul>\n<h2>SESSION: Keynote lecture<\/h2>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937616\">Rigorous system design<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Joseph Sifakis<\/li>\n<\/ul>\n<h2>SESSION: Session 10<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Paul Spirakis<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937617\">How to withstand mobile virus attacks, revisited<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Joshua Baron<\/li>\n<li class=\"nameList\">Karim El Defrawy<\/li>\n<li class=\"nameList\">Joshua Lampkins<\/li>\n<li class=\"nameList Last\">Rafail Ostrovsky<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937618\">Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Beno\u00eet Libert<\/li>\n<li class=\"nameList\">Marc Joye<\/li>\n<li class=\"nameList Last\">Moti Yung<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937619\">Fast and unconditionally secure anonymous channel<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Juan A. Garay<\/li>\n<li class=\"nameList\">Clinton Givens<\/li>\n<li class=\"nameList\">Rafail Ostrovsky<\/li>\n<li class=\"nameList Last\">Pavel Raykov<\/li>\n<\/ul>\n<h2>SESSION: Session 11<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Petr Kuznetsov<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937610\">Efficient lock-free binary search trees<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Bapi Chatterjee<\/li>\n<li class=\"nameList\">Nhan Nguyen<\/li>\n<li class=\"nameList Last\">Philippas Tsigas<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937611\">The amortized complexity of non-blocking binary search trees<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Faith Ellen<\/li>\n<li class=\"nameList\">Panagiota Fatourou<\/li>\n<li class=\"nameList\">Joanna Helga<\/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:\/\/dl.acm.org\/authorize?6937612\">Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Manfred Schwarz<\/li>\n<li class=\"nameList\">Kyrill Winkler<\/li>\n<li class=\"nameList\">Ulrich Schmid<\/li>\n<li class=\"nameList\">Martin Biely<\/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:\/\/dl.acm.org\/authorize?6937613\">Brief announcement: local approximability of minimum dominating set on planar graphs<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Miikka Hilke<\/li>\n<li class=\"nameList\">Christoph Lenzen<\/li>\n<li class=\"nameList Last\">Jukka Suomela<\/li>\n<\/ul>\n<h2>SESSION: Session 12<\/h2>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Joseph Sifakis<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937614\">Beyond geometry: towards fully realistic wireless models<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Marijke H.L. Bodlaender<\/li>\n<li class=\"nameList Last\">Magnus M. Halldorsson<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937625\">On the impact of geometry on ad hoc communication in wireless networks<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Tomasz Jurdzinski<\/li>\n<li class=\"nameList\">Dariusz R. Kowalski<\/li>\n<li class=\"nameList\">Michal Rozanski<\/li>\n<li class=\"nameList Last\">Grzegorz Stachowiak<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937626\">On the power of the congested clique model<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Andrew Drucker<\/li>\n<li class=\"nameList\">Fabian Kuhn<\/li>\n<li class=\"nameList Last\">Rotem Oshman<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937627\">Brief announcement: linial&#8217;s lower bound made easy<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Juhana Laurinharju<\/li>\n<li class=\"nameList Last\">Jukka Suomela<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937628\">Brief announcement: Super-fast t-ruling sets<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Tushar Bisht<\/li>\n<li class=\"nameList\">Kishore Kothapalli<\/li>\n<li class=\"nameList Last\">Sriram Pemmaraju<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937629\">Brief announcement: almost-tight approximation distributed algorithm for minimum cut<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList Last\">Danupon Nanongkai<\/li>\n<\/ul>\n<h2>SESSION: Session 13<\/h2>\n<ul class=\"DLauthors\">\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:\/\/dl.acm.org\/authorize?6937620\">Making objects writable<\/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<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937621\">Asynchronous convex hull consensus in the presence of crash faults<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Lewis Tseng<\/li>\n<li class=\"nameList Last\">Nitin H. Vaidya<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937622\">Distributed computing building blocks for rational agents<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yehuda Afek<\/li>\n<li class=\"nameList\">Yehonatan Ginzberg<\/li>\n<li class=\"nameList\">Shir Landau Feibish<\/li>\n<li class=\"nameList Last\">Moshe Sulamy<\/li>\n<\/ul>\n<h3><a class=\"DLtitleLink\" title=\"Get the Full Text from the ACM Digital Library\" href=\"http:\/\/dl.acm.org\/authorize?6937623\">Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions<\/a><\/h3>\n<ul class=\"DLauthors\">\n<li class=\"nameList First\">Yuda Zhao<\/li>\n<li class=\"nameList\">Haifeng Yu<\/li>\n<li class=\"nameList Last\">Binbin Chen<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p> Full Citation in the ACM Digital Library<\/p>\n<p> SESSION: Keynote lecture Rational and resilient protocols Silvio Micali SESSION: Session 1 Jennifer Welch Signature-free asynchronous byzantine consensus with t &lt; n\/3 and o(n2) messages Achour Mostefaoui Hamouma Moumen Michel Raynal Asynchronous MPC with a strict honest majority using non-equivocation Michael Backes Fabian Bendun Ashish Choudhury Aniket [&#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-1167","page","type-page","status-publish","hentry","odd"],"_links":{"self":[{"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/pages\/1167","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/comments?post=1167"}],"version-history":[{"count":1,"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/pages\/1167\/revisions"}],"predecessor-version":[{"id":1280,"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/pages\/1167\/revisions\/1280"}],"wp:attachment":[{"href":"https:\/\/www.podc.org\/podc2014\/wp-json\/wp\/v2\/media?parent=1167"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}