@inproceedings{f6806b92aaa94fdda40a1eb6fa6846ab,
title = "Non-local probes do not help with many graph problems",
abstract = "This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to be much more powerful than distributed message-passing algorithms: centralised algorithms can directly probe any part of the input, while in distributed algorithms nodes can only communicate with their immediate neighbours. We show that for a large class of graph problems, this extra freedom does not help centralised algorithms at all: efficient stateless deterministic centralised local algorithms can be simulated with efficient distributed message-passing algorithms. In particular, this enables us to transfer existing lower bound results from distributed algorithms to centralised local algorithms.",
author = "Mika G{\"o}{\"o}s and Juho Hirvonen and Reut Levi and Moti Medina and Jukka Suomela",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2016.; 30th International Symposium on Distributed Computing, DISC 2016 ; Conference date: 27-09-2016 Through 29-09-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-662-53426-7_15",
language = "الإنجليزيّة",
isbn = "9783662534250",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "201--214",
editor = "Cyril Gavoille and David Ilcinkas",
booktitle = "Distributed Computing - 30th International Symposium, DISC 2016, Proceedings",
address = "ألمانيا",
}