팔로우
Ofer Neiman
Ofer Neiman
Ben Gurion University
mail.huji.ac.il의 이메일 확인됨
제목
인용
인용
연도
Advances in metric embedding theory
I Abraham, Y Bartal, O Neimany
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
1752006
Simple deterministic algorithms for fully dynamic maximal matching
O Neiman, S Solomon
ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015
1462015
Nearly tight low stretch spanning trees
I Abraham, Y Bartal, O Neiman
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 781-790, 2008
1422008
Using petal-decompositions to build a low stretch spanning tree
I Abraham, O Neiman
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1292012
Metric embeddings with relaxed guarantees
I Abraham, Y Bartal, J Kleinberg, THH Chan, O Neiman, K Dhamdhere, ...
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 83-100, 2005
952005
Hopsets with constant hopbound, and applications to approximate shortest paths
M Elkin, O Neiman
SIAM Journal on Computing 48 (4), 1436-1480, 2019
832019
Efficient algorithms for constructing very sparse spanners and emulators
M Elkin, O Neiman
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
812017
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
I Abraham, Y Bartal, O Neiman
SIAM Journal on Computing 44 (1), 160-192, 2015
532015
Assouad’s theorem with dimension independent of the snowflaking
A Naor, O Neiman
Revista Matematica Iberoamericana 28 (4), 1123-1142, 2012
482012
Embedding metric spaces in their intrinsic dimension
I Abraham, Y Bartal, O Neiman
Society for Industrial and Applied Mathematics, 2008
442008
Beck's three permutations conjecture: A counterexample and some consequences
A Newman, O Neiman, A Nikolov
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 253-262, 2012
412012
Terminal embeddings
M Elkin, A Filtser, O Neiman
Theoretical Computer Science 697, 1-36, 2017
392017
Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs
I Abraham, C Gavoille, A Gupta, O Neiman, K Talwar
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
392014
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
M Elkin, O Neiman
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 333-341, 2019
372019
Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs
I Abraham, C Gavoille, A Gupta, O Neiman, K Talwar
SIAM Journal on Computing 48 (3), 1120-1145, 2019
342019
Snowflake universality of Wasserstein spaces
A Andoni, A Naor, O Neiman
Ann. Sci. Éc. Norm. Supér.(4) 51 (3), 657-700, 2018
312018
Distributed strong diameter network decomposition
M Elkin, O Neiman
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
302016
Near linear lower bound for dimension reduction in l1
A Andoni, MS Charikar, O Neiman, HL Nguyen
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 315-323, 2011
302011
Ramsey spanning trees and their applications
I Abraham, S Chechik, M Elkin, A Filtser, O Neiman
ACM Transactions on Algorithms (TALG) 16 (2), 1-21, 2020
252020
On efficient distributed construction of near optimal routing schemes
M Elkin, O Neiman
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
242016
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20