Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 Sakr_2021
%A Sakr, Sherif
%A Bonifati, Angela
%A Voigt, Hannes
%A Iosup, Alexandru
%A Ammar, Khaled
%A Angles, Renzo
%A Aref, Walid
%A Arenas, Marcelo
%A Besta, Maciej
%A Boncz, Peter A.
%A Daudjee, Khuzaima
%A Valle, Emanuele Della
%A Dumbrava, Stefania
%A Hartig, Olaf
%A Haslhofer, Bernhard
%A Hegeman, Tim
%A Hidders, Jan
%A Hose, Katja
%A Iamnitchi, Adriana
%A Kalavri, Vasiliki
%A Kapp, Hugo
%A Martens, Wim
%A Özsu, M. Tamer
%A Peukert, Eric
%A Plantikow, Stefan
%A Ragab, Mohamed
%A Ripeanu, Matei R.
%A Salihoglu, Semih
%A Schulz, Christian
%A Selmer, Petra
%A Sequeda, Juan F.
%A Shinavier, Joshua
%A Szárnyas, Gábor
%A Tommasini, Riccardo
%A Tumeo, Antonino
%A Uta, Alexandru
%A Varbanescu, Ana Lucia
%A Wu, Hsiang-Yun
%A Yakovets, Nikolay
%A Yan, Da
%A Yoneki, Eiko
%D 2021
%I Association for Computing Machinery (ACM)
%J Communications of the ACM
%K imported
%N 9
%P 62–71
%R 10.1145/3434642
%T The future is big graphs: a community view on graph processing systems
%U http://dx.doi.org/10.1145/3434642
%V 64
@article{Sakr_2021,
added-at = {2024-10-02T10:38:17.000+0200},
author = {Sakr, Sherif and Bonifati, Angela and Voigt, Hannes and Iosup, Alexandru and Ammar, Khaled and Angles, Renzo and Aref, Walid and Arenas, Marcelo and Besta, Maciej and Boncz, Peter A. and Daudjee, Khuzaima and Valle, Emanuele Della and Dumbrava, Stefania and Hartig, Olaf and Haslhofer, Bernhard and Hegeman, Tim and Hidders, Jan and Hose, Katja and Iamnitchi, Adriana and Kalavri, Vasiliki and Kapp, Hugo and Martens, Wim and Özsu, M. Tamer and Peukert, Eric and Plantikow, Stefan and Ragab, Mohamed and Ripeanu, Matei R. and Salihoglu, Semih and Schulz, Christian and Selmer, Petra and Sequeda, Juan F. and Shinavier, Joshua and Szárnyas, Gábor and Tommasini, Riccardo and Tumeo, Antonino and Uta, Alexandru and Varbanescu, Ana Lucia and Wu, Hsiang-Yun and Yakovets, Nikolay and Yan, Da and Yoneki, Eiko},
biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2b970f69f651745c1fb7c7dcb868e4161/scadsfct},
doi = {10.1145/3434642},
interhash = {9b15e6e15b97330f074a5c7d86e80972},
intrahash = {b970f69f651745c1fb7c7dcb868e4161},
issn = {1557-7317},
journal = {Communications of the ACM},
keywords = {imported},
month = aug,
number = 9,
pages = {62–71},
publisher = {Association for Computing Machinery (ACM)},
timestamp = {2024-10-02T10:38:17.000+0200},
title = {The future is big graphs: a community view on graph processing systems},
url = {http://dx.doi.org/10.1145/3434642},
volume = 64,
year = 2021
}