default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Solomon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Micha Sharir, Noam Solomon, Oleg Zlydenko:
Incidences between points and curves with almost two degrees of freedom. J. Comb. Theory A 188: 105582 (2022)- [j13]Zeyu Guo
, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness. SIAM J. Comput. 51(2): 315-335 (2022) - [i13]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:
SystemMatch: optimizing preclinical drug models to human clinical outcomes via generative latent-space matching. CoRR abs/2205.07110 (2022) - 2021
- [j12]Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. J. Comput. Geom. 13(2): 51-72 (2021) - [c13]Micha Sharir, Noam Solomon:
On Rich Points and Incidences with Restricted Sets of Lines in 3-Space. SoCG 2021: 56:1-56:14 - [c12]Noam Solomon, Shay Solomon:
A Generalized Matching Reconfiguration Problem. ITCS 2021: 57:1-57:20 - 2020
- [i12]Micha Sharir, Noam Solomon:
Incidences with curves in three dimensions. CoRR abs/2007.04081 (2020) - [i11]Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. CoRR abs/2012.11913 (2020)
2010 – 2019
- 2019
- [j11]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61(4): 698-734 (2019) - [j10]Noga Alon, Guy Moshkovitz, Noam Solomon:
Traces of hypergraphs. J. Lond. Math. Soc. 100(2): 498-517 (2019) - [j9]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure Results for Polynomial Factorization. Theory Comput. 15: 1-34 (2019) - [c11]Shachar Lovett, Noam Solomon, Jiapeng Zhang:
From DNF Compression to Sunflower Theorems via Regularity. CCC 2019: 5:1-5:14 - [c10]Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. FOCS 2019: 147-157 - [i10]Shachar Lovett, Noam Solomon, Jiapeng Zhang:
From DNF compression to sunflower theorems via regularity. CoRR abs/1903.00580 (2019) - [i9]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. CoRR abs/1903.02366 (2019) - [i8]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. CoRR abs/1905.00091 (2019) - [i7]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. Electron. Colloquium Comput. Complex. TR19 (2019) - [i6]Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. Electron. Colloquium Comput. Complex. TR19 (2019) - [i5]Shachar Lovett, Noam Solomon, Jiapeng Zhang:
From DNF compression to sunflower theorems via regularity. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j8]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines on Two- and Three-Dimensional Varieties. Discret. Comput. Geom. 59(1): 88-130 (2018) - [c9]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Hardness vs Randomness for Bounded Depth Arithmetic Circuits. CCC 2018: 13:1-13:17 - [i4]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. CoRR abs/1803.05933 (2018) - [i3]Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Some Closure Results for Polynomial Factorization and Applications. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Noam Solomon:
Algebraic Techniques in Combinatorial and Computational Geometry. Tel Aviv University, Israel, 2017 - [j7]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines in $${\mathbb {R}}^4$$. Discret. Comput. Geom. 57(3): 702-756 (2017) - [j6]Noam Solomon, Ruixiang Zhang:
Highly incidental patterns on a quadratic hypersurface in R4. Discret. Math. 340(4): 585-590 (2017) - [c8]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - [c7]Micha Sharir, Noam Solomon:
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. SODA 2017: 2456-2475 - 2016
- [j5]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝd. Electron. J. Comb. 23(4): 4 (2016) - [j4]Saarik Kalia, Micha Sharir, Noam Solomon, Ben Yang:
Generalizations of the Szemerédi-Trotter Theorem. Discret. Comput. Geom. 55(3): 571-593 (2016) - [j3]Jean Cardinal, Michael S. Payne, Noam Solomon:
Ramsey-type theorems for lines in 3-space. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [i2]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR abs/1612.02384 (2016) - 2015
- [c6]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in Three Dimensions. SoCG 2015: 553-568 - [c5]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝ d. ESA 2015: 977-988 - [c4]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in R^4. FOCS 2015: 1378-1394 - [i1]Jean Cardinal, Michael S. Payne, Noam Solomon:
Ramsey-type theorems for lines in 3-space. CoRR abs/1512.03236 (2015) - 2014
- [c3]Noam Solomon, Shay Solomon:
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. ANALCO 2014: 104-112 - [c2]Micha Sharir, Noam Solomon:
Incidences between points and lines in R4: Extended Abstract. SoCG 2014: 189
2000 – 2009
- 2008
- [j2]Dany Azriel, Noam Solomon, Shay Solomon:
On an infinite family of solvable Hanoi graphs. ACM Trans. Algorithms 5(1): 13:1-13:22 (2008) - 2007
- [j1]Yefim Dinitz, Noam Solomon:
Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2-3): 168-183 (2007) - 2005
- [c1]Yefim Dinitz, Noam Solomon:
Two Absolute Bounds for Distributed Bit Complexity. SIROCCO 2005: 115-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
