( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing.

, , , , , , , и . ASPLOS (2), стр. 385-400. ACM, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Shixuan Pang

Yü-Sün Sun

Deming Sun

Yang Sun

Jianguo Sun

 

Другие публикации лиц с тем же именем

Cache-Efficient Fork-Processing Patterns on Large Graphs., , , , и . SIGMOD Conference, стр. 1208-1221. ACM, (2021)In-Memory Subgraph Matching: An In-depth Study., и . SIGMOD Conference, стр. 1083-1098. ACM, (2020)An Entity Relationship Extraction Model Based on Chameleon Clustering Algorithm., и . RFIDSec Asia, том 8 из Cryptology and Information Security Series, стр. 3-8. IOS Press, (2012)Efficient Parallel Subgraph Enumeration on a Single Machine., , , и . ICDE, стр. 232-243. IEEE, (2019)Accelerating All-Edge Common Neighbor Counting on Three Processors., , , , и . ICPP, стр. 42:1-42:10. ACM, (2019)An Efficient Hierarchical Graph Clustering Algorithm Based on Shared Neighbors and Links., , и . KSEM, том 8041 из Lecture Notes in Computer Science, стр. 504-512. Springer, (2013)PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration., , , и . SIGMOD Conference, стр. 1758-1770. ACM, (2021)Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine., и . ICPADS, стр. 42-50. IEEE, (2018)Scaling Up Subgraph Query Processing with Efficient Subgraph Matching., и . ICDE, стр. 220-231. IEEE, (2019)FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing., , , , , , , и . ASPLOS (2), стр. 385-400. ACM, (2024)