A. Erdem Sarıyüce

Assistant Professor

Computer Science & Engineering
University at Buffalo

erdem at buffalo dot edu
323 Davis Hall, Buffalo, NY 14260
716-645-1592

Brief Bio

I am an assistant professor in the Department of Computer Science and Engineering at the University at Buffalo. Previously, I was the John von Neumann Post-doctoral Fellow at Sandia National Labs in Livermore, CA, working with Ali Pinar. My research is on large-scale graph mining. I develop algorithms to enable practical and insightful graph analytics for real-world data which can be large, streaming, incomplete, and noisy. I got my Ph.D. from the Computer Science and Engineering Department at the Ohio State University under the supervision of Ümit V. Çatalyürek (now at Georgia Tech). You can pronounce my first name like this.

I am looking for self-motivated Ph.D. and M.S. students!

Recent News

  • Aug 2017: I am teaching a seminar class CSE 701: Large-Scale Graph Mining in Fall'17 semester
  • Aug 2017: I joined University at Buffalo, CSE Department as an assistant professor.
  • Mar 2017: New work: 'Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions', on arXiv
  • Nov 2016: New work: 'Peeling Bipartite Networks for Dense Subgraph Discovery', on arXiv
  • Nov 2016: New paper: 'Graph Manipulations for Fast Centrality Computation', to appear in TKDD
  • Aug 2016: New paper: 'Fast Hierarchy Construction for Dense Subgraphs', to appear in VLDB'17
  • Sep 2015: Started working at Sandia National Labs as the John von Neumann post-doc fellow.
  • May 2015: WWW'15 paper won the best paper runnner-up award.

Publications

  • Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs [pdf]
    A. Erdem Sarıyüce, C. Seshadhri, Ali Pınar, Ümit V. Çatalyürek
    ACM Transactions on the Web (TWEB), 11(3), 16:1--16:27, 2017

  • Graph Manipulations for Fast Centrality Computation [pdf]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
    ACM Transactions on Knowledge Discovery from Data (TKDD), 11(3), 26:1--26:25, 2017

  • Fast Hierarchy Construction for Dense Subgraphs [pdf]
    A. Erdem Sarıyüce, Ali Pınar
    International Conference on Very Large Data Bases (VLDB), 2017

  • Consistent Regions: Guaranteed Tuple Processing in IBM Streams [pdf]
    Gabriela Jacques-Silva, Fang Zheng, Daniel Debrunner, Kun-Lung Wu, Victor Dogaru, Eric Johnson, Michael Spicer, A. Erdem Sarıyüce
    International Conference on Very Large Data Bases (VLDB), Industrial Track, 2016

  • Incremental k-core Decomposition: Algorithms and Evaluation [pdf] [code]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
    Very Large Data Bases Journal (VLDBJ), 25(3), 425-447, 2016

  • SONIC: Streaming Overlapping Community Detection [pdf]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
    Data Mining and Knowledge Discovery (DAMI), 30(4), 819-847, 2016

  • Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions [pdf] [code]
    A. Erdem Sarıyüce, C. Seshadhri, Ali Pınar, Ümit V. Çatalyürek
    International World Wide Web Conference (WWW), 2015 [Best Paper Runner-up Award]

  • Incremental Closeness Centrality in Distributed Memory [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
    Parallel Computing, 47 (3-18), 2015

  • Regularizing Graph Centrality Computations [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
    Journal of Parallel and Distributed Computing, 76 (106-119), 2015

  • Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
    Workshop on Multithreaded Architectures and Applications (MTAAP), in conj. with IPDPS 2014

  • Incremental Algorithms for Closeness Centrality [pdf]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
    IEEE International Conference on Big Data (BigData), 2013

  • STREAMER: A Distributed Framework for Incremental Closeness Centrality Computation [pdf]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
    IEEE Cluster Conference (Cluster), 2013

  • Streaming Algorithms for k-core Decomposition [pdf] [code]
    A. Erdem Sarıyüce, Buğra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek
    International Conference on Very Large Data Bases (VLDB), 2013

  • Betweenness Centrality on GPUs and Heterogeneous Architectures [pdf] [code]
    A. Erdem Sarıyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek
    Workshop on General Purpose Processing Using GPUs (GPGPU), in conj. with ASPLOS 2013

  • Shattering and Compressing Networks for Betweenness Centrality [pdf] [code]
    A. Erdem Sarıyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek
    SIAM International Conference on Data Mining (SDM), 2013

  • Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP [pdf]
    A. Erdem Sarıyüce, Erik Saule, Ümit V. Çatalyürek
    Workshop on Parallel Computing and Optimization (PCO), in conj. with IPDPS 2012

  • Improving Graph Coloring on Distributed Memory Parallel Computers [pdf]
    A. Erdem Sarıyüce, Erik Saule, Ümit V. Çatalyürek
    International Conference on High Performance Computing (HiPC), 2011
Ph.D. Thesis
  • Fast Algorithms for Large-Scale Network Analytics [pdf]
    A. Erdem Sarıyüce
    Ph.D. Dissertation, Department of Computer Science and Engineering, The Ohio State University, 2015



COPYRIGHT: Materials are copyrighted by the corresponding publishers (e.g., ACM, IEEE, Springer, Elsevier, Wiley). You should download them only if you accept and obey the terms and restrictions defined by the respective publishers, including only use the downloaded materials for personal or educational purpose.