Author image not provided
 Peter Robinson

 homepage
 peter.robinsonatmonoid.at

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article2.52
Citation Count63
Publication count25
Publication years2008-2017
Available for download13
Average downloads per article241.46
Downloads (cumulative)3,139
Downloads (12 Months)771
Downloads (6 Weeks)130
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


29 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 29
Result page: 1 2

Sort by:

1 published by ACM
July 2018 PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 18,   Downloads (Overall): 18

Full text available: PDFPDF
In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in ...
Keywords: conductance, implicit leader election, leader election, mixing time, random walks

2 published by ACM
July 2018 SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 41,   Downloads (12 Months): 41,   Downloads (Overall): 41

Full text available: PDFPDF
Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$ machines jointly perform computations on graphs with n nodes (typically, $n \gg k$). The input graph is assumed ...

3 published by ACM
June 2018 ACM Transactions on Parallel Computing (TOPC): Volume 5 Issue 1, July 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 14,   Downloads (12 Months): 42,   Downloads (Overall): 42

Full text available: PDFPDF
Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where k ≥2 machines jointly perform computations on graphs with n nodes (typically, n ≫ k ). The input graph ...
Keywords: Distributed graph algorithms, graph connectivity, graph sketching, minimum spanning trees

4 published by ACM
January 2018 ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 58,   Downloads (Overall): 58

Full text available: PDFPDF
Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. ...
Keywords: Distributed Algorithm, Leader Election, Message Complexity, Lower Bounds, Randomized Algorithm, Time Complexity

5 published by ACM
July 2017 PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 63,   Downloads (Overall): 68

Full text available: PDFPDF
We study local symmetry breaking problems in the Congest model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. Our work is motivated by the following central question: can we break the long-standing Θ(log n) time-complexity barrier and the Θ(m) message-complexity barrier in the Congest ...
Keywords: congest model, local model, maximal independent set, message complexity, round complexity, ruling sets, symmetry breaking

6 published by ACM
July 2017 PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 6,   Downloads (12 Months): 76,   Downloads (Overall): 82

Full text available: PDFPDF
Consider the classical problem of information dissemination: one (or more) nodes in a network have some information that they want to distribute to the remainder of the network. In this paper, we study the cost of information dissemination in networks where edges have latencies, i.e., sending a message from one ...
Keywords: critical latency, gossip, guessing game, information dissemination, latencies, weighted conductance, weighted spanner

7 published by ACM
June 2017 STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 170,   Downloads (Overall): 231

Full text available: PDFPDF
This paper presents a randomized (Las Vegas) distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in ?( D + â?? n ) time and exchanges ?( m ) messages (both with high probability), ...
Keywords: Distributed algorithms, Minimum spanning trees

8 published by ACM
July 2016 SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 6,   Downloads (12 Months): 118,   Downloads (Overall): 280

Full text available: PDFPDF
Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where k ≥ 2 machines jointly perform computations on graphs with n nodes (typically, n gg k). The input graph ...
Keywords: distributed graph algorithms, massive graphs, minimum spanning trees, graph connectivity, graph sketching

9
June 2016 Distributed Computing: Volume 29 Issue 3, June 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present a fully-distributed self-healing algorithm dex that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders--whose expansion properties hold deterministically--that works even under an all-powerful adaptive adversary that controls the dynamic changes ...

10 published by ACM
March 2016 ACM SIGACT News: Volume 47 Issue 1, March 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 84,   Downloads (Overall): 154

Full text available: PDFPDF

11
November 2015 Journal of Computer and System Sciences: Volume 81 Issue 7, November 2015
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 1

We introduce a rigorous framework for modeling churn in a dynamic distributed network.We provide a fast algorithm to reach agreement even with εn nodes churning per time step.We provide a fast algorithm that can tolerate O ( ( n ) ) nodes churning per round against the harder adaptive adversary.We ...
Keywords: Dynamic networks, Churn, Fault-tolerance, P2P networks, Agreement, Distributed computation, Randomization

12
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy churn (i.e., ...

13
October 2015 DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy churn i.e., nodes can join and leave the network continuously over time. We assume the full information model where the Byzantine nodes have complete ...

14
January 2015 Theoretical Computer Science: Volume 561 Issue PB, January 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 1

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O ( 1 ) rounds and (with high probability) uses only O ( n log 3 / 2 ? n ) messages to elect a unique ...
Keywords: Leader election, Lower bound, Randomization, Distributed algorithm

15 published by ACM
July 2013 SPAA '13: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Downloads (Overall): 206

Full text available: PDFPDF
We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that ...
Keywords: distributed algorithm, search, storage, dynamic network, expander graph, randomized algorithm

16 published by ACM
July 2013 PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 13,   Downloads (12 Months): 53,   Downloads (Overall): 427

Full text available: PDFPDF
We study Byzantine agreement in dynamic networks where topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). Our main contributions are randomized distributed algorithms that achieve almost-everywhere Byzantine agreement with high probability even under ...
Keywords: byzantine agreement, distributed algorithm, dynamic network, expander graph, randomized algorithm

17 published by ACM
July 2013 PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Downloads (Overall): 424

Full text available: PDFPDF
Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have ...
Keywords: distributed algorithm, leader election, lower bound

18
July 2013 ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Basic graph structures such as maximal independent sets (MIS's) have spurred much theoretical research in distributed algorithms, and have several applications in networking and distributed computing as well. However, the extant (distributed) algorithms for these problems do not necessarily guarantee fault-tolerance or load-balance properties: For example, in a star-graph, the ...

19
January 2012 SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Downloads (Overall): 373

Full text available: PDFPDF
Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to ...
Keywords: dynamic network, expander graph, randomized algorithm, distributed algorithm, stable agreement, peer-to-peer network

20
December 2011 OPODIS'11: Proceedings of the 15th international conference on Principles of Distributed Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Despite of being quite similar (agreement) problems, 1-set agreement (consensus) and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous systems with crash failures: Rather than the relatively simple bivalence arguments as in the impossibility proof for consensus in the presence of a single crash failure, ...
Keywords: consensus, k-set agreement, impossibility proofs, failure detectors



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us