default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 14
Volume 14, Number 1, March 1998
- Ian H. Sloan
, Henryk Wozniakowski:
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals? 1-33 - Peter Mathé:
Asymptotically Optimal Weighted Numerical Integration. 34-48 - Nader H. Bshouty:
On the Direct Sum Conjecture in the Straight Line Model. 49-62 - Michael Hatzitheodorou:
Shape from Shadows: A Hilbert Space Setting. 63-84 - Helmut Brass:
Linear Algorithms with Finite Deviation. 85-101 - Klaus Weihrauch:
A Refined Model of Computation for Continuous Problems. 102-121 - Francisco Curbera:
Optimal Integration of Lipschitz Functions with a Gaussian Weight. 122-149
Volume 14, Number 2, June 1998
- Stefan Heinrich:
Monte Carlo Complexity of Global Solution of Integral Equations. 151-175 - Peter Bürgisser:
On the Parallel Complexity of the Polynomial Ideal Membership Problem. 176-189 - Jin-yi Cai, Pu Cai, Yixin Zhu:
On A Scheduling Problem of Time Deteriorating Jobs. 190-209 - Michele Finelli, Giovanni Manzini, Luciano Margara:
Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata. 210-233 - Paolo Boldi, Sebastiano Vigna:
delta-Uniform BSS Machines. 234-256 - Xiaohan Huang, Victor Y. Pan:
Fast Rectangular Matrix Multiplication and Applications. 257-299
Volume 14, Number 3, September 1998
- New Prize for Achievement in Information-Based Complexity. 301-
- Knut Petras:
On the Complexity of Self-Validating Numerical Integration and Approximation of Functions with Singularities. 302-318 - Peter Mathé:
Relaxation of Product Markov Chains on Product Spaces. 319-332 - Karl-Heinz Küfer:
On the Asymptotic Average Number of Efficient Vertices in Multiple Objective Linear Programming. 333-377 - Peter Kirrinnis:
Partial Fraction Decomposition in (z) and Simultaneous Newton Iteration for Factorization in C[z]. 378-444
Volume 14, Number 4, December 1998
- 1997 Best Paper Award. 445-
- 1998 Best Paper Award Committee. 446-
- Prize for Achievement in Information-Based Complexity. 447-
- Jirí Matousek:
The Exponent of Discrepancy Is at Least 1.0669. 448-453 - Jean-Pierre Dedieu, Steve Smale:
Some Lower Bounds for the Complexity of Continuation Methods. 454-465 - Art B. Owen:
Scrambling Sobol' and Niederreiter-Xing Points. 466-489 - Vasco Brattka, Peter Hertling:
Feasible Real Random Access Machines. 490-526 - Jirí Matousek:
On the L2-Discrepancy for Anchored Boxes. 527-556 - Dorota Dabrowska, Marek A. Kowalski:
Approximating Band- and Energy-Limited Signals in the Presence of Jitter. 557-570
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:
