409 citations · 2.3k across the 154 of their papers we have counts for
13 papers · 1 filter
Guesswork Subject to a Total Entropy Budget
Arman Rezaee, Ahmad Beirami, Ali Makhdoumi +2
We consider an abstraction of computational security in password protected systems where a user draws a secret string of given length with i.i.d. characters from a finite alphabet,…
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
Alper Kose, Noyan Evirgen, Hakan Gokcesu +2
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented b…
Scheduling Wireless Ad Hoc Networks in Polynomial Time Using Claw-free Conflict Graphs
Alper Kose, Muriel Medard
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when such scheduling problems can be represented b…
Privacy with Estimation Guarantees
Hao Wang, Lisa Vo, Flavio P. Calmon +3
We study the central problem in data privacy: how to share data with an analyst while providing both privacy and utility guarantees to the user that owns the data. In this setting,…
The Storage vs Repair Bandwidth Trade-off for Multiple Failures in Clustered Storage Networks
Vitaly Abdrashitov, N. Prakash, Muriel Médard
We study the trade-off between storage overhead and inter-cluster repair bandwidth in clustered storage systems, while recovering from multiple node failures within a cluster. A cl…
Exploiting Parallelism in Optical Network Systems: A Case Study of Random Linear Network Coding (RLNC) in Ethernet-over-Optical Networks
Anna Engelmann, Wolfgang Bziuk, Admela Jukan +1
As parallelism becomes critically important in the semiconductor technology, high-performance computing, and cloud applications, parallel network systems will increasingly follow s…