|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1368 occurrences of 620 keywords
|
|
|
Results
Found 2201 publication records. Showing 2201 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Christian Schindelhauer, Zvi Lotker, Johannes Wendeberg |
Network synchronization and localization based on stolen signals. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Majid Khabbazian, Dariusz R. Kowalski |
Time-efficient randomized multiple-message broadcast in radio networks. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal |
Tight bounds on information dissemination in sparse mobile networks. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ji Zhu 0003, Bruce E. Hajek |
Stability of a peer-to-peer communication system. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Jaffe, Thomas Moscibroda, Laura Effinger-Dean, Luis Ceze, Karin Strauss |
The impact of memory models on software reliability in multiprocessors. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Vijay K. Garg, John Bridgman, Bharath Balasubramanian |
Accurate byzantine agreement with feedback. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Boaz Patt-Shamir, Marat Teplitsky |
The round complexity of distributed sorting: extended abstract. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Tsvetomira Radeva, Nancy A. Lynch |
Partial reversal acyclicity. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar |
Incentive-compatible distributed greedy protocols. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel |
The space complexity of long-lived and one-shot timestamp implementations. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The |
Byzantine agreement with homonyms. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Gábor Rétvári, András Gulyás, Zalán Heszberger, Márton Csernai, József Bíró |
Compact policy routing. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Sotiris Kentros, Aggelos Kiayias |
Solving the at-most-once problem with nearly optimal effectiveness. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Moscibroda, Rotem Oshman |
Resilience of mutual exclusion algorithms to transient memory faults. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Bernhard Haeupler, David R. Karger |
Faster information dissemination in dynamic networks via network coding. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Guanfeng Liang, Nitin H. Vaidya |
Error-free multi-valued consensus with byzantine failures. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Valerie King, Jared Saia, Maxwell Young |
Conflict on a communication channel. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Fabian Kuhn, Yoram Moses, Rotem Oshman |
Coordinated consensus in dynamic networks. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev, Mark Moir |
On the power of hardware transactional memory to simplify memory management. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Amos Korman, Shay Kutten, Toshimitsu Masuzawa |
Fast and compact self stabilizing verification, computation, and fault detection of an MST. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Jukka Suomela |
Locally checkable proofs. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou |
Adaptively secure broadcast, revisited. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Kang-Won Lee, Viswanath Nagarajan, Murtaza Zafer |
Minimum congestion mapping in a cloud. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Shlomi Dolev, Panagiota N. Panagopoulou, Mikaël Rabie, Elad Michael Schiller, Paul G. Spirakis |
Rationality authority for provable rational behavior. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Brendan Juba |
Reliable end-user communication under a changing packet network protocol. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Damien Imbs, Sergio Rajsbaum, Michel Raynal |
The universe of symmetry breaking tasks. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Miguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz |
Unbounded contention resolution in multiple-access channels. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech M. Golab |
A complexity separation between the cache-coherent and distributed shared memory models. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Yujie Liu, Michael F. Spear |
A nonblocking set optimized for querying the minimum value. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker |
Order optimal information spreading using algebraic gossip. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas 0001, Marko Vukolic |
Robust data sharing with key-value stores. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech M. Golab, Xiaozhou Li 0001, Mehul A. Shah |
Analyzing consistency properties for fun and profit. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Goran Konjevod, Andréa W. Richa, Donglin Xia, Ling Zhou |
Randomized compact routing in decomposable metrics. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Viry |
Parallel and distributed programming extensions for mainstream languages based on pi-calculus. |
PODC |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin |
Finding mobile data under delay constraints with searching costs. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
partitioning and scheduling, approximation algorithms, design and analysis of algorithms |
1 | Lasse Kliemann |
Brief announcement: the price of anarchy for distributed network formation in an adversary model. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
pairwise nash equilibrium, pairwise stability, game theory, nash equilibrium, price of anarchy, network formation |
1 | Eli Gafni, Petr Kuznetsov |
Brief announcement: on L-resilience, hitting sets, and colorless tasks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed tasks, l-resilience, weak solvability, wait-freedom |
1 | Bivas Mitra, Sujoy Ghose, Niloy Ganguly |
Brief announcement: superpeer formation amidst churn and rewiring. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
bootstrapping protocol, superpeer network, preferential attachment, degree distribution |
1 | Shantanu Das 0001, Paola Flocchini, Nicola Santoro, Masafumi Yamashita |
On the computational power of oblivious robots: forming a series of geometric patterns. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed coordination |
1 | Guanfeng Liang, Nitin H. Vaidya |
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
byzantine agreement |
1 | Roy Friedman, Alex Kogan |
Brief announcement: deterministic dominating set construction in networks with bounded degree. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
dominating sets, bounded degree graphs, distributed approximation algorithms |
1 | Damien Imbs, Michel Raynal |
The multiplicative power of consensus numbers. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
bg simulation, synchronization power, t-resilience, simulation, fault-tolerance, distributed computability, shared memory system, system model, wait-freedom, asynchronous processes, k-set agreement, consensus number, reduction algorithm, process crash failure |
1 | Vibhor Bhatt, Prasad Jayanti |
Constant RMR solutions to reader writer synchronization. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
reader-writer lock, remote memory reference (rmr), synchronization, mutual exclusion |
1 | James Aspnes |
A modular approach to shared-memory consensus, with applications to the probabilistic-write model. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed computing, shared memory, randomization, consensus |
1 | Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg |
Forbidden-set distance labels for graphs of bounded doubling dimension. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
forbidden sets, fault-tolerance, compact routing, doubling dimension, distance labeling |
1 | Efthymia Tsamoura, Anastasios Gounaris, Yannis Manolopoulos |
Brief announcement: on the quest of optimal service ordering in decentralized queries. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
pipelined execution, web services |
1 | Nathan Grasso Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun |
Transactional predication: high-performance concurrent sets and maps for STM. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
concurrent map, semantic conflict detection, transactional predication, software transactional memory |
1 | Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim |
Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
sensor network, routing, approximation algorithm, obstacle avoidance |
1 | Yongmin Tan, Xiaohui Gu, Haixun Wang |
Adaptive system anomaly prediction for large-scale hosting infrastructures. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
anomaly prediction, context-aware prediction model |
1 | Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport, Rotem Oshman, Andréa W. Richa |
Broadcasting in unreliable radio networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Maurice Herlihy, Sergio Rajsbaum |
The topology of shared-memory adversaries. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
fault-tolerance, shared-memory, set agreement, combinatorial topology |
1 | Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Zebenigus Wuhib |
Brief announcement: the accuracy of tree-based counting in dynamic networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed spanning tree, markov model |
1 | Roberto Cortiñas, Iratxe Soraluze Arriola, Alberto Lafuente, Mikel Larrea |
Brief announcement: an efficient failure detector for omission environments. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
general omission model, consensus, failure detector, communication efficiency |
1 | Thomas Sauerwald |
Expansion and the cover time of parallel random walks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
random walks, expander, expansion, cover time |
1 | Fabian Kuhn, Christoph Lenzen 0001, Thomas Locher, Rotem Oshman |
Optimal gradient clock synchronization in dynamic networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
clock synchronization, dynamic networks |
1 | Marco Serafini, Dan Dobre, Matthias Majuntke, Péter Bokor, Neeraj Suri |
Eventually linearizable shared objects. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
eventual linearizability, availability, graceful degradation |
1 | Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov |
Brief announcement: swarming secrets. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
strongly oblivious tm, swarm, multi-party computation |
1 | Spyros Sioutas, George Papaloukopoulos, Evangelos Sakkopoulos, Kostas Tsichlas, Yannis Manolopoulos, Peter Triantafillou |
Brief announcement: ART--sub-logarithmic decentralized range query processing with probabilistic guarantees. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
p2p overlays, distributed infrastructures |
1 | Dinh Nguyen Tran, Jinyang Li 0001, Lakshminarayanan Subramanian, Sherman S. M. Chow |
Brief announcement: improving social-network-based sybil-resilient node admission control. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
social network, sybil attack, gatekeeper |
1 | Alessandra Sala, Haitao Zheng 0001, Ben Y. Zhao, Sabrina Gaito, Gian Paolo Rossi 0001 |
Brief announcement: revisiting the power-law degree distribution for social graph analysis. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
pareto-lognormal, social networks, power-law |
1 | Andrea Clementi, Angelo Monti, Riccardo Silvestri |
Fast flooding over Manhattan. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
flooding protocols, random way-point model, mobile ad-hoc networks |
1 | Bo Zhang 0016, Binoy Ravindran |
Brief announcement: queuing or priority queuing? on the design of cache-coherence protocols for distributed transactional memory. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed queuing, transactional memory, cache-coherence protocols |
1 | Kai Lu, Ruibo Wang, Xicheng Lu |
Brief announcement: NUMA-aware transactional memory. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
transactional memory, numa |
1 | Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali |
Efficient distributed random walks with applications. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
decentralized computation, random spanning tree, distributed algorithms, random walks, random sampling, mixing time |
1 | Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh |
Verifying linearizability with hindsight. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
hindsight, linearizability, wait-freedom, optimistic concurrency |
1 | Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel |
Non-blocking binary search trees. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
shared memory, non-blocking, binary search tree, cas |
1 | Michael Backes 0001, Stefan Lorenz, Matteo Maffei, Kim Pecina |
Brief announcement: anonymity and trust in distributed systems. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
anonymity in decentralized systems, formal verification, cryptographic protocols |
1 | Wojciech M. Golab |
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
locally-accessible implementations, distributed shared memory, shared objects, remote memory references |
1 | Kewei Sun, Ying Li 0012, Jing Luo |
Brief announcement: network traffic can optimize consolidation during transformation to virtualization. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela |
Brief announcement: distributed almost stable marriage. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
almost stable matching, local algorithm |
1 | Zuzana Beerliová-Trubíniová, Martin Hirt, Jesper Buus Nielsen |
On the theoretical gap between synchronous and asynchronous MPC protocols. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
cryptography, multi-party computation, asynchronous network, mpc |
1 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan |
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
information theoretic security |
1 | Annette Bieniusa, Arie Middelkoop, Peter Thiemann 0001 |
Brief announcement: actions in the twilight - concurrent irrevocable transactions and inconsistency repair. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
irrevocable transactions, consistency, software transactional memory |
1 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
How to meet when you forget: log-space rendezvous in arbitrary graphs. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
exploration, rendezvous, compact data structure |
1 | Yuval Emek, Amos Korman |
Efficient threshold detection in a distributed environment: extended abstract. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
threshold detection, transmission complexity, message complexity |
1 | Matthew P. Johnson 0001, Amotz Bar-Noy |
Brief announcement: pan and scan. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
directional sensors, coverage, targets |
1 | Eric A. Brewer |
A certain freedom: thoughts on the CAP theorem. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
cap theorem |
1 | Hagit Attiya |
The inherent complexity of transactional memory and what to do about it. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
mini-transactions, lower bounds, transactional memory |
1 | Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse |
Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? |
PODC |
2010 |
DBLP DOI BibTeX RDF |
faulty networks, distributed computing, mobile agents, random walks, expanders |
1 | Keren Censor-Hillel, Hadas Shachnai |
Partial information spreading with application to distributed maximum coverage. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
maximum coverage, partial information spreading, weak conductance, approximation algorithms, distributed computing, randomized algorithms |
1 | Bo Zhang 0016, Binoy Ravindran |
Brief announcement: on enhancing concurrency in distributed transactional memory. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
concurrency, transactional memory |
1 | Dmitry Basin, Ken Birman, Idit Keidar, Ymir Vigfusson |
Brief announcement: sources of instability in data center multicast. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
tcp overlay, multicast, data center |
1 | Ittay Eyal, Idit Keidar, Raphael Rom |
Distributed data classification in sensor networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed classification, gossip |
1 | Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz |
Online set packing and competitive scheduling of multi-part tasks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
multi-packet frames, online set packing, packet fragmentation, competitive analysis |
1 | Joffroy Beauquier, Janna Burman, Julien Clément 0002, Shay Kutten |
On utilizing speed in networks of mobile agents. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
gathering problem, lower/upper bounds, networks of mobile agents, population protocols, cover time |
1 | Robert Danek |
The k-bakery: local-spin k-exclusion using non-atomic reads and writes. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
k-exclusion, safe registers, shared memory, mutual exclusion, remote memory references |
1 | Christoph Lenzen 0001, Roger Wattenhofer |
Brief announcement: exponential speed-up of local algorithms using non-local communication. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
simulation, local algorithms, all-to-all communication |
1 | Valerie King, Jared Saia |
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
samplers, peer-to-peer, distributed computing, consensus, secret-sharing, byzantine agreement, monte carlo algorithms |
1 | Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski |
Meeting the deadline: on the complexity of fault-tolerant continuous gossip. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
crashes and restarts, dynamic rumor injection, gossip, expander graphs |
1 | Leonid Barenboim, Michael Elkin |
Deterministic distributed vertex coloring in polylogarithmic time. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
arbdefective-coloring, arboricity, partial-orientation |
1 | Damien Imbs, Michel Raynal, Gadi Taubenfeld |
On asymmetric progress conditions. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
fault-freedom, progress condition, liveness, process crash, wait-freedom, obstruction-freedom, asynchronous shared memory system, consensus number |
1 | Hagit Attiya, Eshcar Hillel |
Brief announcement: single-version permissive STM. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
transactional memory, permissiveness |
1 | Arpita Patra, C. Pandu Rangan |
Brief announcement: communication efficient asynchronous byzantine agreement. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
asynchronous, information theoretic security |
1 | Andréa W. Richa, Jin Zhang 0007, Christian Scheideler, Stefan Schmid 0001 |
Brief announcement: towards robust medium access in multi-hop networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
wireless ad-hoc networks, jamming, mac protocols |
1 | Mehrdad Nojoumian, Douglas R. Stinson |
Brief announcement: secret sharing based on the social behaviors of players. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
social secret sharing, unconditional security |
1 | Saurav Pandit, Sriram V. Pemmaraju |
Rapid randomized pruning for fast greedy distributed algorithms. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
distributed algorithms, randomized algorithms, greedy algorithms, facility location, primal-dual algorithms, minimum dominating set |
1 | Johannes Schneider 0002, Roger Wattenhofer |
A new technique for distributed symmetry breaking. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
parallel algorithms, coloring, local algorithms, symmetry breaking, network decomposition |
1 | Christoph Lucas, Dominik Raub, Ueli M. Maurer |
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
hybrid security, party emulation, computational security, information-theoretic security, universal composability, multi-party computation |
1 | Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer |
Brief announcement: self-monitoring in dynamic wireless networks. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
wireless, monitoring, group membership |
1 | Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz |
Bayesian ignorance. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
local vs. global view, network cost sharing, bayesian games |
|
|