1 citations · 1 across the 4 of their papers we have counts for
5 papers
On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs
Mansi Sood, Eray Can Elumar, Osman Yagan
In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliabl…
Cost-aware LLM-based Online Dataset Annotation
Eray Can Elumar, Cem Tekin, Osman Yagan
Recent advances in large language models (LLMs) have enabled automated dataset labeling with minimal human supervision. While majority voting across multiple LLMs can improve label…
Bandits with Anytime Knapsacks
Eray Can Elumar, Cem Tekin, Osman Yagan
We consider bandits with anytime knapsacks (BwAK), a novel version of the BwK problem where there is an \textit{anytime} cost constraint instead of a total cost budget. This proble…
On the Robustness, Connectivity and Giant Component Size of Random K-out Graphs
Eray Can Elumar, Mansi Sood, Osman Yağan
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentr…
On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes
Eray Can Elumar, Mansi Sood, Osman Yagan
Random K-out graphs, denoted , are generated by each of the nodes drawing out-edges towards distinct nodes selected uniformly at random, and then ignor…