Conferences in DBLP
Refining the way to consensus. [Citation Graph (, )][DBLP ] Memory models: a case for rethinking parallel languages and hardware. [Citation Graph (, )][DBLP ] Emerging challenges and opportunities in parallel computing: the cretaceous redux? [Citation Graph (, )][DBLP ] The life and times of a zookeeper. [Citation Graph (, )][DBLP ] Cassandra: structured storage system on a P2P network. [Citation Graph (, )][DBLP ] Pregel: a system for large-scale graph processing. [Citation Graph (, )][DBLP ] Preventing versus curing: avoiding conflicts in transactional memories. [Citation Graph (, )][DBLP ] Dynamic atomic storage without consensus. [Citation Graph (, )][DBLP ] Randomized mutual exclusion in O(log N / log log N) RMRs. [Citation Graph (, )][DBLP ] Max registers, counters, and monotone circuits. [Citation Graph (, )][DBLP ] Tight bounds for clock synchronization. [Citation Graph (, )][DBLP ] Load balancing without regret in the bulletin board model. [Citation Graph (, )][DBLP ] Concurrent imitation dynamics in congestion games. [Citation Graph (, )][DBLP ] Extracting quorum failure detectors. [Citation Graph (, )][DBLP ] The weakest failure detector for solving k-set agreement. [Citation Graph (, )][DBLP ] Simple and efficient asynchronous byzantine agreement with optimal resilience. [Citation Graph (, )][DBLP ] Partial synchrony based on set timeliness. [Citation Graph (, )][DBLP ] Fast scalable deterministic consensus for crash failures. [Citation Graph (, )][DBLP ] The forgiving graph: a distributed data structure for low stretch under adversarial attack. [Citation Graph (, )][DBLP ] A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. [Citation Graph (, )][DBLP ] The flip markov chain and a randomising P2P protocol. [Citation Graph (, )][DBLP ] Correctness of gossip-based membership under message loss. [Citation Graph (, )][DBLP ] Fast distributed random walks. [Citation Graph (, )][DBLP ] Distributed and parallel algorithms for weighted vertex cover and other covering problems. [Citation Graph (, )][DBLP ] Return of the primal-dual: distributed metric facilitylocation. [Citation Graph (, )][DBLP ] The wireless synchronization problem. [Citation Graph (, )][DBLP ] SINR diagrams: towards algorithmically usable SINR models of wireless networks. [Citation Graph (, )][DBLP ] Coloring unstructured wireless multi-hop networks. [Citation Graph (, )][DBLP ] Oblivious interference scheduling. [Citation Graph (, )][DBLP ] Efficient broadcasting in known topology radio networks with long-range interference. [Citation Graph (, )][DBLP ] The effect of power-law degrees on the navigability of small worlds: [extended abstract]. [Citation Graph (, )][DBLP ] Bounding the locality of distributed routing algorithms. [Citation Graph (, )][DBLP ] Parsimonious flooding in dynamic graphs. [Citation Graph (, )][DBLP ] Brief announcement: Stateless distributed algorithms for generalized packing linear programs. [Citation Graph (, )][DBLP ] Brief announcement: concurrent non-commutative boosted transactions. [Citation Graph (, )][DBLP ] Brief announcement: distributed phase synchronization of dynamic set of processes. [Citation Graph (, )][DBLP ] Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipelining. [Citation Graph (, )][DBLP ] Brief announcement: perfectly secure message transmission in directed networks re-visited. [Citation Graph (, )][DBLP ] Brief announcement: virtual world consistency: a new condition for STM systems. [Citation Graph (, )][DBLP ] Brief announcement: a note on distributed stable matching. [Citation Graph (, )][DBLP ] On a selfish caching game. [Citation Graph (, )][DBLP ] Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed. [Citation Graph (, )][DBLP ] The disagreement power of an adversary: extended abstract. [Citation Graph (, )][DBLP ] Brief announcement: weakest failure detectors via an egg-laying simulation. [Citation Graph (, )][DBLP ] Brief announcement: optimization based rate allocation for application layer multicast. [Citation Graph (, )][DBLP ] Brief announcement: the price of anonymity: optimal consensus despite asynchrony, crash and anonymity. [Citation Graph (, )][DBLP ] Brief announcement: minimum spanning trees and cone-based topology control. [Citation Graph (, )][DBLP ] Brief announcement: locality-based aggregate computation in wireless sensor networks. [Citation Graph (, )][DBLP ] Brief announcement: tight lower bounds for greedy routing in uniform small world rings. [Citation Graph (, )][DBLP ] Brief announcement: optimal self-stabilizing multi-token ring: a randomized solution. [Citation Graph (, )][DBLP ] Brief announcement: fast scalable Byzantine agreement in the full information model with a nonadaptive adversary. [Citation Graph (, )][DBLP ] Brief announcement: PUSH, a DISC shell. [Citation Graph (, )][DBLP ] Brief announcement: deaf, dumb, and chatting robots. [Citation Graph (, )][DBLP ] Brief announcement: global consistency can be easier than point-to-point communication. [Citation Graph (, )][DBLP ] Vertical paxos and primary-backup replication. [Citation Graph (, )][DBLP ] Brief announcement: topology knowledge affects probabilistic reliable communication. [Citation Graph (, )][DBLP ] Brief announcement: a platform for experimenting with mobile algorithms in a laboratory. [Citation Graph (, )][DBLP ] Brief announcement: the theory of network tracing. [Citation Graph (, )][DBLP ] Brief announcement: (more) efficient pruning of ad-hoc wireless networks. [Citation Graph (, )][DBLP ] Brief announcement: self-assembly as graph grammar as distributed system. [Citation Graph (, )][DBLP ] Distributed discovery of large near-cliques. [Citation Graph (, )][DBLP ] Brief announcement: lightweight key agreement and digital certificates for wireless sensor networks. [Citation Graph (, )][DBLP ] Brief announcement: distributed algorithms for approximating wireless network capacity. [Citation Graph (, )][DBLP ] Brief announcement: hardness of broadcasting in wireless networks with unreliable communication. [Citation Graph (, )][DBLP ] Brief announcement: complexity analysis and algorithm design for pipeline configuration in distributed networks. [Citation Graph (, )][DBLP ] Brief announcement: exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum networks. [Citation Graph (, )][DBLP ] Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters. [Citation Graph (, )][DBLP ] Brief announcement: collaborative measurement of upload speeds in P2P systems. [Citation Graph (, )][DBLP ] Brief announcement: new bounds for the controller problem. [Citation Graph (, )][DBLP ] 