Hsin-Hao Su

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

2023

On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition.

[BibT_eX]

[DOI]

David G. Harris

SIAM J. Discret. Math., June, 2023

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights.

[BibT_eX]

[DOI]

CoRR, 2023

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence.

[BibT_eX]

[DOI]

Nairen Cao

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

(1-ϵ)-Approximate Maximum Weighted Matching in poly(1/ϵ, log n) Time in the Distributed and Parallel Settings.

[BibT_eX]

[DOI]

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

2022

(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Yi-Jun Chang

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

Adaptive Massively Parallel Constant-Round Tree Contraction.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Marina Knittel

Hamed Saleh

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

2020

Distributed Dense Subgraph Detection and Low Outdegree Orientation.

[BibT_eX]

[DOI]

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

Lower Bounds for Dynamic Distributed Task Allocation.

[BibT_eX]

[DOI]

Nicole Wein

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Distributed Data Summarization in Well-Connected Networks.

[BibT_eX]

[DOI]

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

Towards the locality of Vizing's theorem.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Reconfigurable Check Node Unit Design of Dual-Standard LDPC Decoding for 60 GHz Wireless Local Area Network.

[BibT_eX]

[DOI]

Tang-Syun Chen

Cheng-Hung Lin

Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2019

2018

Scaling Algorithms for Weighted Matching in General Graphs.

[BibT_eX]

[DOI]

Ran Duan

ACM Trans. Algorithms, 2018

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds.

[BibT_eX]

[DOI]

David G. Harris

Johannes Schneider

J. ACM, 2018

Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds.

[BibT_eX]

[DOI]

Merav Parter

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

Optimal Gossip Algorithms for Exact and Approximate Quantile Computations.

[BibT_eX]

[DOI]

Bernhard Haeupler

Jeet Mohapatra

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

2017

Ant-inspired density estimation via random walks.

[BibT_eX]

[DOI]

Cameron Musco

Nancy A. Lynch

Proc. Natl. Acad. Sci. USA, 2017

Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2017

Distributed algorithms for the Lovász local lemma and graph coloring.

[BibT_eX]

[DOI]

Kai-Min Chung

Distributed Comput., 2017

Ant-Inspired Dynamic Task Allocation via Gossiping.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Distributed Degree Splitting, Edge Coloring, and Orientations.

[BibT_eX]

[DOI]

Mohsen Ghaffari

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

Distributed MST and Routing in Almost Mixing Time.

[BibT_eX]

[DOI]

Mohsen Ghaffari

Fabian Kuhn

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

2016

Distributed (∆+1)-coloring in sublogarithmic rounds.

[BibT_eX]

[DOI]

David G. Harris

Johannes Schneider

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Ant-Inspired Density Estimation via Random Walks: Extended Abstract.

[BibT_eX]

[DOI]

Cameron Musco

Nancy A. Lynch

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

Clairvoyant Mechanisms for Online Auctions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Algorithms for Fundamental Problems in Computer Networks.

[BibT_eX]

[DOI]

PhD thesis, 2015

Distributed coloring algorithms for triangle-free graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2015

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting.

[BibT_eX]

[DOI]

Michael Elkin

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

2014

A Distributed Minimum Cut Approximation Scheme.

[BibT_eX]

[DOI]

CoRR, 2014

Almost-Tight Distributed Minimum Cut Algorithms.

[BibT_eX]

[DOI]

Danupon Nanongkai

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

Brief annoucement: a distributed minimum cut approximation scheme.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

Fast Distributed Coloring Algorithms for Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

On uniformly balanced graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2012

A scaling algorithm for maximum weight matching in bipartite graphs.

[BibT_eX]

[DOI]

Ran Duan

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Scaling algorithms for approximate and exact maximum weight matching

[BibT_eX]

[DOI]

Ran Duan

CoRR, 2011

2010

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights.

[BibT_eX]

[DOI]

Li-Pu Yeh

Biing-Feng Wang

Algorithmica, 2010

2008

An improved algorithm for finding a length-constrained maximum-density subtree in a tree.

[BibT_eX]

[DOI]