default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Glashoff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i9]Klaus Glashoff, Claus Peter Ortlieb:
Composition Operators, Matrix Representation, and the Finite Section Method: A Theoretical Framework for Maps between Shapes. CoRR abs/1705.00325 (2017)- [i8]Klaus Glashoff, Claus Peter Ortlieb:
A Note on Properties of Discrete Composition Operators. CoRR abs/1705.00328 (2017) - 2016
- [c3]Davide Eynard, Emanuele Rodolà
, Klaus Glashoff, Michael M. Bronstein:
Coupled Functional Maps. 3DV 2016: 399-407 - [c2]Artiom Kovnatsky, Klaus Glashoff, Michael M. Bronstein:
MADMM: A Generic Algorithm for Non-smooth Optimization on Manifolds. ECCV (5) 2016: 680-696 - 2015
- [j6]Davide Eynard, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff, Alexander M. Bronstein:
Multimodal Manifold Analysis by Simultaneous Diagonalization of Laplacians. IEEE Trans. Pattern Anal. Mach. Intell. 37(12): 2505-2517 (2015) - [i7]Artiom Kovnatsky, Klaus Glashoff, Michael M. Bronstein:
MADMM: a generic algorithm for non-smooth optimization on manifolds. CoRR abs/1505.07676 (2015) - 2013
- [j5]Artiom Kovnatsky, Michael M. Bronstein, Alexander M. Bronstein, Klaus Glashoff, Ron Kimmel:
Coupled quasi-harmonic bases. Comput. Graph. Forum 32(2): 439-448 (2013) - [i6]Klaus Glashoff, Michael M. Bronstein:
Almost-commuting matrices are almost jointly diagonalizable. CoRR abs/1305.2135 (2013) - [i5]Klaus Glashoff, Michael M. Bronstein:
Asymptotic metrics on the space of matrices under the commutation relation. CoRR abs/1305.2384 (2013) - [i4]Michael M. Bronstein, Klaus Glashoff, Terry A. Loring:
Making Laplacians commute. CoRR abs/1307.6549 (2013) - [i3]Michael M. Bronstein, Klaus Glashoff:
Heat kernel coupling for multiple graph analysis. CoRR abs/1312.3035 (2013) - 2012
- [c1]Klaus Glashoff, Michael M. Bronstein:
Structure from Motion Using Augmented Lagrangian Robust Factorization. 3DIMPVT 2012: 379-386 - [i2]Davide Eynard, Klaus Glashoff, Michael M. Bronstein, Alexander M. Bronstein:
Multimodal diffusion geometry by joint diagonalization of Laplacians. CoRR abs/1209.2295 (2012) - [i1]Artiom Kovnatsky, Michael M. Bronstein, Alexander M. Bronstein, Klaus Glashoff, Ron Kimmel:
Coupled quasi-harmonic bases. CoRR abs/1210.0026 (2012) - 2010
- [j4]Klaus Glashoff:
An Intensional Leibniz Semantics for Aristotelian Logic. Rev. Symb. Log. 3(2): 262-272 (2010)
2000 – 2009
- 2005
- [j3]Klaus Glashoff:
Aristotelian Syntax from a Computational-Combinatorial Point of View. J. Log. Comput. 15(6): 949-973 (2005)
1990 – 1999
- 1990
- [j2]Klaus Glashoff, Knut Merten:
Ein effizientes numerisches Verfahren zur Berechnung von Signallaufzeiten auf Verbindungsleitungen in integrierten Schaltungen. Inform. Forsch. Entwickl. 5(1): 35-41 (1990)
1970 – 1979
- 1972
- [j1]Klaus Glashoff:
Über eine Penalty-Methode. Computing 10(1-2): 157-165 (1972)
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 23:03 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:
