default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Alberto Grünbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]F. Alberto Grünbaum, Manuel Domínguez de la Iglesia
:
Stochastic LU factorizations, Darboux transformations and urn models. J. Appl. Probab. 55(3): 862-886 (2018)- [j12]Takuya Machida, F. Alberto Grünbaum:
Some limit laws for quantum walks with applications to a version of the Parrondo paradox. Quantum Inf. Process. 17(9): 241 (2018) - 2016
- [i2]F. Alberto Grünbaum, Inés Pacharoni, Ignacio Nahuel Zurrián:
Time and band limiting for matrix valued functions. CoRR abs/1604.06510 (2016) - 2015
- [j11]F. Alberto Grünbaum, Takuya Machida:
A limit theorem for a 3-period time-dependent quantum walk. Quantum Inf. Comput. 15(1-2): 50-60 (2015) - 2012
- [j10]María José Cantero, F. Alberto Grünbaum, Leandro Moral, Luis Velázquez:
The CGMV method for quantum walks. Quantum Inf. Process. 11(5): 1149-1192 (2012)
2000 – 2009
- 2008
- [j9]F. Alberto Grünbaum, Manuel D. de la Iglesia:
Matrix Valued Orthogonal Polynomials Arising from Group Representation Theory and a Family of Quasi-Birth-and-Death Processes. SIAM J. Matrix Anal. Appl. 30(2): 741-761 (2008) - 2007
- [j8]F. Alberto Grünbaum, Manuel D. de la Iglesia:
Matrix-Valued Orthogonal Polynomials Related to SU(N+ 1), Their Algebras of Differential Operators, and the Corresponding Curves. Exp. Math. 16(2): 189-207 (2007) - [j7]F. Alberto Grünbaum, Laura Felicia Matusevich:
An Identification Problem for Multiterminal Networks: Solving for the Traffic Matrix from Input-Output Measurements. Internet Math. 3(2): 233-252 (2007) - [j6]Antonio J. Durán Guardeño, F. Alberto Grünbaum:
Matrix orthogonal polynomials satisfying second-order differential equations: Coping without help from group representation theory. J. Approx. Theory 148(1): 35-48 (2007) - [i1]F. Alberto Grünbaum:
QBD processes and matrix orthogonal polynomilas: somw new explicit examples. Numerical Methods for Structured Markov Chains 2007 - 2005
- [j5]Antonio J. Durán Guardeño, F. Alberto Grünbaum:
Orthogonal matrix polynomials, scalar-type Rodrigues' formulas and Pearson equations. J. Approx. Theory 134(2): 267-280 (2005) - 2002
- [j4]F. Alberto Grünbaum, Laura Felicia Matusevich:
Explicit inversion formulas for a model in diffuse tomography. Adv. Appl. Math. 29(2): 172-183 (2002) - [j3]F. Alberto Grünbaum, Laura Felicia Matusevich:
A nonlinear inverse problem inspired by three-dimensional diffuse tomography: Explicit formulas. Int. J. Imaging Syst. Technol. 12(5): 198-203 (2002) - 2000
- [j2]F. Alberto Grünbaum:
Diffuse tomography: Using time-of-flight information in a two-dimensional model. Int. J. Imaging Syst. Technol. 11(5): 283-286 (2000)
1980 – 1989
- 1984
- [j1]F. Alberto Grünbaum:
A remark on radar ambiguity functions. IEEE Trans. Inf. Theory 30(1): 126-127 (1984)
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-04-24 22:52 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:
