Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Networks ��� Network algorithms"'
Autor:
Hecker, Artur, Schmid, Stefan, Schulzrinne, Henning, Hügerich, Lily, Laki, Sándor, Salem, Iosif
This report documents the program and the outcomes of Dagstuhl Seminar 22471 "Towards More Flexible and Automated Communication Networks". Communication network are becoming more and more automated, allowing to overcome human configuration errors (a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::888ac0ed7e1d06b1aae795def70a8b3a
We present a new algorithmic framework for distributed network optimization in the presence of eavesdropper adversaries, also known as passive wiretappers. In this setting, the adversary is listening to the traffic exchanged over a fixed set of edges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee5c96ef62c4d12d188c1e36e66f9968
Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks
Data dissemination is a fundamental task in distributed computing. This paper studies broadcast problems in various innovative models where the communication network connecting $n$ processes is dynamic (e.g., due to mobility or failures) and controll
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a40e0e13f83e60aedf0d71147929060f
Identifying influential nodes in a network is arguably one of the most important tasks in graph mining and network analysis. A large variety of centrality measures, all aiming at correctly quantifying a node’s importance in the network, have been f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6590a0a5561093c200d1667ffe15362d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
For a source node, v, and target node, w, the traceroute command iteratively issues "kth-hop" queries, for k = 1, 2, ��� , ��(v,w), which return the name of the kth vertex on a shortest path from v to w, where ��(v,w) is the distance be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ead2172619a1678fda0d25832efe236
The possibilities offered by quantum computing have drawn attention in the distributed computing community recently, with several breakthrough results showing quantum distributed algorithms that run faster than the fastest known classical counterpart
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e876a443b0ce071fb1af6523aad452f9
Autor:
Aspnes, James, Michail, Othon
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), pages 0:i-0:xvi
LIPIcs, Vol. 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), pages 0:i-0:xvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4e18ddd61ca5690a4052b04939f8740