Author of the publication

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms.

, , , , and . ICALP, volume 107 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

(1 + ∊)-Approximate f-Sensitive Distance Oracles., , , and . SODA, page 1479-1496. SIAM, (2017)Biologically Plausible Complex-Valued Neural Networks and Model Optimization., , , , , and . AIAI (1), volume 646 of IFIP Advances in Information and Communication Technology, page 369-382. Springer, (2022)The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks., , , and . PAKDD (1), volume 13935 of Lecture Notes in Computer Science, page 67-79. Springer, (2023)Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns., , , and . COMPLEX NETWORKS (1), volume 1141 of Studies in Computational Intelligence, page 250-259. Springer, (2023)Near Optimal Algorithms For The Single Source Replacement Paths Problem., and . SODA, page 2090-2109. SIAM, (2019)Cache Line Deltas Compression., , , , and . SYSTOR, page 145. ACM, (2023)Dynamic and Fault-Tolerant Data-Structures and Algorithms. Tel Aviv University, Israel, (2021)Tel Aviv University Library.Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles., , , and . ESA, volume 204 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dictionary Based Cache Line Compression., , , , and . HotStorage, ACM, (2024)Fixed-Parameter Sensitivity Oracles., , , , , , , and . ITCS, volume 215 of LIPIcs, page 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)