Author of the publication

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.

, , and . ISAAC, volume 64 of LIPIcs, page 23:1-23:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search., , , , , , and . CoRR, (2020)Locally Differentially Private Sparse Vector Aggregation., , , , and . CoRR, (2021)Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions., , and . CoRR, (2023)Path ORAM: An Extremely Simple Oblivious RAM Protocol., , , , , , , and . J. ACM, 65 (4): 18:1-18:26 (2018)Fully Dynamic k-Center Clustering with Outliers., , , and . Algorithmica, 86 (1): 171-193 (January 2024)Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass., , , and . IEEE Trans. Knowl. Data Eng., 32 (3): 506-518 (2020)Blockchain with Varying Number of Players., , , , , and . IACR Cryptol. ePrint Arch., (2020)Fully Dynamic Approximate k-Core Decomposition in Hypergraphs., , and . ACM Trans. Knowl. Discov. Data, 14 (4): 39:1-39:21 (2020)An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function., , and . Algorithmica, 69 (3): 605-618 (2014)Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound., , and . IACR Cryptology ePrint Archive, (2014)