Noam Solomon

Ramprasad Saptharishi

SIAM J. Comput., 2022

Incidences between points and curves with almost two degrees of freedom.

[BibT_eX]

[DOI]

Oleg Zlydenko

J. Comb. Theory, Ser. A, 2022

SystemMatch: optimizing preclinical drug models to human clinical outcomes via generative latent-space matching.

[BibT_eX]

[DOI]

CoRR, 2022

2021

A Generalized Matching Reconfiguration Problem.

[BibT_eX]

[DOI]

Shay Solomon

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

On Rich Points and Incidences with Restricted Sets of Lines in 3-Space.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Incidences with curves in three dimensions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Closure Results for Polynomial Factorization.

[BibT_eX]

[DOI]

Theory Comput., 2019

Traces of hypergraphs.

[BibT_eX]

[DOI]

Noga Alon

Guy Moshkovitz

J. Lond. Math. Soc., 2019

From DNF compression to sunflower theorems via regularity.

[BibT_eX]

[DOI]

Shachar Lovett

Jiapeng Zhang

Electron. Colloquium Comput. Complex., 2019

Derandomization from Algebraic Hardness: Treading the Borders.

[BibT_eX]

[DOI]

Ramprasad Saptharishi

Electron. Colloquium Comput. Complex., 2019

Closure of VP under taking factors: a short and simple proof.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Subquadratic Algorithms for Algebraic 3SUM.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Derandomization from Algebraic Hardness: Treading the Borders.

[BibT_eX]

[DOI]

Zeyu Guo

Ramprasad Saptharishi

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Some Closure Results for Polynomial Factorization and Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Incidences Between Points and Lines on Two- and Three-Dimensional Varieties.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Hardness vs Randomness for Bounded Depth Arithmetic Circuits.

[BibT_eX]

[DOI]

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

Algebraic Techniques in Combinatorial and Computational Geometry

[BibT_eX]

[DOI]

PhD thesis, 2017

Highly incidental patterns on a quadratic hypersurface in R<sup>4</sup>.

[BibT_eX]

[DOI]

Ruixiang Zhang

Discret. Math., 2017

Incidences Between Points and Lines in $${\mathbb {R}}^4$$.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Ramsey-type theorems for lines in 3-space.

[BibT_eX]

[DOI]

Jean Cardinal

Michael S. Payne

Discret. Math. Theor. Comput. Sci., 2016

Generalizations of the Szemerédi-Trotter Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

Incidences with Curves in $\mathbb{R}^d$.

[BibT_eX]

[DOI]

Adam Sheffer

Electron. J. Comb., 2016

2015

Incidences between Points and Lines in R^4.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Incidences with Curves in ℝ d.

[BibT_eX]

[DOI]

Adam Sheffer

Proceedings of the Algorithms - ESA 2015, 2015

Incidences between Points and Lines in Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Incidences between points and lines in R4: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem.

[BibT_eX]

[DOI]

Shay Solomon

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2008

On an infinite family of solvable Hanoi graphs.

[BibT_eX]

[DOI]

Dany Azriel

Shay Solomon

ACM Trans. Algorithms, 2008

2007

Two absolute bounds for distributed bit complexity.

[BibT_eX]

[DOI]

Yefim Dinitz