#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2000

2018

- This year (5)
- Last 5 years (20)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
- Symposium on Computational Geometry
- 2017

The 3SUM problem asks if an input n-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a… (More)

- Yefim Dinitz, Noam Solomon
- Theor. Comput. Sci.
- 2007

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied bit complexity of Consensus and Leader Election, arriving at more or less exact… (More)

- Noam Solomon, Carol Lynn Berseth, Richard M. Braverman, Martha M. Munden, George D. Ferry
- Journal of pediatric gastroenterology and…
- 2000

- Micha Sharir, Noam Solomon
- Symposium on Computational Geometry
- 2014

We show that the number of incidences between m distinct points and n distinct lines in R4 is at most
A&epsis;(m2/5+ &epsis;n4/5 + m1/2+ &epsis;n2/3q1/12 + 2/3+&epsis;n4/9s2/9) A(m + n), for any… (More)

- Micha Sharir, Noam Solomon
- Symposium on Computational Geometry
- 2015

We give a fairly elementary and simple proof that shows that the number of incidences between m points and n lines in R, so that no plane contains more than s lines, is O (

We prove that the number of incidences between m points and n bounded-degree curves with k degrees of freedom in R is

- Micha Sharir, Noam Solomon
- 2015 IEEE 56th Annual Symposium on Foundations of…
- 2015

We show that the number of incidences between m distinct points and n distinct lines in R<sup>4</sup> is O(2<sup>c√log m</sup>(m<sup>2/5</sup>n<sup>4/5</sup> + m) +… (More)

- Micha Sharir, Noam Solomon
- 2015

We present a direct and fairly simple proof of the following incidence bound: Let P be a set of m points and L a set of n lines in R, for d ≥ 3, which lie in a common algebraic two-dimensional… (More)

- Jean Cardinal, Michael S. Payne, Noam Solomon
- Discrete Mathematics & Theoretical Computer…
- 2016

The proofs of these statements all follow from geometric inc idence bounds – such as the Guth-Katz bound on pointline incidences inR – combined with Turán-type results on independent sets in s parse… (More)

- Noam Solomon, Shay Solomon
- 2018

This paper introduces a natural “reoptimization” meta-problem. Fix any ∆ > 0 and ǫ > 0. Given two “approximate” solutions M and M ′ to some graph optimization problem (e.g., maximum matching), where… (More)