h1

h2

h3

h4

h5
h6

114510

Lehrstuhl für Mathematik C (Analysis) Also known as:mathc
IDI:(DE-82)114510_20140620

RWTH Aachen    Lehrstuhl für Mathematik der Informationsverarbeitung

Recent Publications

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;
Learning deep linear neural networks : Riemannian gradient flows and convergence to global minimizers
Information and Inference iaaa039 () [10.1093/imaiai/iaaa039]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;
One-bit compressed sensing with partial Gaussian circulant matrices
Information and Inference 9(3), 601-626 () [10.1093/imaiai/iaz017]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;
Optimal confidence for Monte Carlo integration of smooth functions
Advances in computational mathematics 45, 3095-3122 () [10.1007/s10444-019-09728-3]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Contribution to a book/Contribution to a conference proceedings  ;  ;
How to Secure Matchings Against Edge Failures
36th International Symposium on Theoretical Aspects of Computer Science : STACS 2019, March 13-16, 2019, Berlin, Germany / edited by Rolf Niedermeier, Christophe Paul
36. International Symposium on Theoretical Aspects of Computer Science, STACS 2019, BerlinBerlin, Germany, 13 Mar 2019 - 16 Mar 20192019-03-132019-03-16
Saarbrücken/Wadern, Germany : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Leibniz international proceedings in informatics : LIPIcs 126, 38:1-38:16 () [10.4230/LIPIcs.STACS.2019.38]  GO OpenAccess  Download fulltext Files BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
European journal of operational research : EJOR 279(2), 308-319 () [10.1016/j.ejor.2019.05.045]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;  ;
Approximately Coloring Graphs Without Long Induced Paths
Algorithmica 81(8), 3186-3199 () [10.1007/s00453-019-00577-6]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;
Low-Rank Matrix Recovery via Rank One Tight Frame Measurements
The journal of Fourier analysis and applications 25(2), 588-593 () [10.1007/s00041-017-9579-x]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article/Contribution to a book
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
EURO journal on computational optimization 6(4), 315-337 () [10.1007/s13675-018-0097-7] special issue: "Part II: Special Issue on Robust Combinatorial Optimization / Issue Editors: Arie M.C.A. Koster, Michael Poss"  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;  ;
On the Strong n-partite Tournaments with Exactly Two Cycles of Length n − 1
Acta mathematicae applicatae sinica / English series 34(4), 710-717 () [10.1007/s10255-018-0780-8]  GO BibTeX | EndNote: XML, Text | RIS

http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png Journal Article  ;  ;
Improved bounds for sparse recovery from subsampled random convolutions
The annals of applied probability 28(6), 3491-3527 () [10.1214/18-AAP1391]  GO BibTeX | EndNote: XML, Text | RIS

All known publications ...
Download: BibTeX | EndNote XML,  Text | RIS | 


 Record created 2014-07-16, last modified 2020-01-14



Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)