Two absolute bounds for distributed bit complexity. - Yefim Dinitz; Noam Solomon (Theor. Comput. Sci., 2007)

On an infinite family of solvable Hanoi graphs. - Dany Azriel; Noam Solomon; Shay Solomon (ACM Trans. Algorithms, 2008)

On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. - Noam Solomon; Shay Solomon (ANALCO, 2014)

Incidences between points and lines in R4: Extended Abstract. - Micha Sharir; Noam Solomon (SoCG, 2014)

Incidences between Points and Lines in Three Dimensions. - Micha Sharir; Noam Solomon (SoCG, 2015)

Incidences with Curves in ℝ d. - Micha Sharir; Adam Sheffer; Noam Solomon (ESA, 2015)

Incidences between Points and Lines in R^4. - Micha Sharir; Noam Solomon (FOCS, 2015)

Incidences with Curves in ℝd. - Micha Sharir; Adam Sheffer; Noam Solomon (Electron. J. Comb., 2016)

Generalizations of the Szemerédi-Trotter Theorem. - Saarik Kalia; Micha Sharir; Noam Solomon; Ben Yang (Discret. Comput. Geom., 2016)

Ramsey-type theorems for lines in 3-space. - Jean Cardinal; Michael S. Payne; Noam Solomon (Discret. Math. Theor. Comput. Sci., 2016)

Subquadratic Algorithms for Algebraic Generalizations of 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (SoCG, 2017)

Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. - Micha Sharir; Noam Solomon (SODA, 2017)

Incidences Between Points and Lines in $${ mathbb {R}}^4$$. - Micha Sharir; Noam Solomon (Discret. Comput. Geom., 2017)

Highly incidental patterns on a quadratic hypersurface in R4. - Noam Solomon; Ruixiang Zhang (Discret. Math., 2017)

Algebraic Techniques in Combinatorial and Computational Geometry - Noam Solomon (2017)

Hardness vs Randomness for Bounded Depth Arithmetic Circuits. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (CCC, 2018)

Incidences Between Points and Lines on Two- and Three-Dimensional Varieties. - Micha Sharir; Noam Solomon (Discret. Comput. Geom., 2018)

Some Closure Results for Polynomial Factorization and Applications. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Electron. Colloquium Comput. Complex., 2018)

Derandomization from Algebraic Hardness: Treading the Borders. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (FOCS, 2019)

Subquadratic Algorithms for Algebraic 3SUM. - Luis Barba; Jean Cardinal; John Iacono; Stefan Langerman; Aurélien Ooms; Noam Solomon (Discret. Comput. Geom., 2019)

Closure of VP under taking factors: a short and simple proof. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Electron. Colloquium Comput. Complex., 2019)

Derandomization from Algebraic Hardness: Treading the Borders. - Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (Electron. Colloquium Comput. Complex., 2019)

From DNF compression to sunflower theorems via regularity. - Shachar Lovett; Noam Solomon; Jiapeng Zhang (Electron. Colloquium Comput. Complex., 2019)

Traces of hypergraphs. - Noga Alon; Guy Moshkovitz; Noam Solomon (J. Lond. Math. Soc., 2019)

Closure Results for Polynomial Factorization. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Theory Comput., 2019)

Incidences with curves in three dimensions. - Micha Sharir; Noam Solomon (CoRR, 2020)

A Generalized Matching Reconfiguration Problem. - Noam Solomon; Shay Solomon (ITCS, 2021)

On rich points and incidences with restricted sets of lines in 3-space. - Micha Sharir; Noam Solomon (J. Comput. Geom., 2021)

SystemMatch: optimizing preclinical drug models to human clinical outcomes via generative latent-space matching. - Scott Gigante; Varsha G. Raghavan; Amanda M. Robinson; Robert A. Barton; Adeeb H. Rahman; Drausin F. Wulsin; Jacques Banchereau; Noam Solomon; Luis F. Voloch; Fabian J. Theis (CoRR, 2022)

Incidences between points and curves with almost two degrees of freedom. - Micha Sharir; Noam Solomon; Oleg Zlydenko (J. Comb. Theory A, 2022)

Derandomization from Algebraic Hardness. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (SIAM J. Comput., 2022)