Shay Solomon
Shay Solomon
Подтвержден адрес электронной почты в домене tauex.tau.ac.il - Главная страница
Название
Процитировано
Процитировано
Год
Simple deterministic algorithms for fully dynamic maximal matching
O Neiman, S Solomon
ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015
1042015
Fully dynamic maximal matching in constant update time
S Solomon
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
832016
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
402019
Dynamic (1+∊)-approximate matchings: A density-sensitive approach
D Peleg, S Solomon
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
372016
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
352014
The greedy spanner is existentially optimal
A Filtser, S Solomon
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
292016
Optimal Euclidean spanners: Really short, thin, and lanky
M Elkin, S Solomon
Journal of the ACM (JACM) 62 (5), 1-45, 2015
292015
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
272014
Steiner shallow-light trees are exponentially lighter than spanning ones
M Elkin, S Solomon
SIAM Journal on Computing 44 (4), 996-1025, 2015
242015
New doubling spanners: Better and simpler
THH Chan, M Li, L Ning, S Solomon
SIAM Journal on Computing 44 (1), 37-53, 2015
232015
Local-on-average distributed tasks
M Parter, D Peleg, S Solomon
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
192016
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
162008
Fully dynamic MIS in uniformly sparse graphs
K Onak, B Schieber, S Solomon, N Wein
arXiv preprint arXiv:1808.10316, 2018
152018
Fast constructions of lightweight spanners for general graphs
M Elkin, S Solomon
ACM Transactions on Algorithms (TALG) 12 (3), 1-21, 2016
152016
Balancing degree, diameter and weight in Euclidean spanners
S Solomon, M Elkin
European Symposium on Algorithms, 48-59, 2010
142010
Improved dynamic graph coloring
S Solomon, N Wein
arXiv preprint arXiv:1904.12427, 2019
132019
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
132018
Light spanners
M Elkin, O Neiman, S Solomon
SIAM Journal on Discrete Mathematics 29 (3), 1312-1321, 2015
132015
Local algorithms for bounded degree sparsifiers in sparse graphs
S Solomon
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 2018
122018
Narrow-shallow-low-light trees with and without Steiner points
M Elkin, S Solomon
SIAM Journal on Discrete Mathematics 25 (1), 181-210, 2011
102011
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20