Yi-Jun Chang

Theor. Comput. Sci., January, 2024

Low-Distortion Clustering in Bounded Growth Graphs.

[BibT_eX]

[DOI]

Varsha Dani

Thomas P. Hayes

CoRR, 2024

Fast Broadcast in Highly Connected Networks.

[BibT_eX]

[DOI]

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

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs.

[BibT_eX]

[DOI]

Da Wei Zheng

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

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model.

[BibT_eX]

[DOI]

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

Deterministic Expander Routing: Faster and More Versatile.

[BibT_eX]

[DOI]

Shang-En Huang

Hsin-Hao Su

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

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model.

[BibT_eX]

[DOI]

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

Brief Announcement: Low-Distortion Clustering in Bounded Growth Graphs.

[BibT_eX]

[DOI]

Varsha Dani

Thomas P. Hayes

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

Improved All-Pairs Approximate Shortest Paths in Congested Clique.

[BibT_eX]

[DOI]

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

The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election.

[BibT_eX]

[DOI]

Ran Duan

Shunhua Jiang

ACM Trans. Algorithms, October, 2023

Locally checkable problems in rooted trees.

[BibT_eX]

[DOI]

Aleksandr Tereshchenko

Distributed Comput., September, 2023

Distributed graph problems through an automata-theoretic lens.

[BibT_eX]

[DOI]

Jan Studený

Jukka Suomela

Theor. Comput. Sci., March, 2023

Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model.

[BibT_eX]

[DOI]

Oren Hecht

Dean Leitersdorf

CoRR, 2023

The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs.

[BibT_eX]

[DOI]

Zeyong Li

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

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications.

[BibT_eX]

[DOI]

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

Ortho-Radial Drawing in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Classification of Local Problems in Regular Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Classification of Locally Checkable Problems in Regular Trees.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

The Energy Complexity of Las Vegas Leader Election.

[BibT_eX]

[DOI]

Shunhua Jiang

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

Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions.

[BibT_eX]

[DOI]

Hsin-Hao Su

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

Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Near-optimal Distributed Triangle Enumeration via Expander Decompositions.

[BibT_eX]

[DOI]

Thatchaphol Saranurak

Hengjie Zhang

J. ACM, 2021

On Homomorphism Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election.

[BibT_eX]

[DOI]

Ran Duan

Shunhua Jiang

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

Tight Distributed Listing of Cliques.

[BibT_eX]

[DOI]

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

Strong-Diameter Network Decomposition.

[BibT_eX]

[DOI]

Mohsen Ghaffari

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

2020

Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering.

[BibT_eX]

[DOI]

Wenzheng Li

SIAM J. Comput., 2020

Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens.

[BibT_eX]

[DOI]

Jan Studený

Jukka Suomela

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

The Complexity Landscape of Distributed Locally Checkable Problems on Trees.

[BibT_eX]

[DOI]

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

Streaming Complexity of Spanning Tree Computation.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

The Energy Complexity of BFS in Radio Networks.

[BibT_eX]

[DOI]

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

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization.

[BibT_eX]

[DOI]

Thatchaphol Saranurak

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Locality of Distributed Graph Problems.

[BibT_eX]

[DOI]

PhD thesis, 2019

Hardness of RNA folding problem with four symbols.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Exponential Separations in the Energy Complexity of Leader Election.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

PODC 2019 Review.

[BibT_eX]

[DOI]

SIGACT News, 2019

A Time Hierarchy Theorem for the LOCAL Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model.

[BibT_eX]

[DOI]

Tsvi Kopelowitz

SIAM J. Comput., 2019

Unfolding some classes of orthogonal polyhedra of arbitrary genus.

[BibT_eX]

[DOI]

Kuan-Yi Ho

J. Comb. Optim., 2019

Distributed Triangle Detection via Expander Decomposition.

[BibT_eX]

[DOI]

Hengjie Zhang

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

Simple Contention Resolution via Multiplicative Weight Updates.

[BibT_eX]

[DOI]

Wenyu Jin

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

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration.

[BibT_eX]

[DOI]

Thatchaphol Saranurak

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

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable.

[BibT_eX]

[DOI]

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

2018

Energy Complexity of Distance Computation in Multi-hop Networks.

[BibT_eX]

[DOI]

CoRR, 2018

An optimal distributed (Δ+1)-coloring algorithm?

[BibT_eX]

[DOI]

Wenzheng Li

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

The Complexity of Distributed Edge Coloring with Small Palettes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Energy Complexity of Broadcast.

[BibT_eX]

[DOI]

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

2017

Area-universal drawings of biconnected outerplane graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

On orthogonally convex drawings of plane graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2017

On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

How to Elect a Low-energy Leader.

[BibT_eX]

[DOI]

CoRR, 2016

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model.

[BibT_eX]

[DOI]

Tsvi Kopelowitz

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

2015

Constrained floorplans in 2D and 3D.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Conditional Lower Bound for RNA Folding Problem.

[BibT_eX]

[DOI]

CoRR, 2015

A New Approach for Contact Graph Representations and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Unfolding Orthogonal Polyhedra with Linear Refinement.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Rectilinear Duals Using Monotone Staircase Polygons.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract).

[BibT_eX]

[DOI]