Distributed Monitoring of Network Properties: The Power of Hybrid Networks

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Colloquium on Automata, Languages and Programming

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.4230/LIPIcs.ICALP.2017.137
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distributed Computing Column 61: Distributed Algorithmic Foundations of Dynamic Networks

  2016cited by this paper
• Algebraic methods in the congested clique

  2015cited by this paper
• Estimating the number of connected components in sublinear time

  2014cited by this paper
• On the power of the congested clique model

  2014cited by this paper
• Continuous Aggregation in Dynamic Ad-Hoc Networks

  2014cited by this paper
• On the Complexity of Information Spreading in Dynamic Networks

  2013cited by this paper
• Simple and efficient local codes for distributed stable network construction

  2013cited by this paper
• Optimal deterministic routing and sorting on the congested clique

  2012cited by this paper
• Faster information dissemination in dynamic networks via network coding

  2011cited by this paper
• Finding Euler Tours in Parallel

  2011cited by this paper
• Distributed computation in dynamic networks

  2010cited by this paper
• Foundations of aggregation and synchronization in distributed systems

  2009cited by this paper
• Distributed computation of the mode

  2008cited by this paper
• Tight bounds for distributed selection

  2007cited by this paper
• Fast construction of overlay networks

  2005cited by this paper
• Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

  2005cited by this paper
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds

  2005cited by this paper
• Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

  2004cited by this paper
• A faster distributed protocol for constructing a minimum spanning tree

  2004cited by this paper
• Tapestry: a resilient global-scale overlay for service deployment

  2004cited by this paper
• Estimating the weight of metric minimum spanning trees in sublinear-time

  2004cited by this paper
• Approximating the Minimum Spanning Tree Weight in Sublinear Time

  2001cited by this paper
• Random graphs with arbitrary degree distributions and their applications.

  2000cited by this paper
• The structure of scientific collaboration networks.

  2000cited by this paper
• Distributed Computing: Fundamentals, Simulations and Advanced Topics

  1998cited by this paper
• Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

  1996cited by this paper
• On the shortest spanning subtree of a graph and the traveling salesman problem

  1956cited by this paper

• Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks

  2024cites this paper
• Overlay Network Construction: Improved Overall and Node-Wise Message Complexity

  2024cites this paper
• Highly Dynamic and Fully Distributed Data Structures

  2024cites this paper
• Subproject C1: Robustness and Security

  2023cites this paper
• Time- and Communication-Efficient Overlay Network Construction via Gossip

  2023cites this paper
• Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model

  2023cites this paper
• Received signal strength indication based clustering and aggregating data using Q-learning in mobile Ad Hoc network

  2022cites this paper
• Near-Shortest Path Routing in Hybrid Communication Networks

  2022cites this paper
• The Complexity of Growing a Graph

  2021cites this paper
• Distributed computations with global edges of limited bandwidth

  2021cites this paper
• Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

  2020cites this paper
• Distributed computation and reconfiguration in actively dynamic networks

  2020cites this paper
• Computing Shortest Paths and Diameter in the Hybrid Network Model

  2020cites this paper
• On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time

  2020influential citation
• Time-optimal construction of overlay networks

  2020influential citation
• Distance Computations in the Hybrid Network Model via Oracle Simulations

  2020cites this paper
• Shortest Paths in a Hybrid Network Model

  2019cites this paper
• Faster Construction of Overlay Networks

  2019cites this paper
• Always be Two Steps Ahead of Your Enemy

  2018cites this paper
• A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks

  2018cites this paper
• Random Sampling Applied to the MST Problem in the Node Congested Clique Model

  2018cites this paper
• Brief Announcement: Competitive Routing in Hybrid Communication Networks

  2018cites this paper
• Distributed Computation in the Node-Congested Clique

  2018cites this paper
• Distributed algorithms for overlay networks and programmable matter

  2018cites this paper
• Distributed Computation in Node-Capacitated Networks

  2018cites this paper
• Competitive Routing in Hybrid Communication Networks

  2017cites this paper
• 2024 Overlay Network Construction: Improved Overall and Node-Wise Message Complexity

  year unknowncites this paper