default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoshua Zahl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]József Solymosi, Joshua Zahl:
Improved Elekes-Szabó type estimates using proximity. J. Comb. Theory A 201: 105813 (2024)- 2022
- [j13]Esther Ezra, Orit E. Raz, Micha Sharir
, Joshua Zahl:
Counting and Cutting Rich Lenses in Arrangements of Circles. SIAM J. Discret. Math. 36(2): 958-974 (2022) - [i16]József Solymosi, Joshua Zahl:
Improved Elekes-Szabó type estimates using proximity. CoRR abs/2211.13294 (2022) - 2021
- [j12]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SIAM J. Comput. 50(2): 760-787 (2021) - [c4]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On Rich Lenses in Planar Arrangements of Circles and Related Problems. SoCG 2021: 35:1-35:15 - 2020
- [j11]Joshua Zahl:
Counting higher order tangencies for plane curves. Comb. Probab. Comput. 29(2): 310-317 (2020) - [j10]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications. SIAM J. Comput. 49(6): 1109-1127 (2020) - [i15]Joshua Zahl:
Sphere tangencies, line incidences, and Lie's line-sphere correspondence. CoRR abs/2002.11677 (2020) - [i14]Adam Sheffer, Joshua Zahl:
Distinct distances in the complex plane. CoRR abs/2006.08886 (2020) - [i13]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On rich lenses in planar arrangements of circles and related problems. CoRR abs/2012.04204 (2020)
2010 – 2019
- 2019
- [c3]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG 2019: 5:1-5:14 - [c2]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. SODA 2019: 2636-2648 - [i12]Boris Aronov, Esther Ezra, Joshua Zahl:
Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. CoRR abs/1904.09526 (2019) - 2018
- [j9]Adam Sheffer, Endre Szabó, Joshua Zahl:
Point-Curve Incidences in the Complex Plane. Comb. 38(2): 487-499 (2018) - [i11]Joshua Zahl:
Counting higher order tangencies for plane curves. CoRR abs/1807.06580 (2018) - [i10]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl:
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. CoRR abs/1812.10269 (2018) - 2017
- [j8]Larry Guth, Joshua Zahl:
Curves in R4 and Two-Rich Points. Discret. Comput. Geom. 58(1): 232-253 (2017) - [j7]Micha Sharir, Joshua Zahl:
Cutting algebraic curves into pseudo-segments and applications. J. Comb. Theory A 150: 1-35 (2017) - [i9]Joshua Zahl:
Breaking the 3/2 barrier for unit distances in three dimensions. CoRR abs/1706.05118 (2017) - 2016
- [j6]Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. Comb. 36(3): 349-364 (2016) - [i8]Micha Sharir, Joshua Zahl:
Cutting Algebraic Curves into Pseudo-segments and Applications. CoRR abs/1604.07877 (2016) - 2015
- [j5]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved Bounds for Incidences Between Points and Circles. Comb. Probab. Comput. 24(3): 490-520 (2015) - [j4]Joshua Zahl:
A Szemerédi-Trotter Type Theorem in ℝ4. Discret. Comput. Geom. 54(3): 513-572 (2015) - [i7]Larry Guth, Joshua Zahl:
Algebraic curves, rich points, and doubly-ruled surfaces. CoRR abs/1503.02173 (2015) - [i6]József Solymosi, Joshua Zahl:
New bounds on curve tangencies and orthogonalities. CoRR abs/1509.05821 (2015) - [i5]Larry Guth, Joshua Zahl:
Curves in ℝ4 and two-rich points. CoRR abs/1512.05648 (2015) - 2013
- [j3]Joshua Zahl:
An improved bound on the number of point-surface incidences in three dimensions. Contributions Discret. Math. 8(1) (2013) - [c1]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved bounds for incidences between points and circles. SoCG 2013: 97-106 - [i4]Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. CoRR abs/1308.5620 (2013) - 2012
- [i3]Joshua Zahl:
A Szemeredi-Trotter type theorem in $\mathbb{R}^4$. CoRR abs/1203.4600 (2012) - [i2]Micha Sharir, Adam Sheffer, Joshua Zahl:
Incidences between points and non-coplanar circles. CoRR abs/1208.0053 (2012) - 2011
- [i1]Joshua Zahl:
An improved bound on the number of point-surface incidences in three dimensions. CoRR abs/1104.4987 (2011)
2000 – 2009
- 2009
- [j2]Glenn Hurlbert, Tobias Johnson, Joshua Zahl:
On universal cycles for multisets. Discret. Math. 309(17): 5321-5327 (2009) - 2008
- [j1]Daniel J. Katz, Joshua Zahl:
Bounds on degrees of p-adic separating polynomials. J. Comb. Theory A 115(7): 1310-1319 (2008)
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-07-20 20:33 CEST 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:
