Managing periodically updated data in relational databases: a stochastic modeling approach
Journal of the ACM (JACM)
LeZi-update: an information-theoretic framework for personal mobility tracking in PCS networks
Wireless Networks - Selected Papers from Mobicom'99
SIGACT news complexity theory column 31
ACM SIGACT News
International Journal of Computer Vision - Special issue on statistical and computational theories of vision: Part II
Real computations with fake numbers
Journal of Complexity
What is the complexity of volume calculation?
Journal of Complexity
A constructive approach to strong tractability using Quasi-Monte Carlo algorithms
Journal of Complexity
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
The Complexity of Real Recursive Functions
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Discrepancy Theory and Its Application to Finance
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Length Estimation for Curves with Different Samplings
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Length Estimation for Curves with epsilon-Uniform Sampling
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Strong tractability of multivariate integration using quasi-Monte Carlo algorithms
Mathematics of Computation
Length estimation for curves with different samplings
Digital and image geometry
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Mathematics of Computation
The effective dimension and quasi-Monte Carlo integration
Journal of Complexity
Algorithmic analysis of irrational rotations in a single neuron model
Journal of Complexity
Sufficient conditions for fast quasi-Monte Carlo convergence
Journal of Complexity
Open problems for tractability of multivariate integration
Journal of Complexity
I-binomial scrambling of digital nets and sequences
Journal of Complexity
Continuous-time computation with restricted integration capabilities
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Asymptotics for length and trajectory from cumulative chord piecewise-quartics
Fundamenta Informaticae
The power of various real-valued quantum queries
Journal of Complexity
Finite-order weights imply tractability of linear multivariate problems
Journal of Approximation Theory
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Quantum Information Processing
Learning smooth objects by probing
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Encyclopedia of Computer Science
On the necessity of low-effective dimension
Journal of Complexity
The Quantum Setting with Randomized Queries for Continuous Problems
Quantum Information Processing
Computability of Solutions of Operator Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning smooth shapes by probing
Computational Geometry: Theory and Applications
Tractability of quasilinear problems I: General results
Journal of Approximation Theory
A new conceptual framework for analog computation
Theoretical Computer Science
Generalized tractability for multivariate problems Part I
Journal of Complexity
A survey of randomized algorithms for control synthesis and performance verification
Journal of Complexity
Lattice rule algorithms for multivariate approximation in the average case setting
Journal of Complexity
Multivariate L∞ approximation in the worst case setting over reproducing kernel Hilbert spaces
Journal of Approximation Theory
Are unbounded linear operators computable on the average for Gaussian measures?
Journal of Complexity
Complexity of Gaussian-radial-basis networks approximating smooth functions
Journal of Complexity
On efficient Monte Carlo-based statistical static timing analysis of digital circuits
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
On the power of standard information for multivariate approximation in the worst case setting
Journal of Approximation Theory
On the tractability of linear tensor product problems in the worst case
Journal of Complexity
Finite-order weights imply tractability of linear multivariate problems
Journal of Approximation Theory
On the necessity of low-effective dimension
Journal of Complexity
External versus internal parameterizations for lengths of curves with nonuniform samplings
Proceedings of the 11th international conference on Theoretical foundations of computer vision
On tractability of neural-network approximation
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Estimating the average of a Lipschitz-continuous function from one sample
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Advanced variance reduction and sampling techniques for efficient statistical timing analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An Interview with Joseph F. Traub
Ubiquity
Improved particle filters for multi-target tracking
Journal of Computational Physics
The computational power of continuous dynamic systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Asymptotics for Length and Trajectory from Cumulative Chord Piecewise-Quartics
Fundamenta Informaticae
The cost of deterministic, adaptive, automatic algorithms: Cones, not balls
Journal of Complexity
| Hi-index | 0.01 |