Conferences in DBLP
Marc Tremblay Transactional memory for a modern microprocessor. [Citation Graph (0, 0)][DBLP ] Conf ] Tom Leighton The Akamai approach to achieving performance and reliability on the internet. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech M. Golab , Vassos Hadzilacos , Danny Hendler , Philipp Woelfel Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. [Citation Graph (0, 0)][DBLP ] Conf ] Faith Ellen , Yossi Lev , Victor Luchangco , Mark Moir SNZI: scalable NonZero indicators. [Citation Graph (0, 0)][DBLP ] Conf ] Marcos Kawazoe Aguilera , Svend Frølund , Vassos Hadzilacos , Stephanie Lorraine Horn , Sam Toueg Abortable and query-abortable objects and their efficient implementation. [Citation Graph (0, 0)][DBLP ] Conf ] Panagiota Fatourou , Nikolaos D. Kallimanis Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. [Citation Graph (0, 0)][DBLP ] Conf ] Ittai Abraham , Mahesh Balakrishnan , Fabian Kuhn , Dahlia Malkhi , Venugopalan Ramasubramanian , Kunal Talwar Reconstructing approximate tree metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Beat Gfeller , Elias Vicari A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Costas Busch , Ryan LaFortune , Srikanta Tirthapura Improved sparse covers for graphs excluding a fixed minor. [Citation Graph (0, 0)][DBLP ] Conf ] Goran Konjevod , Andréa W. Richa , Donglin Xia , Hai Yu Compact routing with slack in low doubling dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Dinitz Compact routing with slack. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksandrs Slivkins Towards fast decentralized construction of locality-aware overlay networks. [Citation Graph (0, 0)][DBLP ] Conf ] George Giakkoupis , Vassos Hadzilacos On the complexity of greedy routing in ring-based peer-to-peer networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg Constructing scalable overlays for pub-sub with many topics. [Citation Graph (0, 0)][DBLP ] Conf ] Rachid Guerraoui , Marko Vukolic Refined quorum systems. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Cachin , Abhi Shelat , Alexander Shraer Efficient fork-linearizable access to untrusted shared memory. [Citation Graph (0, 0)][DBLP ] Conf ] James Hendricks , Gregory R. Ganger , Michael K. Reiter Verifying distributed erasure-coded data. [Citation Graph (0, 0)][DBLP ] Conf ] Edmund L. Wong , Praveen Balasubramanian , Lorenzo Alvisi , Mohamed G. Gouda , Vitaly Shmatikov Truth in advertising: lightweight verification of route integrity. [Citation Graph (0, 0)][DBLP ] Conf ] James Caverlee , Ling Liu Countering web spam with credibility-based link analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Lotker , Boaz Patt-Shamir , Adi Rosén Distributed approximate matching. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Korman , Shay Kutten Controller and estimator for dynamic networks. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Emek , Leszek Gasieniec , Erez Kantor , Andrzej Pelc , David Peleg , Chang Su Broadcasting in udg radio networks with unknown topology. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea E. F. Clementi , Francesco Pasquale , Angelo Monti , Riccardo Silvestri Communication in dynamic radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , Srikanta Tirthapura , Bojian Xu Time-decaying sketches for sensor data aggregation. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Haim Kaplan Summarizing data using bottom-k sketches. [Citation Graph (0, 0)][DBLP ] Conf ] Rachid Guerraoui , Maurice Herlihy , Petr Kouznetsov , Nancy A. Lynch , Calvin C. Newport On the weakest failure detector ever. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Biely , Josef Widder , Bernadette Charron-Bost , Antoine Gaillard , Martin Hutle , André Schiper Tolerating corrupted communication. [Citation Graph (0, 0)][DBLP ] Conf ] Haifeng Yu , Phillip B. Gibbons Optimal inter-object correlation when replicating for availability. [Citation Graph (0, 0)][DBLP ] Conf ] Lidong Zhou , Vijayan Prabhakaran , Venugopalan Ramasubramanian , Roy Levin , Chandramohan A. Thekkath Graceful degradation via versions: specifications and implementations. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rohit Khandekar Greedy distributed optimization of multi-commodity flows. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rohit Khandekar Distributed network monitoring and multicommodity flows: a primal-dual approach. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , MohammadTaghi Hajiaghayi , Hamid Mahini , Morteza Zadimoghaddam The price of anarchy in network creation games. [Citation Graph (0, 0)][DBLP ] Conf ] Stefano Leonardi , Piotr Sankowski Network formation games with local coalitions. [Citation Graph (0, 0)][DBLP ] Conf ] Wei Chen , Jialin Zhang , Yu Chen , Xuezheng Liu Partition approach to failure detectors for k-set agreement. [Citation Graph (0, 0)][DBLP ] Conf ] Alejandro Cornejo , Sergio Rajsbaum , Michel Raynal , Corentin Travers Failure detectors are schedulers. [Citation Graph (0, 0)][DBLP ] Conf ] Amitanand S. Aiyer , Lorenzo Alvisi , Rida A. Bazzi Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. [Citation Graph (0, 0)][DBLP ] Conf ] Marcos Kawazoe Aguilera , Ram Swaminathan Remote storage with byzantine servers. [Citation Graph (0, 0)][DBLP ] Conf ] Achour Mostéfaoui , Gilles Trédan Towards the minimal synchrony for byzantine consensus. [Citation Graph (0, 0)][DBLP ] Conf ] Lásaro J. Camargos , Rodrigo Schmidt , Fernando Pedone Multicoordinated Paxos. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Faith Ellen , Panagiota Fatourou The complexity of updating multi-writer snapshot objects. [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Fernández , Michel Raynal From an intermittent rotating star to a leader. [Citation Graph (0, 0)][DBLP ] Conf ] Arpita Patra , Ashish Choudhary , Chanrasekharan Pandu Rangan Constant phase efficient protocols for secure message transmission in directed networks. [Citation Graph (0, 0)][DBLP ] Conf ] Keke Chen , Ling Liu Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbation. [Citation Graph (0, 0)][DBLP ] Conf ] Yitao Duan , John F. Canny Practical private computation of vector addition-based functions. [Citation Graph (0, 0)][DBLP ] Conf ] Aameek Singh , Madhukar R. Korupolu , Bhuvan Bamba Integrated resource allocation in heterogeneous SAN data centers. [Citation Graph (0, 0)][DBLP ] Conf ] Ajay Gulati , Arif Merchant , Peter J. Varman d -clock: distributed QoS in heterogeneous resource environments.Citation Graph (0, 0)][DBLP ] Conf ] Bob Mungamuru , Hector Garcia-Molina , Christopher Olston Configurations: a model for distributed data storage. [Citation Graph (0, 0)][DBLP ] Conf ] Chryssis Georgiou , Peter M. Musial , Alexander A. Shvartsman , Elaine L. Sonderegger A formal treatment of an abstract channel implementation using java sockets and TCP. [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Scott , Michael F. Spear , Luke Dalessandro , Virendra J. Marathe Transactions and privatization in Delaunay triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Michael F. Spear , Virendra J. Marathe , Luke Dalessandro , Michael L. Scott Privatization techniques for software transactional memory. [Citation Graph (0, 0)][DBLP ] Conf ] Torvald Riegel , Christof Fetzer , Heiko Sturzrehm , Pascal Felber From causal to z-linearizable transactional memory. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Eshcar Hillel The power of DCAS: highly-concurrent software transactional memory. [Citation Graph (0, 0)][DBLP ] Conf ] Ming Zhong , Kai Shen , Joel I. Seiferas Object replication degree customization for high availability. [Citation Graph (0, 0)][DBLP ] Conf ] Augustin Chaintreau Sharpness, a tight condition for throughput scalability. [Citation Graph (0, 0)][DBLP ] Conf ] Du Li , Rui Li An analysis of intention preservation in group editors. [Citation Graph (0, 0)][DBLP ] Conf ] HariGovind V. Ramasamy , Mouna Seri , William H. Sanders The coBFIT toolkit. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Gavoille , Arnaud Labourel On local representation of distances in trees. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rohit Khandekar Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomi Dolev , Elad Michael Schiller , Paul G. Spirakis , Philippas Tsigas Game authority for robust andscalable distributed selfish-computer systems. [Citation Graph (0, 0)][DBLP ] Conf ] Allen Clement , Jeff Napper , Harry C. Li , Jean-Philippe Martin , Lorenzo Alvisi , Michael Dahlin Theory of BAR games. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Bilò , Luca Forlizzi , Luciano Gualà , Guido Proietti An algorithm composition scheme preserving monotonicity. [Citation Graph (0, 0)][DBLP ] Conf ] Rica Gonen , Elan Pavlov An incentive-compatible multi-armed bandit mechanism. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rohit Khandekar On cost sharing mechanisms in the network design game. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Aviv Nisgav , Boaz Patt-Shamir Asynchronous recommendation systems. [Citation Graph (0, 0)][DBLP ] Conf ] Anat Bremler-Barr , Nir Chen , Jussi Kangasharju , Osnat Mokryn , Yuval Shavitt Bringing order to BGP: decreasing time and message complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Christian Scheideler A denial-of-service resistant DHT. [Citation Graph (0, 0)][DBLP ] Conf ] Bivas Mitra , Fernando Peruani , Sujoy Ghose , Niloy Ganguly Measuring robustness of superpeer topologies. [Citation Graph (0, 0)][DBLP ] Conf ] Tassos Dimitriou , Ghassan Karame , Ioannis T. Christou SuperTrust: a secure and efficient framework for handling trust in super-peer networks. [Citation Graph (0, 0)][DBLP ] Conf ] Haifeng Yu , Phillip B. Gibbons , Michael Kaminsky Toward an optimal social network defense against Sybil attacks. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Brodsky , Dmitry Brodsky Trinity: distributed defense against transient spam-bots. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Duchon , Nicole Eggemann , Nicolas Hanusse Non-searchability of random scale-free graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Langberg , Moshe Schwartz , Jehoshua Bruck Distributed broadcasting and mapping protocols in directed anonymous networks. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Schiper , Fernando Pedone Optimal atomic broadcast and multicast algorithms for wide area networks. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Baldoni , Kleoni Ioannidou , Alessia Milani Solvability of geocasting in mobile ad-hoc networks. [Citation Graph (0, 0)][DBLP ] Conf ] Hariharan Narayanan Geographic gossip on geometric random graphs via affine combinations. [Citation Graph (0, 0)][DBLP ] Conf ] Wesley W. Terpstra , Christof Leng , Alejandro P. Buchmann Practical summation via gossip. [Citation Graph (0, 0)][DBLP ] Conf ] Lan Lin , Hyunyoung Lee Distributed algorithms for dynamic coverage in sensor networks. [Citation Graph (0, 0)][DBLP ] Conf ] Haifeng Yu DoS-resilient secure aggregation queries in sensor networks. [Citation Graph (0, 0)][DBLP ] Conf ] Joffroy Beauquier , Julien Clement , Stéphane Messika , Laurent Rosaz , Brigitte Rozoy Self-stabilizing counting in mobile sensor networks. [Citation Graph (0, 0)][DBLP ] Conf ] Tushar Deepak Chandra , Robert Griesemer , Joshua Redstone Paxos made live: an engineering perspective. [Citation Graph (0, 0)][DBLP ] Conf ] 