Meihao Liao

Orcid: 0000-0002-5808-3131

According to our database¹, Meihao Liao authored at least 11 papers between 2022 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning.

[BibT_eX]

[DOI]

Proc. VLDB Endow., March, 2024

2023

Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Efficient Resistance Distance Computation: The Power of Landmark-based Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Maximal Defective Clique Enumeration.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Scalable Algorithms for Laplacian Pseudo-inverse Computation.

[BibT_eX]

[DOI]

CoRR, 2023

Locally Differentially Private Graph Embedding.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Fast Algorithm for Maximal k-plex Enumeration.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Scaling Up Maximal <i>k</i>-plex Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

Meihao Liao

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...