The following pages link to Hoa T. Vu (Q2322720):
Displaying 12 items.
- (Q727983) (redirect page) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Faster Algorithms for Computing the R* Consensus Tree (Q2942648) (← links)
- Densest Subgraph in Dynamic Graph Streams (Q2946417) (← links)
- (Q3174917) (← links)
- Evaluating Bayesian Networks via Data Streams (Q3196429) (← links)
- Run Generation Revisited: What Goes Up May or May Not Come Down (Q3459907) (← links)
- Towards the locality of Vizing’s theorem (Q5212777) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Revisiting maximum satisfiability and related problems in data streams (Q6199395) (← links)
- Distributed data summarization in well-connected networks (Q6487549) (← links)
