( en | de | ru )

 

Disambiguation of "Solomon, Shay"

Author of the publication

copydeleteadd this publication to your clipboard
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach.

, and . 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. You can also use the button next to the name to display some publications already assigned to the person.

Shay Maymon

Shay Artzi

Solomon Alemu

Tsegaye Solomon

Alexey Shaytan

 

Other publications of authors with the same name

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