2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments
Fatih Taşyaran, Berkay Demireller, Kamer Kaya +1
Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently…
cs.DC2018
Programming Strategies for Irregular Algorithms on the Emu Chick
Eric Hein, Srinivas Eswar, Abdurrahman Yaşar +7
The Emu Chick prototype implements migratory memory-side processing in a novel hardware system. Rather than transferring large amounts of data across the system interconnect, the E…
cs.DC2013★ 2 cited
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
Mehmet Deveci, Kamer Kaya, Bora Ucar +1
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer…