Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Heinrich, Stefan - Fachbereich Informatik, Technische Universität Kaiserslautern
The Randomized Information Complexity of Elliptic PDE
How Many Random Bits Do We Need for Monte Carlo Integration?
Monte Carlo Complexity of Global Solution of Integral Equations
Quantum Boolean Summation with Repetitions in the WorstAverage Setting ?
The randomized complexity of initial value Stefan Heinrich, Bernhard Milla
Monte Carlo Complexity of Parametric Integration
Randomized Approximation of Sobolev Embeddings II
Wavelet Monte Carlo Methods for the Global Solution of Integral Equations
The Randomized Complexity of Indefinite Integration
THE INVERSE OF THE STAR-DISCREPANCY DEPENDS LINEARLY ON THE DIMENSION
The Multilevel Method of Dependent Tests S. Heinrich
Randomized Approximation of Sobolev Embeddings III
Randomized Approximation of Sobolev Stefan Heinrich
Numerical Analysis on a Quantum Computer Stefan Heinrich
Monte Carlo Approximation of Weakly Singular Integral Operators
Multilevel Monte Carlo Methods Stefan Heinrich
Variance reduction by means of deterministic computation: Collision estimate
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
From Monte Carlo to Quantum Computation Stefan Heinrich
