Causality, influence, and computation in possibly disconnected synchronous dynamic networks

DOI10.1016/J.JPDC.2013.07.007MaRDI QIDQ897391zbMATH OpenOpenAlexWikidataFDO

Authors Othon Michail, Ioannis Chatzigiannakis, P. G. Spirakis

Publication date 18 December 2015

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.759.6667

zbMATH Keywords

countinginformation disseminationterminationmobile computingoptimal protocoldynamic graphadversarial scheduletemporal connectivityworst-case dynamicity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Computing in dynamic networks
• Distributed computation in dynamic networks
• Lower bounds on information dissemination in dynamic networks
• Distributed computation in dynamic networks via random walks
• Non trivial computations in anonymous dynamic networks

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2086372 (Why is no real title available?)
• Analyzing network coding gossip made easy
• Computation in networks of passively mobile finite-state sensors
• Connectivity and inference problems for temporal networks
• Coordinated consensus in dynamic networks
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Mediated population protocols
• On the complexity of information spreading in dynamic networks
• Parsimonious flooding in dynamic graphs
• Passively mobile communicating machines that use restricted space
• Self-stabilization
• Temporal network optimization subject to connectivity constraints
• The Mathematical Coloring Book
• The computational power of population protocols
• Time, clocks, and the ordering of events in a distributed system
• Towards robust and efficient computation in dynamic peer-to-peer networks

Cited in

(17)

• The computational power of simple protocols for self-awareness on graphs
• On the expressivity of time-varying graphs
• Traveling salesman problems in temporal graphs
• Beyond rings: gathering in 1-interval connected graphs
• A faster exact-counting protocol for anonymous dynamic networks
• Exploration of the T-interval-connected dynamic graphs: the case of the ring
• The complexity of optimal design of temporally connected graphs
• On verifying and maintaining connectivity of interval temporal networks
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• Parity games on temporal graphs
• Temporal network optimization subject to connectivity constraints
• Non-strict Temporal Exploration
• Distributed computation in dynamic networks
• A glimpse at Paul G. Spirakis
• Computing in dynamic networks
• Connectivity preserving network transformers

This page was built for publication: Causality, influence, and computation in possibly disconnected synchronous dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897391)