Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Ofer Neiman
Observed names:
Neiman, Ofer,
O. Neiman
Institution:
Ben-Gurion University of the Negev
Observed institutions:
Ben-Gurion University of the Negev,
Hebrew University of Jerusalem,
Princeton University,
Courant Institute of Mathematical Sciences,
Carnegie Mellon University
ORCID:
0000-0003-4179-4364
Observed ORCID:
0000-0003-4179-4364
OpenAlex ID:
A5066182501
Works
94
Awards
2
Nearly Tight Low Stretch Spanning Trees
2008
·
Ittai Abraham
, Yair Bartal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
148
PDF
Simple deterministic algorithms for fully dynamic maximal matching
2013
·
Ofer Neiman
, Shay Solomon
·
ACM Symposium on Theory of Computing (STOC)
·
122
Using petal-decompositions to build a low stretch spanning tree
2012
·
Ittai Abraham
, Ofer Neiman
·
ACM Symposium on Theory of Computing (STOC)
·
122
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
2016
·
Michael Elkin
, Ofer Neiman
·
SIAM Journal on Computing
·
96
PDF
Metric Embeddings with Relaxed Guarantees
2005
·
I. Abraham
, Y. Bartal
, et al.
·
Annual Symposium on Foundations of Computer Science
·
93
Advances in metric embedding theory
2011
·
Ittai Abraham
, Yair Bartal
, et al.
·
Advances in Mathematics
·
84
PDF
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
2015
·
Ofer Neiman
, Shay Solomon
·
ACM Transactions on Algorithms
·
77
PDF
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
2018
·
Michael Elkin
, Ofer Neiman
·
ACM Transactions on Algorithms
·
75
PDF
Assouad’s theorem with dimension independent of the snowflaking
2012
·
Assaf Naor
, Ofer Neiman
·
Revista Matemática Iberoamericana
·
61
PDF
Terminal embeddings
2017
·
Michael Elkin
, Arnold Filtser
, et al.
·
Theoretical Computer Science
·
58
PDF
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
2019
·
Ittai Abraham
, Cyril Gavoille
, et al.
·
SIAM Journal on Computing
·
55
PDF
Embedding metric spaces in their intrinsic dimension
2008
·
Ittai Abraham
, Yair Bartal
, et al.
·
CaltechAUTHORS (California Institute of Technology)
·
50
PDF
Snowflake universality of Wasserstein spaces
2018
·
Alexandr Andoni
, Assaf Naor
, et al.
·
Annales Scientifiques de l École Normale Supérieure
·
49
PDF
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
2017
·
Michael Elkin
, Ofer Neiman
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
49
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC
2019
·
Michael Elkin
, Ofer Neiman
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
48
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
2007
·
Ittai Abraham
, Yair Bartal
, et al.
·
Symposium on Discrete Algorithms
·
45
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
2014
·
Ittai Abraham
, Cyril Gavoille
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
44
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences
2012
·
Alantha Newman
, Ofer Neiman
, et al.
·
Annual Symposium on Foundations of Computer Science
·
39
Covering metric spaces by few trees
2022
·
Yair Bartal
, Ora Nova Fandina
, et al.
·
Journal of Computer and System Sciences
·
38
PDF
Ramsey Spanning Trees and Their Applications
2018
·
Ittai Abraham
, Shiri Chechik
, et al.
·
ACM Transactions on Algorithms
·
38
PDF
Using Petal-Decompositions to Build a Low Stretch Spanning Tree
2019
·
Ittai Abraham
, Ofer Neiman
·
SIAM Journal on Computing
·
34
Light Spanners
2015
·
Michael Elkin
, Ofer Neiman
, et al.
·
SIAM Journal on Discrete Mathematics
·
33
PDF
Distributed Strong Diameter Network Decomposition: Extended Abstract
2016
·
Michael Elkin
, Ofer Neiman
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
31
Near Linear Lower Bound for Dimension Reduction in L1
2011
·
Alexandr Andoni
, Moses S. Charikar
, et al.
·
Annual Symposium on Foundations of Computer Science
·
29
Local embeddings of metric spaces
2007
·
Ittai Abraham
, Yair Bartal
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
27
Show more works
View as search
Works count:
94
Citation count:
2,112
H-index:
26
I10-index:
53
Year
Topic
Type