Mohsen Ghaffari

CoRR, April, 2025

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions.

[BibT_eX]

[DOI]

Jaehyun Koo

Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees.

[BibT_eX]

[DOI]

Jaehyun Koo

Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

A Cut-Matching Game for Constant-Hop Expanders.

[BibT_eX]

[DOI]

Jonas Hübotter

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Density-Dependent Graph Orientation and Coloring in Scalable MPC.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Fully Scalable MPC Algorithms for Euclidean k-Center.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Shared Randomness Helps with Local Distributed Problems.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time Routability.

[BibT_eX]

[DOI]

Brandon Wang

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fast Broadcast in Highly Connected Networks.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Parallel Dynamic Maximal Matching.

[BibT_eX]

[DOI]

Anton Trygub

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

A Distributed Palette Sparsification Theorem.

[BibT_eX]

[DOI]

Maxime Flin

Magnús M. Halldórsson

Alexandre Nolin

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP.

[BibT_eX]

[DOI]

Anton Trygub

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Faster Deterministic Distributed MIS and Approximate Matching.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Coloring Fast with Broadcasts.

[BibT_eX]

[DOI]

Maxime Flin

Magnús M. Halldórsson

Alexandre Nolin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Nearly Work-Efficient Parallel DFS in Undirected Graphs.

[BibT_eX]

[DOI]

Jiahao Qu

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Nearly Time-Optimal Distributed Approximation of Minimum Cost <i>k</i>-Edge-Connected Spanning Subgraph.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Near-Optimal Deterministic Distributed Synchronizer.

[BibT_eX]

[DOI]

Anton Trygub

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Distributed MIS with Low Energy and Time Complexities.

[BibT_eX]

[DOI]

Julian Portmann

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence.

[BibT_eX]

[DOI]

Václav Rozhon

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph.

[BibT_eX]

[DOI]

CoRR, 2022

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality.

[BibT_eX]

[DOI]

Harald Räcke

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Average Awake Complexity of MIS and Matching.

[BibT_eX]

[DOI]

Julian Portmann

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Massively Parallel Algorithms for b-Matching.

[BibT_eX]

[DOI]

Slobodan Mitrovic

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs.

[BibT_eX]

[DOI]

Saeed Ilchi

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Node and Edge Averaged Complexities of Local Graph Problems.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Universally-Optimal Distributed Exact Min-Cut.

[BibT_eX]

[DOI]

Goran Zuzic

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Local Computation of Maximal Independent Set.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Improved distributed Δ-coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Hop-constrained oblivious routing.

[BibT_eX]

[DOI]

Goran Zuzic

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Massively Parallel Algorithms for Distance Approximation and Spanners.

[BibT_eX]

[DOI]

Amartya Shankha Biswas

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

A Time-Optimal Randomized Parallel Algorithm for MIS.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improved Deterministic Network Decomposition.

[BibT_eX]

[DOI]

Václav Rozhon

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Low-Congestion Shortcuts for Graphs Excluding Dense Minors.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Strong-Diameter Network Decomposition.

[BibT_eX]

[DOI]

Yi-Jun Chang

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Network Decomposition and Distributed Derandomization.

[BibT_eX]

[DOI]

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.

[BibT_eX]

[DOI]

Ce Jin

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Polylogarithmic-time deterministic network decomposition and distributed derandomization.

[BibT_eX]

[DOI]

Václav Rozhon

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Massively Parallel Algorithm for Minimum Weight Vertex Cover.

[BibT_eX]

[DOI]

Ce Jin

Daan Nilis

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Faster Algorithms for Edge Connectivity via Random 2-Out Contractions.

[BibT_eX]

[DOI]

Krzysztof Nowicki

Mikkel Thorup

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Network Decomposition and Distributed Derandomization (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2020

Massively Parallel Algorithms for Minimum Cut.

[BibT_eX]

[DOI]

Krzysztof Nowicki

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond.

[BibT_eX]

[DOI]

Julian Portmann

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Distributed Algorithms for Low Stretch Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Distributed Computation in Node-Capacitated Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching.

[BibT_eX]

[DOI]

David Wajc

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation.

[BibT_eX]

[DOI]

Jara Uitto

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Distributed Maximal Independent Set using Small Messages.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Use of Randomness in Local Distributed Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Complexity of Distributed Splitting Problems.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Improved Parallel Algorithms for Density-Based Network Clustering.

[BibT_eX]

[DOI]

Silvio Lattanzi

Slobodan Mitrovic

Proceedings of the 36th International Conference on Machine Learning, 2019

Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication.

[BibT_eX]

[DOI]

Ali Sayyadi

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds.

[BibT_eX]

[DOI]

Jara Uitto

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Near-Optimal Distributed Maximum Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation.

[BibT_eX]

[DOI]

Jara Uitto

CoRR, 2018

Distributed Computation in the Node-Congested Clique.

[BibT_eX]

[DOI]

CoRR, 2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.

[BibT_eX]

[DOI]

CoRR, 2018

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms.

[BibT_eX]

[DOI]

Jason Li

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Distributed Set Cover Approximation: Primal-Dual with Optimal Locality.

[BibT_eX]

[DOI]

Guy Even

Moti Medina

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Improved distributed algorithms for exact shortest paths.

[BibT_eX]

[DOI]

Jason Li

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Deterministic distributed edge-coloring with fewer colors.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Congested Clique Algorithms for the Minimum Cut Problem.

[BibT_eX]

[DOI]

Krzysztof Nowicki

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics.

[BibT_eX]

[DOI]

Johannes Lengler

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Improved Distributed Delta-Coloring.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Session details: Session 2B: Routing and Leader Election.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On Derandomizing Local Distributed Algorithms.

[BibT_eX]

[DOI]

David G. Harris

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Improved Distributed Algorithms for Fundamental Graph Problems.

[BibT_eX]

[DOI]

PhD thesis, 2017

Tight Bounds on Vertex Connectivity Under Sampling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Tight Analysis for the 3-Majority Consensus Dynamics.

[BibT_eX]

[DOI]

Johannes Lengler

CoRR, 2017

Space-Optimal Semi-Streaming for (2+ε)-Approximate Matching.

[BibT_eX]

[DOI]

CoRR, 2017

Deterministic Distributed Matching: Simpler, Faster, Better.

[BibT_eX]

[DOI]

CoRR, 2017

Near-Optimal Distributed DFS in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Simple and Near-Optimal Distributed Coloring for Sparse Graphs.

[BibT_eX]

[DOI]

Christiana Lymouri

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Distributed Degree Splitting and Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

On the complexity of local distributed graph problems.

[BibT_eX]

[DOI]

Yannic Maus

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Distributed Degree Splitting, Edge Coloring, and Orientations.

[BibT_eX]

[DOI]

Hsin-Hao Su

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Random Contractions and Sampling for Hypergraph and Hedge Connectivity.

[BibT_eX]

[DOI]

David R. Karger

Debmalya Panigrahi

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Distributed MST and Routing in Almost Mixing Time.

[BibT_eX]

[DOI]

Hsin-Hao Su

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Distributed MIS via All-to-All Communication.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Distributed Approximation of Maximum Independent Set and Maximum Matching.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Near-Optimal BFS-Tree Construction in Radio Networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2016

How to Discreetly Spread a Rumor in a Crowd.

[BibT_eX]

[DOI]

Calvin C. Newport

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

An Improved Distributed Algorithm for Maximal Independent Set.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Polylogarithmic Gossip Algorithm for Plurality Consensus.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

MST in Log-Star Rounds of Congested Clique.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Distributed Algorithms for Planar Networks I: Planar Embedding.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Leader Election in Unreliable Radio Networks.

[BibT_eX]

[DOI]

Calvin C. Newport

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

A Dynamic Networking Substrate for Distributed MMOGs.

[BibT_eX]

[DOI]

Dewan Tanvir Ahmed

IEEE Trans. Emerg. Top. Comput., 2015

Towards an Optimal Distributed Algorithm for Maximal Independent Set.

[BibT_eX]

[DOI]

CoRR, 2015

Tight Bounds on Vertex Connectivity Under Vertex Sampling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Brief Announcement: Distributed Single-Source Reachability.

[BibT_eX]

[DOI]

Rajan Udwani

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Distributed House-Hunting in Ant Colonies.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Near-Optimal Distributed Maximum Flow: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Near-Optimal Scheduling of Distributed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Distributed Broadcast Revisited: Towards Universal Optimality.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Fast Structuring of Radio Networks for Multi-Message Communications.

[BibT_eX]

[DOI]

CoRR, 2014

Near-Optimal Distributed Tree Embedding.

[BibT_eX]

[DOI]

Christoph Lenzen

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Optimal error rates for interactive coding I: adaptivity and other settings.

[BibT_eX]

[DOI]

Madhu Sudan

Proceedings of the Symposium on Theory of Computing, 2014

A New Perspective on Vertex Connectivity.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Broadcast Throughput in Radio Networks: Routing vs. Network Coding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Multi-message broadcast with abstract MAC layers and unreliable links.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed connectivity decomposition.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

On the Importance of Registers for Computability.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

A Bound on the Throughput of Radio Networks

[BibT_eX]

[DOI]

Majid Khabbazian

CoRR, 2013

Distributed Minimum Cut Approximation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Fast Structuring of Radio Networks Large for Multi-message Communications.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Near Optimal Leader Election in Multi-Hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The cost of radio network broadcast for different models of unreliable links.

[BibT_eX]

[DOI]

Nancy A. Lynch

Calvin C. Newport

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Randomized broadcast in radio networks with collision detection.

[BibT_eX]

[DOI]

Majid Khabbazian

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Maximal independent sets in multichannel radio networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology

[BibT_eX]

[DOI]

Majid Khabbazian

CoRR, 2012

Bounds on Contention Management in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Optimal Broadcast in Shared Spectrum Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011

Leader Election Using Loneliness Detection.

[BibT_eX]

[DOI]

Nancy A. Lynch

Srikanth Sastry

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

On the necessity of using Delaunay Triangulation substrate in greedy routing based networks.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2010

2009

On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks

[BibT_eX]

[DOI]

CoRR, 2009

A new routing algorithm for sparse vehicular ad-hoc networks with moving destinations.

[BibT_eX]

[DOI]

Farid Ashtiani

Proceedings of the 2009 IEEE Wireless Communications and Networking Conference, 2009

A delaunay triangulation architecture supporting churn and user mobility in MMVEs.

[BibT_eX]

[DOI]