default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 18
Volume 18, Number 1, March 2002
- Stefan Heinrich:
Quantum Summation with an Application to Integration. 1-50 - Asa Ben-Hur
, Hava T. Siegelmann, Shmuel Fishman:
A Theory of Complexity for Continuous Time Systems. 51-86 - Wilfried Meidl, Harald Niederreiter:
Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. 87-103 - Felipe Cucker:
Real Computations with Fake Numbers. 104-134 - Rong-Xian Yue, Fred J. Hickernell:
The Discrepancy and Gain Coefficients of Scrambled Digital Nets. 135-151 - Shahar Mendelson:
Learnability in Hilbert Spaces with Reproducing Kernels. 152-170 - Anargyros Papageorgiou:
The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration. 171-186 - Jean-Pierre Dedieu, Myong-Hi Kim:
Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives. 187-209 - K. J. Harrison, Jonathan R. Partington, Jo A. Ward:
Input-Output Identifiability of Continuous-Time Linear Systems. 210-223 - Boris Ryabko, Flemming Topsøe:
On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources. 224-241 - Elena Celledoni, Arieh Iserles, Syvert P. Nørsett, Bojan Orel:
Complexity Theory for Lie-Group Solvers. 242-286 - Jakob Creu:
Relations between Classical, Average, and Probabilistic Kolmogorov Widths. 287-303 - Orizon Pereira Ferreira, Benar Fux Svaiter:
Kantorovich's Theorem on Newton's Method in Riemannian Manifolds. 304-329 - Youming Li, Grzegorz W. Wasilkowski:
Worst Case Complexity of Weighted Approximation and Integration over Rd. 330-345 - Elizabeth Mauch:
Complexity Estimates for Representations of Schmu"dgen Type. 346-355 - Jovan Dj. Golic, Renato Menicocci:
Computation of Edit Probabilities and Edit Distances for the A5-Type Keystream Generator. 356-374 - Michael N. Vrahatis, Basilis Boutsinas, Panagiotis D. Alevizos, Georgios Pavlides:
The New k-Windows Algorithm for Improving the k-Means Clustering Algorithm. 375-391
Volume 18, Number 2, June 2002
- Sergei V. Pereverzev, Grzegorz W. Wasilkowski:
Dagstuhl 2000. 393- - Norbert Hofmann, Thomas Müller-Gronbach, Klaus Ritter:
Linear vs Standard Information for Scalar Stochastic Differential Equations. 394-414 - Gerhard Larcher, Friedrich Pillichshammer:
On the L2-Discrepancy of the Sobol-Hammersley Net in Dimension 3. 415-448 - Hrushikesh Narhar Mhaskar:
On the Representation of Band Limited Functions Using Finitely Many Bits. 449-478 - Ian H. Sloan, Henryk Wozniakowski:
Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces. 479-499 - Peter Mathé, Sergei V. Pereverzev:
Direct Estimation of Linear Functionals from Indirect Noisy Observations. 500-516 - Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski:
Average Case Complexity of Weighted Approximation and Integration over R+. 517-544 - Eugene L. Allgower, Kurt Georg, Christopher A. Sikorski:
Joint AMS-SIAM Conference. 545-546 - Eugene L. Allgower, Andrew J. Sommese:
Piecewise Linear Approximation of Smooth Compact Fibers. 547-556 - Mehiddin Al-Baali:
Extra-Updates Criterion for the Limited Memory BFGS Algorithm for Large Scale Nonlinear Optimizatio. 557-572 - Eugene L. Allgower, Melissa Erdmann, Kurt Georg:
On the Complexity of Exclusion Algorithms for Optimization. 573-588 - R. Baker Kearfott, Jianwei Dian:
Verifying Topological Indices for Higher-Order Rank Deficiencies. 589-611 - Bernard Mourrain, Michael N. Vrahatis, Jean-Claude Yakoubsohn:
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree. 612-640 - Spencer D. Shellman, Kris Sikorski:
A Two-Dimensional Bisection Envelope Algorithm for Fixed Points. 641-659 - Arthur G. Werschulz, Henryk Wozniakowski:
What Is the Complexity of Volume Calculation? 660-678
Volume 18, Number 3, September 2002
- Joseph F. Traub:
FROM THE EDITOR. 679- - Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
2001 Best Paper Award. 680- - Fred J. Hickernell, Peter Mathé:
2002 Best Paper Award Committee. 681- - 2002 Prize for Achievement in Information-Based Complexity. 682-
- Xiaoqun Wang:
A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms. 683-701 - Boleslaw Z. Kacewicz:
Complexity of Nonlinear Two-Point Boundary-Value Problems. 702-738 - Ding-Xuan Zhou:
The covering number in learning theory. 739-767 - Ingo Steinwart:
Support Vector Machines are Universally Consistent. 768-791 - Youming Li:
Applicability of Smolyak's Algorithms to Certain Banach Spaces of Multivariate Functions. 792-814 - Yongping Liu, Guiqiao Xu:
The Infinite-Dimensional Widths and Optimal Recovery of Generalized Besov Classes. 815-832 - Petra Huhn, Karl Heinz Borgwardt:
Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure. 833-910
Volume 18, Number 4, December 2002
- 2003 Information-Based Complexity Prize Committee. 911-
- Peter Hertling:
Topological Complexity of Zero Finding with Algebraic Operations. 912-942 - Frances Y. Kuo, Stephen Joe:
Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points. 943-976 - Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa:
An Analog Characterization of the Grzegorczyk Hierarchy. 977-1000 - Gavin Brown, Dai Feng, Sun Yong Sheng:
Kolmogorov Width of Classes of Smooth Functions on the Sphere Sd-1. 1001-1023 - Jie Wang:
Complete on Average Boolean Satisfiability. 1024-1036
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.
last updated on 2025-12-04 01:28 CET 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:
