activity
20162026
most citedApproximate Generalized Matching: -Factors and -Edge Covers

7 citations · 22 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2026

SecGoal: A Benchmark for Extracting Formalizable Security Goals from Protocol Documents

Dawei Huang, Hui Li, Bo Jia +4

Formal verification provides rigorous guarantees for cryptographic security, yet extracting formalizable security goals from natural-language protocol documents remains largely man…

cs.DB2020★ 4 cited

Joins on Samples: A Theoretical Guide for Practitioners

Dawei Huang, Dong Young Yoon, Seth Pettie +1

Despite decades of research on approximate query processing (AQP), our understanding of sample-based joins has remained limited and, to some extent, even superficial. The common be…

cs.IT2019★ 5 cited

The Communication Complexity of Set Intersection and Multiple Equality Testing

Dawei Huang, Seth Pettie, Yixiang Zhang +1

In this paper we explore fundamental problems in randomized communication complexity such as computing Set Intersection on sets of size and Equality Testing between vectors of…

cs.DS2017★ 7 cited

Approximate Generalized Matching: -Factors and -Edge Covers

Dawei Huang, Seth Pettie

In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include -time algorithms for $(1-ε)…

cs.DS2016★ 6 cited

Fully Dynamic Connectivity in Amortized Expected Time

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz +2

Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with $O(\log n(\log\…