default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Müller 0002
Person information
- affiliation: University of Trier, Germany
Other persons with the same name
- Jürgen Müller — disambiguation page
- Jürgen Müller 0001 — Albert-Ludwigs-University of Freiburg, Computer Science Institute, Germany
- Jürgen Müller 0003 — Hasso Plattner Institut, University of Potsdam, Germany
- Jürgen Müller 0004 — RWTH Aachen, Germany
- Jürgen Müller 0005 — Hochschule Darmstadt, Germany
- Jürgen Müller 0006 — Berufsakademie Gera, Germany
- Jürgen Müller 0007 — DFKI Kaiserslautern, Germany (and 1 more)
- Jürgen Müller 0008 — DFKI Saarbrücken, Germany
- Jürgen Müller 0009 — Fraunhofer Institute of Optronics, System Technologies and Image Exploitation, Ettlingen, Germany
- Jürgen Müller 0010 — TU Freiberg, Germany
- Jürgen Müller 0011 — University of Bonn, Germany
- Jürgen Müller 0012 — Vienna University of Economics and Business, Austria
- Jürgen Müller 0013 — University of Stuttgart, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j6]T. Gharibyan, Wolfgang Luh, Jürgen Müller:
A lacunary version of Mergelian's approximation theorem. J. Approx. Theory 162(4): 709-716 (2010)- 2007
- [j5]Wolfgang Gawronski, Jürgen Müller, Martin Reinhard:
Reduced Cancellation in the Evaluation of Entire Functions and Applications to the Error Function. SIAM J. Numer. Anal. 45(6): 2564-2576 (2007) - 2005
- [j4]Wolfgang Luh, Jürgen Müller, Saminathan Ponnusamy
, P. Vasundhra:
Polynomial series expansions for confluent and Gaussian hypergeometric functions. Math. Comput. 74(252): 1937-1952 (2005) - 2002
- [j3]Wolfgang Luh, Valeri A. Martirosian, Jürgen Müller:
Restricted T-Universal Functions. J. Approx. Theory 114(2): 201-213 (2002) - 2000
- [j2]Jürgen Müller:
Series expansions for computing Bessel functions of variable order on bounded intervals. Numer. Algorithms 24(3): 299-308 (2000) - 1997
- [j1]Jürgen Müller:
Accelerated polynomial approximation of finite order entire functions by growth reduction. Math. Comput. 66(218): 743-761 (1997)
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-10-07 22:16 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:
