default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th PODC 2007: Portland, Oregon, USA
- Indranil Gupta, Roger Wattenhofer:
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM 2007, ISBN 978-1-59593-616-5 - Marc Tremblay:
Transactional memory for a modern microprocessor. 1 - Tom Leighton:
The Akamai approach to achieving performance and reliability on the internet. 2
Multiprocessor, multicore, shared memory
- Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. 3-12 - Faith Ellen, Yossi Lev, Victor Luchangco, Mark Moir:
SNZI: scalable NonZero indicators. 13-22 - Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg:
Abortable and query-abortable objects and their efficient implementation. 23-32 - Panagiota Fatourou, Nikolaos D. Kallimanis
:
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. 33-42
Graph algorithms
- Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar:
Reconstructing approximate tree metrics. 43-52 - Beat Gfeller, Elias Vicari:
A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. 53-60 - Costas Busch, Ryan LaFortune, Srikanta Tirthapura:
Improved sparse covers for graphs excluding a fixed minor. 61-70 - Goran Konjevod, Andréa W. Richa, Donglin Xia, Hai Yu:
Compact routing with slack in low doubling dimension. 71-80 - Michael Dinitz:
Compact routing with slack. 81-88
Peer-to-peer systems
- Aleksandrs Slivkins:
Towards fast decentralized construction of locality-aware overlay networks. 89-98 - George Giakkoupis, Vassos Hadzilacos:
On the complexity of greedy routing in ring-based peer-to-peer networks. 99-108 - Gregory V. Chockler, Roie Melamed, Yoav Tock, Roman Vitenberg:
Constructing scalable overlays for pub-sub with many topics. 109-118
Security
- Rachid Guerraoui, Marko Vukolic:
Refined quorum systems. 119-128 - Christian Cachin, Abhi Shelat, Alexander Shraer:
Efficient fork-linearizable access to untrusted shared memory. 129-138 - James Hendricks, Gregory R. Ganger, Michael K. Reiter:
Verifying distributed erasure-coded data. 139-146 - Edmund L. Wong, Praveen Balasubramanian, Lorenzo Alvisi, Mohamed G. Gouda, Vitaly Shmatikov:
Truth in advertising: lightweight verification of route integrity. 147-156 - James Caverlee, Ling Liu:
Countering web spam with credibility-based link analysis. 157-166
Local & dynamic algorithms
- Zvi Lotker, Boaz Patt-Shamir, Adi Rosén:
Distributed approximate matching. 167-174 - Amos Korman, Shay Kutten:
Controller and estimator for dynamic networks. 175-184 - Michael Elkin:
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. 185-194
Radio networks and aggregation
- Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su:
Broadcasting in udg radio networks with unknown topology. 195-204 - Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri:
Communication in dynamic radio networks. 205-214 - Graham Cormode, Srikanta Tirthapura, Bojian Xu:
Time-decaying sketches for sensor data aggregation. 215-224 - Edith Cohen, Haim Kaplan:
Summarizing data using bottom-k sketches. 225-234
Fault tolerance
- Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, Calvin C. Newport:
On the weakest failure detector ever. 235-243 - Martin Biely, Josef Widder, Bernadette Charron-Bost, Antoine Gaillard, Martin Hutle, André Schiper:
Tolerating corrupted communication. 244-253 - Haifeng Yu, Phillip B. Gibbons:
Optimal inter-object correlation when replicating for availability. 254-263 - Lidong Zhou, Vijayan Prabhakaran, Venugopalan Ramasubramanian, Roy Levin, Chandramohan A. Thekkath:
Graceful degradation via versions: specifications and implementations. 264-273
Economical aspects
- Baruch Awerbuch, Rohit Khandekar:
Greedy distributed optimization of multi-commodity flows. 274-283 - Baruch Awerbuch, Rohit Khandekar:
Distributed network monitoring and multicommodity flows: a primal-dual approach. 284-291 - Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam:
The price of anarchy in network creation games. 292-298 - Stefano Leonardi, Piotr Sankowski:
Network formation games with local coalitions. 299-305
Brief announcements - track A
- Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu:
Partition approach to failure detectors for k-set agreement. 306-307 - Alejandro Cornejo, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
Failure detectors are schedulers. 308-309 - Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. 310-311 - Marcos Kawazoe Aguilera, Ram Swaminathan:
Remote storage with byzantine servers. 312-313 - Achour Mostéfaoui, Gilles Trédan:
Towards the minimal synchrony for byzantine consensus. 314-315 - Lásaro J. Camargos, Rodrigo Schmidt, Fernando Pedone:
Multicoordinated Paxos. 316-317 - Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating multi-writer snapshot objects. 318-319 - Antonio Fernández, Michel Raynal:
From an intermittent rotating star to a leader. 320-321 - Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan:
Constant phase efficient protocols for secure message transmission in directed networks. 322-323 - Keke Chen, Ling Liu:
Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbation. 324-325 - Yitao Duan, John F. Canny:
Practical private computation of vector addition-based functions. 326-327 - Aameek Singh, Madhukar R. Korupolu, Bhuvan Bamba:
Integrated resource allocation in heterogeneous SAN data centers. 328-329 - Ajay Gulati, Arif Merchant, Peter J. Varman:
d-clock: distributed QoS in heterogeneous resource environments. 330-331 - Bob Mungamuru, Hector Garcia-Molina, Christopher Olston:
Configurations: a model for distributed data storage. 332-333 - Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger:
A formal treatment of an abstract channel implementation using java sockets and TCP. 334-335 - Michael L. Scott, Michael F. Spear, Luke Dalessandro, Virendra J. Marathe:
Transactions and privatization in Delaunay triangulation. 336-337 - Michael F. Spear, Virendra J. Marathe, Luke Dalessandro, Michael L. Scott:
Privatization techniques for software transactional memory. 338-339 - Torvald Riegel, Christof Fetzer, Heiko Sturzrehm, Pascal Felber:
From causal to z-linearizable transactional memory. 340-341 - Hagit Attiya, Eshcar Hillel:
The power of DCAS: highly-concurrent software transactional memory. 342-343 - Ming Zhong, Kai Shen, Joel I. Seiferas:
Object replication degree customization for high availability. 344-345 - Augustin Chaintreau:
Sharpness, a tight condition for throughput scalability. 346-347 - Du Li, Rui Li:
An analysis of intention preservation in group editors. 348-349 - HariGovind V. Ramasamy, Mouna Seri, William H. Sanders:
The coBFIT toolkit. 350-351
Brief announcements - track B
- Cyril Gavoille, Arnaud Labourel:
On local representation of distances in trees. 352-353 - Baruch Awerbuch, Rohit Khandekar:
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. 354-355 - Shlomi Dolev, Elad Michael Schiller, Paul G. Spirakis, Philippas Tsigas:
Game authority for robust andscalable distributed selfish-computer systems. 356-357 - Allen Clement, Jeff Napper, Harry C. Li, Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin:
Theory of BAR games. 358-359 - Davide Bilò, Luca Forlizzi, Luciano Gualà, Guido Proietti:
An algorithm composition scheme preserving monotonicity. 360-361 - Rica Gonen, Elan Pavlov:
An incentive-compatible multi-armed bandit mechanism. 362-363 - Baruch Awerbuch, Rohit Khandekar:
On cost sharing mechanisms in the network design game. 364-365 - Baruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir:
Asynchronous recommendation systems. 366-367 - Anat Bremler-Barr, Nir Chen, Jussi Kangasharju, Osnat Mokryn, Yuval Shavitt:
Bringing order to BGP: decreasing time and message complexity. 368-369 - Baruch Awerbuch, Christian Scheideler:
A denial-of-service resistant DHT. 370-371 - Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy Ganguly:
Measuring robustness of superpeer topologies. 372-373 - Tassos Dimitriou, Ghassan Karame, Ioannis T. Christou:
SuperTrust: a secure and efficient framework for handling trust in super-peer networks. 374-375 - Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky:
Toward an optimal social network defense against Sybil attacks. 376-377 - Alex Brodsky, Dmitry Brodsky:
Trinity: distributed defense against transient spam-bots. 378-379 - Philippe Duchon, Nicole Eggemann, Nicolas Hanusse:
Non-searchability of random scale-free graphs. 380-381 - Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Distributed broadcasting and mapping protocols in directed anonymous networks. 382-383 - Nicolas Schiper, Fernando Pedone:
Optimal atomic broadcast and multicast algorithms for wide area networks. 384-385 - Roberto Baldoni, Kleoni Ioannidou, Alessia Milani:
Solvability of geocasting in mobile ad-hoc networks. 386-387 - Hariharan Narayanan:
Geographic gossip on geometric random graphs via affine combinations. 388-389 - Wesley W. Terpstra, Christof Leng, Alejandro P. Buchmann:
Practical summation via gossip. 390-391 - Lan Lin, Hyunyoung Lee:
Distributed algorithms for dynamic coverage in sensor networks. 392-393 - Haifeng Yu:
DoS-resilient secure aggregation queries in sensor networks. 394-395 - Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy:
Self-stabilizing counting in mobile sensor networks. 396-397 - Tushar Deepak Chandra, Robert Griesemer, Joshua Redstone:
Paxos made live: an engineering perspective. 398-407
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-02 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
