31 citations · 104 across the 17 of their papers we have counts for
6 papers · 1 filter
A Bloom Filter Survey: Variants for Different Domain Applications
Anes Abdennebi, Kamer Kaya
There is a plethora of data structures, algorithms, and frameworks dealing with major data-stream problems like estimating the frequency of items, answering set membership, associa…
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…
Vertex Ordering Algorithms for Graph Coloring Problem
Arda Asik, Ibrahim Bugra Demir, Berker Demirel +2
Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least numbe…
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers
Fatih Taşyaran, Kerem Yıldırır, Kamer Kaya +1
Sketches are probabilistic data structures that can provide approximate results within mathematically proven error bounds while using orders of magnitude less memory than tradition…
Incremental Algorithms for Network Management and Analysis based on Closeness Centrality
Ahmet Erdem Sariyuce, Kamer Kaya, Erik Saule +1
Analyzing networks requires complex algorithms to extract meaningful information. Centrality metrics have shown to be correlated with the importance and loads of the nodes in netwo…
Shattering and Compressing Networks for Centrality Analysis
Ahmet Erdem Sarıyüce, Erik Saule, Kamer Kaya +1
Who is more important in a network? Who controls the flow between the nodes or whose contribution is significant for connections? Centrality metrics play an important role while an…