( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.

, , и . ISAAC, том 64 из LIPIcs, стр. 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.

Hubert H Zimmermann

Wilhelm Chan

Raquel Chan

Clifford Chan

Danny Chan

 

Другие публикации лиц с тем же именем

Private and Continual Release of Statistics., , и . ICALP (2), том 6199 из Lecture Notes in Computer Science, стр. 405-417. Springer, (2010)A Theory of Loss-Leaders: Making Money by Pricing Below Cost., , , и . WINE, том 4858 из Lecture Notes in Computer Science, стр. 293-299. Springer, (2007)An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function., , и . Algorithmica, 69 (3): 605-618 (2014)Fully Dynamic Approximate k-Core Decomposition in Hypergraphs., , и . ACM Trans. Knowl. Discov. Data, 14 (4): 39:1-39:21 (2020)Blockchain with Varying Number of Players., , , , , и . IACR Cryptol. ePrint Arch., (2020)Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search., , , , , , и . CoRR, (2020)Round Complexity of Byzantine Agreement, Revisited., , и . IACR Cryptology ePrint Archive, (2019)Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass., , , и . IEEE Trans. Knowl. Data Eng., 32 (3): 506-518 (2020)Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound., , и . IACR Cryptology ePrint Archive, (2014)Fully Dynamic k-Center Clustering with Outliers., , , и . Algorithmica, 86 (1): 171-193 (января 2024)