Shay Solomon
Shay Solomon
Zweryfikowany adres z tauex.tau.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Simple deterministic algorithms for fully dynamic maximal matching
O Neiman, S Solomon
ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015
1252015
Fully dynamic maximal matching in constant update time
S Solomon
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
1032016
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
S Assadi, K Onak, B Schieber, S Solomon
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
562019
Dynamic (1+∊)-approximate matchings: A density-sensitive approach
D Peleg, S Solomon
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
492016
Orienting fully dynamic graphs with worst-case time bounds
T Kopelowitz, R Krauthgamer, E Porat, S Solomon
International Colloquium on Automata, Languages, and Programming, 532-543, 2014
412014
The greedy spanner is existentially optimal
A Filtser, S Solomon
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
382016
From hierarchical partitions to hierarchical covers: Optimal fault-tolerant spanners for doubling metrics
S Solomon
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
362014
Optimal Euclidean spanners: Really short, thin, and lanky
M Elkin, S Solomon
Journal of the ACM (JACM) 62 (5), 1-45, 2015
332015
New doubling spanners: Better and simpler
THH Chan, M Li, L Ning, S Solomon
SIAM Journal on Computing 44 (1), 37-53, 2015
302015
Steiner shallow-light trees are exponentially lighter than spanning ones
M Elkin, S Solomon
SIAM Journal on Computing 44 (4), 996-1025, 2015
292015
Local-on-average distributed tasks
M Parter, D Peleg, S Solomon
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
232016
Light spanners
M Elkin, O Neiman, S Solomon
SIAM Journal on Discrete Mathematics 29 (3), 1312-1321, 2015
232015
Truly optimal euclidean spanners
H Le, S Solomon
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
212019
Fully dynamic MIS in uniformly sparse graphs
K Onak, B Schieber, S Solomon, N Wein
arXiv preprint arXiv:1808.10316, 2018
212018
Fast constructions of lightweight spanners for general graphs
M Elkin, S Solomon
ACM Transactions on Algorithms (TALG) 12 (3), 1-21, 2016
212016
Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier
M Charikar, S Solomon
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
202018
Improved dynamic graph coloring
S Solomon, N Wein
arXiv preprint arXiv:1904.12427, 2019
182019
Shallow-low-light trees, and tight lower bounds for Euclidean spanners
Y Dinitz, M Elkin, S Solomon
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 519-528, 2008
152008
Local algorithms for bounded degree sparsifiers in sparse graphs
S Solomon
arXiv preprint arXiv:2105.02084, 2021
142021
Balancing degree, diameter and weight in Euclidean spanners
S Solomon, M Elkin
European Symposium on Algorithms, 48-59, 2010
142010
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20