Sledovat
A. Erdem Sariyuce
A. Erdem Sariyuce
Associate Professor, Computer Science & Engineering, University at Buffalo
E-mailová adresa ověřena na: buffalo.edu - Domovská stránka
Název
Citace
Citace
Rok
Streaming algorithms for k-core decomposition
AE Saríyüce, B Gedik, G Jacques-Silva, KL Wu, ÜV Çatalyürek
Proceedings of the VLDB Endowment 6 (6), 433-444, 2013
2212013
Finding the hierarchy of dense subgraphs using nucleus decompositions
AE Sariyuce, C Seshadhri, A Pinar, UV Catalyurek
proceedings of the 24th international conference on world wide web, 927-937, 2015
1672015
Butterfly counting in bipartite networks
SV Sanei-Mehri, AE Sariyuce, S Tirthapura
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018
1112018
Peeling bipartite networks for dense subgraph discovery
AE Sarıyüce, A Pinar
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
1062018
Betweenness centrality on GPUs and heterogeneous architectures
AE Sariyüce, K Kaya, E Saule, ÜV Çatalyürek
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics …, 2013
1062013
Incremental k-core decomposition: algorithms and evaluation
AE Sarıyüce, B Gedik, G Jacques-Silva, KL Wu, ÜV Çatalyürek
The VLDB Journal 25, 425-447, 2016
952016
Fast hierarchy construction for dense subgraphs
AE Sariyuce, A Pinar
arXiv preprint arXiv:1610.01961, 2016
912016
Local algorithms for hierarchical dense subgraph discovery
AE Sariyuce, C Seshadhri, A Pinar
arXiv preprint arXiv:1704.00386, 2017
87*2017
Incremental Algorithms for Closeness Centrality
AE Sariyuce, K Kaya, E Saule, UV Catalyurek
Big Data, 2013 IEEE International Conference on, 487-492, 2013
832013
Shattering and compressing networks for betweenness centrality
AE Sarıyüce, E Saule, K Kaya, ÜV Çatalyürek
SIAM Data Mining Conference (SDM), 2013
73*2013
Regularizing graph centrality computations
AE Sarıyüce, E Saule, K Kaya, ÜV Çatalyürek
Journal of Parallel and Distributed Computing 76, 106-119, 2015
672015
Consistent regions: Guaranteed tuple processing in ibm streams
G Jacques-Silva, F Zheng, D Debrunner, KL Wu, V Dogaru, E Johnson, ...
Proceedings of the VLDB Endowment 9 (13), 1341-1352, 2016
452016
Graph manipulations for fast centrality computation
AE Sariyüce, K Kaya, E Saule, ÜV Çatalyürek
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (3), 1-25, 2017
402017
Measuring and improving the core resilience of networks
R Laishram, AE Sariyüce, T Eliassi-Rad, A Pinar, S Soundarajan
Proceedings of the 2018 World Wide Web Conference, 609-618, 2018
352018
Nucleus decompositions for identifying hierarchy of dense subgraphs
AE Sariyüce, C Seshadhri, A Pinar, ÜV Çatalyürek
ACM Transactions on the Web (TWEB) 11 (3), 1-27, 2017
342017
Temporal network motifs: Models, limitations, evaluation
P Liu, V Guarrasi, AE Sarıyüce
IEEE Transactions on Knowledge and Data Engineering 35 (1), 945-957, 2021
332021
Fleet: Butterfly estimation from a bipartite graph stream
SV Sanei-Mehri, Y Zhang, AE Sariyüce, S Tirthapura
Proceedings of the 28th ACM International Conference on Information and …, 2019
332019
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core
R Laishram, A Erdem Sar, T Eliassi-Rad, A Pinar, S Soundarajan
Proceedings of the 2020 SIAM International Conference on Data Mining, 325-333, 2020
242020
Incremental algorithms for network management and analysis based on closeness centrality
AE Sariyuce, K Kaya, E Saule, UV Catalyurek
arXiv preprint arXiv:1303.0422, 2013
242013
Scalable hybrid implementation of graph coloring using MPI and OpenMP
AE Sariyüce, E Saule, ÜV Çatalyürek
2012 IEEE 26th International Parallel and Distributed Processing Symposium …, 2012
222012
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20