Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Publications of SPCL
S. Sakr, A. Bonifati, H. Voigt, A. Iosup, K. Ammar, R. Angles, W. Aref, M. Arenas, M. Besta, P. A. Boncz, K. Daudjee, E. Della Valle, S. Dumbrava, O. Hartig, B. Haslhofer, T. Hegeman, J. Hidders, K. Hose, A. Iamnitchi, V. Kalavri, H. Kapp, W. Martens, M. Tamer Özsu, E. Peukert, S. Plantikow, M. Ragab, M. R. Ripeanu, S. Salihoglu, C. Schulz, P. Selmer, J. F. Sequeda, J. Shinavier, G. Szárnyas, R. Tommasini, A. Tumeo, A. Uta, A. Lucia Varbanescu, H. Wu, N. Yakovets, D. Yan, E. Yoneki: | ||
The Future is Big Graphs: A Community View on Graph Processing Systems (Commun. ACM. Vol 64, Nr. 9, pages 62–71, Association for Computing Machinery, ISSN: 0001-0782, Aug. 2021) Publisher Reference AbstractEnsuring the success of big graph processing for the next decade and beyond.Documentsdownload article:access preprint on arxiv: Recorded talk (best effort) | ||
BibTeX | ||
|