( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach.

, и . CoRR, (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.

Shay Maymon

Shay Artzi

Solomon Alemu

Tsegaye Solomon

Alexey Shaytan

 

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

From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics.. STOC, стр. 363-372. ACM, (2014)On Optimal Solutions for the Bottleneck Tower of Hanoi Problem., и . SOFSEM (1), том 4362 из Lecture Notes in Computer Science, стр. 248-259. Springer, (2007)Fully Dynamic Maximal Independent Set with Sublinear in n Update Time., , , и . SODA, стр. 1919-1936. SIAM, (2019)(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time., , , , и . SODA, стр. 1886-1898. SIAM, (2019)Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach., и . SODA, стр. 712-729. SIAM, (2016)On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem., и . ANALCO, стр. 104-112. SIAM, (2014)Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More., , , , , и . SODA, стр. 5300-5331. SIAM, (2024)Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier., , и . CoRR, (2023)A Lossless Deamortization for Dynamic Greedy Set Cover., , и . FOCS, стр. 264-290. IEEE, (2024)Fast Constructions of Light-Weight Spanners for General Graphs., и . SODA, стр. 513-525. SIAM, (2013)