Assadi, Sepehr, and Nguyen, Hoai-an. Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. Retrieved from https://par.nsf.gov/biblio/10399052. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference) .

Assadi, Sepehr, & Nguyen, Hoai-an. Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference), (). Retrieved from https://par.nsf.gov/biblio/10399052.

Assadi, Sepehr, and Nguyen, Hoai-an. "Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference) (). Country unknown/Code not available. https://par.nsf.gov/biblio/10399052.

@article{osti_10399052,
place = {Country unknown/Code not available}, title = {Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting}, url = {https://par.nsf.gov/biblio/10399052}, abstractNote = {}, journal = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference)}, author = {Assadi, Sepehr and Nguyen, Hoai-an}, }