![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Martin Lotz
Person information
- affiliation: University of Warwick, Mathematics Institute, UK
- affiliation (former): University of Manchester, School of Mathematics, UK
- affiliation (former): University of Edinburgh, Scotland, UK
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j12]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta
, Martin Lotz:
Dimensionality reduction for k-distance applied to persistent homology. J. Appl. Comput. Topol. 5(4): 671-691 (2021) - [i8]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz:
Dimensionality Reduction for k-Distance Applied to Persistent Homology. CoRR abs/2110.05897 (2021) - 2020
- [j11]Martin Lotz, Vanni Noferini
:
Wilkinson's Bus: Weak Condition Numbers, with an Application to Singular Polynomial Eigenproblems. Found. Comput. Math. 20(6): 1439-1473 (2020) - [j10]Dennis Amelunxen, Martin Lotz
, Jake Walvin:
Effective Condition Number Bounds for Convex Regularization. IEEE Trans. Inf. Theory 66(4): 2501-2516 (2020) - [c2]Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta
, Martin Lotz:
Dimensionality Reduction for k-Distance Applied to Persistent Homology. SoCG 2020: 10:1-10:15
2010 – 2019
- 2019
- [j9]Sajad Daei
, Farzan Haddadi
, Arash Amini
, Martin Lotz
:
On the Error in Phase Transition Computations for Compressed Sensing. IEEE Trans. Inf. Theory 65(10): 6620-6632 (2019) - [i7]Martin Lotz, Vanni Noferini:
Wilkinson's bus: Weak condition numbers, with an application to singular polynomial eigenproblems. CoRR abs/1905.05466 (2019) - 2018
- [i6]Sajad Daei, Farzan Haddadi, Arash Amini, Martin Lotz:
On the Error in Phase Transition Computations for Compressed Sensing. CoRR abs/1806.10583 (2018) - [i5]Martin Lotz, Michael B. McCoy, Ivan Nourdin, Giovanni Peccati, Joel A. Tropp:
Concentration of the Intrinsic Volumes of a Convex Body. CoRR abs/1810.12412 (2018) - 2017
- [j8]Dennis Amelunxen, Martin Lotz
:
Intrinsic Volumes of Polyhedral Cones: A Combinatorial Perspective. Discret. Comput. Geom. 58(2): 371-409 (2017) - [j7]Dennis Amelunxen, Martin Lotz:
Average-case complexity without the black swans. J. Complex. 41: 82-101 (2017) - [i4]Martin Lotz:
Persistent homology for low-complexity models. CoRR abs/1709.01037 (2017) - 2013
- [i3]Dennis Amelunxen, Martin Lotz
, Michael B. McCoy, Joel A. Tropp:
Living on the edge: A geometric theory of phase transitions in convex optimization. CoRR abs/1303.6672 (2013) - 2010
- [j6]Felipe Cucker
, Raphael A. Hauser
, Martin Lotz:
Adversarial smoothed analysis. J. Complex. 26(3): 255-262 (2010)
2000 – 2009
- 2008
- [j5]Peter Bürgisser, Felipe Cucker
, Martin Lotz:
The probability that a slightly perturbed numerical analysis problem is difficult. Math. Comput. 77(263): 1559-1583 (2008) - 2007
- [j4]Peter Bürgisser, Martin Lotz:
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties. Found. Comput. Math. 7(1): 59-86 (2007) - 2005
- [j3]Peter Bürgisser, Felipe Cucker
, Martin Lotz:
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets. Found. Comput. Math. 5(4): 351-387 (2005) - [i2]Peter Bürgisser, Martin Lotz:
The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties. CoRR abs/cs/0502044 (2005) - 2004
- [j2]Martin Lotz, Johann A. Makowsky:
On the algebraic complexity of some families of coloured Tutte polynomials. Adv. Appl. Math. 32(1-2): 327-349 (2004) - [j1]Peter Bürgisser, Martin Lotz:
Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3): 464-482 (2004) - 2003
- [i1]Peter Bürgisser, Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. CoRR cs.CC/0301016 (2003) - 2002
- [c1]Peter Bürgisser, Martin Lotz:
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps. FOCS 2002: 659-668
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint