Causality, influence, and computation in possibly disconnected synchronous dynamic networks
type: Item
instance of: scholarly article
title: Causality, influence, and computation in possibly disconnected synchronous dynamic networks
zbMATH Open document ID: 1327.68046
author: Othon Michail
author: Ioannis Chatzigiannakis
author: P. G. Spirakis
published in: Journal of Parallel and Distributed Computing
publication date: 2015-12-18T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6521937
zbMATH Keywords: dynamic graph
zbMATH Keywords: mobile computing
zbMATH Keywords: worst-case dynamicity
zbMATH Keywords: adversarial schedule
zbMATH Keywords: temporal connectivity
zbMATH Keywords: termination
zbMATH Keywords: counting
zbMATH Keywords: information dissemination
zbMATH Keywords: optimal protocol
Wikidata QID: Q57607983
MaRDI profile type: Publication
OpenAlex ID: W1983815693
cites work: Computation in networks of passively mobile finite-state sensors
cites work: The computational power of population protocols
cites work: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
cites work: Q5743420
cites work: Parsimonious flooding in dynamic graphs
cites work: Q4398864
cites work: Flooding time in edge-Markovian dynamic graphs
cites work: Passively mobile communicating machines that use restricted space
cites work: Self-stabilization
cites work: On the Complexity of Information Spreading in Dynamic Networks
cites work: Analyzing network coding gossip made easy
cites work: Connectivity and inference problems for temporal networks
cites work: Distributed computation in dynamic networks
cites work: Coordinated consensus in dynamic networks
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: Q3126969
cites work: Mediated population protocols
cites work: Temporal Network Optimization Subject to Connectivity Constraints
cites work: Q4736826
cites work: The Mathematical Coloring Book
DOI: 10.1016/J.JPDC.2013.07.007
description: scientific article; zbMATH DE number 6521937