default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Elsholtz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j14]Christian Elsholtz, Jakob Führer, Erik Füredi, Benedek Kovács, Péter Pál Pach, Dániel Gábor Simon
, Nóra Velich:
Maximal line-free sets in $\mathbb {F}_p^n$. Period. Math. Hung. 90(1): 7-21 (2025)- 2024
- [j13]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. Appl. Algebra Eng. Commun. Comput. 35(6): 887-903 (2024) - 2023
- [j12]Christian Elsholtz, Benjamin Klahn, Gabriel F. Lipnik:
Large subsets of $\mathbb {Z}_m^n$ without arithmetic progressions. Des. Codes Cryptogr. 91(4): 1443-1452 (2023) - 2021
- [j11]Christian Elsholtz:
Fermat's Last Theorem Implies Euclid's Infinitude of Primes. Am. Math. Mon. 128(3): 250-257 (2021) - 2020
- [j10]Christian Elsholtz, Péter Pál Pach:
Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$. Des. Codes Cryptogr. 88(10): 2133-2170 (2020) - [j9]Christian Elsholtz:
Unconditional Prime-Representing Functions, Following Mills. Am. Math. Mon. 127(7): 639-642 (2020)
2010 – 2019
- 2019
- [i2]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. CoRR abs/1901.11343 (2019) - 2017
- [j8]Christian Elsholtz, Laurence Rackham:
Maximal sum-free sets of integer lattice grids. J. Lond. Math. Soc. 95(2): 353-372 (2017) - [j7]Christian Elsholtz:
Golomb's Conjecture on Prime Gaps. Am. Math. Mon. 124(4): 365-368 (2017) - 2013
- [j6]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. IEEE Trans. Inf. Theory 59(2): 1065-1075 (2013) - 2012
- [j5]Christian Elsholtz:
Prime Divisors of Thin Sequences. Am. Math. Mon. 119(4): 331-333 (2012) - 2011
- [j4]Yvonne Buttkewitz, Christian Elsholtz:
Patterns and complexity of multiplicative functions. J. Lond. Math. Soc. 84(3): 578-594 (2011) - [i1]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The number of Huffman codes, compact trees, and sums of unit fractions. CoRR abs/1108.5964 (2011)
2000 – 2009
- 2006
- [c1]Christian Elsholtz:
A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums. GTIT-C 2006: 1079-1080 - 2005
- [j3]Christian Elsholtz, Walter Klotz:
Maximal Dimension of Unit Simplices. Discret. Comput. Geom. 34(1): 167-177 (2005) - [j2]Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits:
Shifted products that are coprime pure powers. J. Comb. Theory A 111(1): 24-36 (2005) - 2004
- [j1]Christian Elsholtz:
Lower Bounds For Multidimensional Zero Sums. Comb. 24(3): 351-358 (2004)
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 2025-10-22 03:50 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:
