World's Best Scientists 2026 revealed!
Cevdet Aykanat

Cevdet Aykanat

D-Index & Metrics

Computer Science

D-Index
32
Citations
4838
World Ranking
13102
National Ranking
26

Overview

Cevdet Aykanat is affiliated with Bilkent University in Turkey and has contributed extensively to the field of computer science. Their research spans multiple subfields, with a total of 38 publications that cover areas including computer networks and communications, hardware and architecture, and artificial intelligence.

The scientist's work focuses on topics such as parallel computing and optimization techniques, interconnection networks and systems, VLSI and FPGA design, matrix theory and algorithms, graph theory and algorithms, tensor decomposition, and stochastic gradient optimization techniques.

Frequent co-authors collaborating with Cevdet Aykanat include:

  • M. Ozan Karsavuran
  • Seher Acer
  • Nabil Abubaker
  • Murat Manguoğlu
  • Oğuz Selvitopi

Their research has appeared in several prominent publication venues. The most frequent venues include:

  • IEEE Transactions on Parallel and Distributed Systems
  • SIAM Journal on Scientific Computing
  • Journal of Parallel and Distributed Computing
  • Future Generation Computer Systems
  • Knowledge-Based Systems

Recent papers authored or co-authored by Cevdet Aykanat include:

  • Fast shared-memory streaming multilevel graph partitioning, 2020, Journal of Parallel and Distributed Computing
  • Partitioning Models for General Medium-Grain Parallel Sparse Tensor Decomposition, 2020, IEEE Transactions on Parallel and Distributed Systems
  • Cartesian Partitioning Models for 2D and 3D Parallel SpGEMM Algorithms, 2020, IEEE Transactions on Parallel and Distributed Systems
  • True Load Balancing for Matricized Tensor Times Khatri-Rao Product, 2021, IEEE Transactions on Parallel and Distributed Systems
  • Reduce Operations: Send Volume Balancing While Minimizing Latency, 2020, IEEE Transactions on Parallel and Distributed Systems

Best Publications

  • Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication

    U.V. Catalyurek;C. Aykanat

  • PaToH (Partitioning tool for hypergraphs)

    Ümit V. Çatalyürek;Cevdet Aykanat

  • Permuting Sparse Rectangular Matrices into Block-Diagonal Form

    Cevdet Aykanat;Ali Pinar;Ümit V. Çatalyürek

  • Task assignment in heterogeneous computing systems

    Bora Ucar;Cevdet Aykanat;Kamer Kaya;Murat Ikinci

  • On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe

    Ümit V. Çatalyürek;Cevdet Aykanat;Bora Uçar

  • Fast optimal load balancing algorithms for 1D partitioning

    Ali Pinar;Cevdet Aykanat

  • Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication

    Umit Catalyurek;Cevdet Aykanat

  • A fine-grain hypergraph model for 2D decomposition of sparse matrices

    U.V. Catalyurek

  • Chat mining: Predicting user and message attributes in computer-mediated communication

    Tayfun Kucukyilmaz;B. Barla Cambazoglu;Cevdet Aykanat;Fazli Can

  • A new mapping heuristic based on mean field annealing

    Tevfik Bultan;Cevdet Aykanat

  • Iterative algorithms for solution of large sparse systems of linear equations on hypercubes

    C. Aykanat;F. Ozguner;F. Ercal;P. Sadayappan

  • Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

    Cevdet Aykanat;B. Barla Cambazoglu;Bora Uçar

  • A Hypergraph-Partitioning Approach for Coarse-Grain Decomposition

    Umit Catalyurek;Cevdet Aykanat

  • Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies

    Bora Uçar;Cevdet Aykanat

  • Chat mining for gender prediction

    Tayfun Kucukyilmaz;B. Barla Cambazoglu;Cevdet Aykanat;Fazli Can

  • Improving the Performance of IndependentTask Assignment Heuristics MinMin,MaxMin and Sufferage

    E. Kartal Tabak;B. Barla Cambazoglu;Cevdet Aykanat

  • Technical Report on

    Kadir Akbudak;Enver Kayaaslan;Cevdet Aykanat

  • Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments

    K. Kaya;C. Aykanat

  • Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories

    Kamer Kaya;Bora Uçar;Cevdet Aykanat

  • Two novel multiway circuit partitioning algorithms using relaxed locking

    A. Dasdan;C. Aykanat

  • Revisiting Hypergraph Models for Sparse Matrix Partitioning

    Bora Uçar;Cevdet Aykanat

  • PVM (Parallel Virtual Machine)

    Unknown

Frequent Co-Authors

Ümit V. Çatalyürek
Ümit V. Çatalyürek Georgia Institute of Technology
Ali Pinar
Ali Pinar Sandia National Laboratories
Tevfik Bultan
Tevfik Bultan University of California, Santa Barbara
Tahsin Kurc
Tahsin Kurc Stony Brook University
Ricardo Baeza-Yates
Ricardo Baeza-Yates Royal Institute of Technology
P. Sadayappan
P. Sadayappan University of Utah
Dhabaleswar K. Panda
Dhabaleswar K. Panda The Ohio State University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a range of related fields and flexible learning options. Many top universities now offer online programs, making advanced education more accessible and affordable for both U.S. and international students.

If you’re interested in interdisciplinary careers, you might consider environmental engineering schools online, which blend computer science with sustainability and environmental problem-solving. Those seeking specialization in applied sciences can opt for an online physics degree to strengthen analytical and technical skills.

For students focused on engineering, there are options for the cheapest online master's mechanical engineering programs, ideal for those aiming to enhance their expertise without relocating or pausing their careers. Additionally, with the booming demand for data professionals, enrolling in a data science degree can provide a direct pathway into one of today’s most lucrative tech sectors.

By choosing these related online degrees, students can build versatile career pathways that align with changing industry needs and their personal interests.

Best Scientists Citing Cevdet Aykanat

Trending Scientists