default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Erdélyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Tamás Erdélyi:
Remembering Peter Benjamin Borwein (May 10, 1953-August 23, 2020). J. Approx. Theory 303: 106070 (2024)- 2020
- [j16]Tamás Erdélyi:
Arestov's theorems on Bernstein's inequality. J. Approx. Theory 250 (2020) - [j15]Tamás Erdélyi:
Reverse Markov- and Bernstein-type inequalities for incomplete polynomials. J. Approx. Theory 251: 105341 (2020) - [j14]Tamás Erdélyi:
Functions with identical Lp norms. J. Approx. Theory 257: 105454 (2020) - [c1]Tamás Erdélyi, Cameron Musco, Christopher Musco:
Fourier Sparse Leverage Scores and Approximate Kernel Learning. NeurIPS 2020 - [i1]Tamás Erdélyi, Cameron Musco, Christopher Musco:
Fourier Sparse Leverage Scores and Approximate Kernel Learning. CoRR abs/2006.07340 (2020)
2010 – 2019
- 2015
- [j13]Tamás Erdélyi:
Inequalities for Lorentz polynomials. J. Approx. Theory 192: 297-305 (2015) - [j12]Stephen Choi, Tamás Erdélyi:
Sums of monomials with large Mahler measure. J. Approx. Theory 197: 49-61 (2015) - 2013
- [j11]Tamás Erdélyi, Edward B. Saff:
Riesz polarization inequalities in higher dimensions. J. Approx. Theory 171: 128-147 (2013)
2000 – 2009
- 2009
- [j10]Tamás Erdélyi:
Problem 11437. Am. Math. Mon. 116(5): 464 (2009) - 2008
- [j9]Franck Beaucoup, Tamás Erdélyi, et al.:
A Unique Solution: 11226. Am. Math. Mon. 115(1): 76 (2008) - 2006
- [j8]Franck Beaucoup, Tamás Erdélyi:
Problem 11226. Am. Math. Mon. 113(5): 460 (2006) - 2004
- [j7]Tamás Erdélyi, András Kroó:
Markov-type inequalities on certain irrational arcs and domains. J. Approx. Theory 130(2): 113-124 (2004) - [j6]Tamás Erdélyi:
The uniform closure of non-dense rational spaces on the unit interval. J. Approx. Theory 131(2): 149-156 (2004) - 2003
- [j5]David Benko, Tamás Erdélyi:
Markov inequality for polynomials of degree n with m distinct zeros. J. Approx. Theory 122(2): 241-248 (2003) - [j4]Peter B. Borwein, Tamás Erdélyi:
Lower bounds for the merit factors of trigonometric polynomials from Littlewood classes. J. Approx. Theory 125(2): 190-197 (2003) - 2001
- [j3]Tamás Erdélyi:
Markov-Type Inequalities for Products of Müntz Polynomials. J. Approx. Theory 112(2): 171-188 (2001) - 2000
- [j2]Tamás Erdélyi:
On the Equation a(a + d)(a + 2d)(a + 3d) = x2. Am. Math. Mon. 107(2): 166-169 (2000)
1990 – 1999
- 1996
- [j1]Peter B. Borwein, Tamás Erdélyi:
The integer Chebyshev problem. Math. Comput. 65(214): 661-681 (1996)
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-09-13 00:40 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:
