( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Why do simple algorithms for triangle enumeration work in the real world?

, , , , , и . ITCS, стр. 225-234. ACM, (2014)

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.

Dave Berry

David Berry

Claire Nicola Berry

Maresi Ann Berry-Stölzle

Berry Sabrah

 

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

Challenges in streaming graph analysis., , , и . MILCOM, стр. 1338. IEEE, (2011)Graph Analysis with High-Performance Computing., и . Comput. Sci. Eng., 10 (2): 14-19 (2008)Linear Algebra-Based Triangle Counting via Fine-Grained Tasking on Heterogeneous Environments : (Update on Static Graph Challenge)., , , , , и . HPEC, стр. 1-4. IEEE, (2019)Finding Central Sets of Tree Structures in Synchronous Distributed Systems., , , и . PDCS, стр. 201-208. ISCA, (2004)Performance Portability of an SpMV Kernel Across Scientific Computing and Data Science Applications., , , и . HPEC, стр. 1-8. IEEE, (2021)Why do simple algorithms for triangle enumeration work in the real world?, , , , , и . ITCS, стр. 225-234. ACM, (2014)Realizing parallelism in database operations: insights from a massively multithreaded architecture., , , и . DaMoN, стр. 4. ACM, (2006)Optimizing for KNL Usage Modes When Data Doesn't Fit in MCDRAM., , , , и . ICPP, стр. 37:1-37:10. ACM, (2018)Finding Median Set of Tree Structures in Synchronous Distributed Systems., , , и . CATA, стр. 7-12. ISCA, (2005)Considerations for Future Designers of General Purpose Graph Software.. Graphs and Discovery, том 69 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 1-6. DIMACS/AMS, (2001)