Journal of Complexity, Volume 20

Volume 20, Number 1, February 2004

• Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski:
  From the Editors. 1-2
  
• Stefan Heinrich:
  Quantum approximation I. Embeddings of finite-dimensional L_p spaces. 5-26
  
• Stefan Heinrich:
  Quantum approximation II. Sobolev embeddings. 27-45
  
• Ian H. Sloan, Xiaoqun Wang, Henryk Wozniakowski:
  Finite-order weights imply tractability of multivariate integration. 46-74
  
• Carsten Wiegand:
  Quantum complexity of parametric integration. 75-96
  
• Mario Wschebor:
  Smoothed analysis of kappa(A). 97-107
  
• Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski:
  Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity). 108-131
  

Volume 20, Number 2-3, April-June 2004

• Cunsheng Ding, Chaoping Xing:
  Special issue on cryptography and coding theory. 133-
  
• Cunsheng Ding, Chaoping Xing:
  A short biography of Harald Niederreiter. 134-136
  
• Alexander Barg, Gregory A. Kabatiansky:
  A class of I.P.P. codes with efficient identification. 137-147
  
• Ian F. Blake, Theodoulos Garefalakis:
  On the complexity of the discrete logarithm and Diffie-Hellman problems. 148-170
  
• Manuel Bronstein, Patrick Solé:
  Linear recurrences with polynomial coefficients. 171-181
  
• Claude Carlet:
  On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions. 182-204
  
• Claude Carlet, Cunsheng Ding:
  Highly nonlinear mappings. 205-244
  
• Pascale Charpin:
  Normal Boolean functions. 245-265
  
• Lusheng Chen, Fang-Wei Fu, Victor K.-W. Wei:
  On the constructions and nonlinearity of binary vector-output correlation-immune functions. 266-283
  
• Qi Cheng, Ming-Deh A. Huang:
  On counting and generating curves over small finite fields. 284-296
  
• Tor Helleseth, Jyrki T. Lahtonen, Kalle Ranto:
  A simple proof to the minimum distance of Z₄-linear Goethals-like codes. 297-304
  
• Andrew Klapper:
  Distributional properties of d-FCSR sequences. 305-317
  
• Jyrki T. Lahtonen, San Ling, Patrick Solé, Dmitrii Zinoviev:
  Z₈-Kerdock codes and pseudorandom binary sequences. 318-330
  
• Alan G. B. Lauder, Daqing Wan:
  Computing zeta functions of Artin-Schreier curves over finite fields II. 331-349
  
• Wilfried Meidl, Arne Winterhof:
  On the linear complexity profile of some new explicit inversive pseudorandom numbers. 350-355
  
• Wakaha Ogata, Kaoru Kurosawa:
  Oblivious keyword search. 356-371
  
• Eirik Rosnes, Øyvind Ytrehus:
  On maximum length convolutional codes under a trellis complexity constraint. 372-403
  
• Alexander Russell, Igor Shparlinski:
  Classical and quantum function reconstruction via character evaluation. 404-422
  
• Igor Shparlinski, Ron Steinfeld:
  Noisy Chinese remaindering in the Lee norm. 423-437
  
• Yuansheng Tang, San Ling:
  On Viterbi-like algorithms and their application to Reed-Muller codes. 438-457
  
• Huaxiong Wang, Josef Pieprzyk:
  Shared generation of pseudo-random functions. 458-472
  

Volume 20, Number 4, August 2004

• Aicke Hinrichs:
  Covering numbers, Vapnik-ervonenkis classes and bounds for the star-discrepancy. 477-483
  
• Nikolai Chernov, Claire Lesort, Nandor Simányi:
  On the complexity of curve fitting algorithms. 484-492
  
• Josef Dick:
  On the convergence rate of the component-by-component construction of good lattice rules. 493-522
  
• Michael Maller:
  On invariance of degree for certain computations. 523-528
  
• Markus Schweighofer:
  On the complexity of Schmu"dgen's Positivstellensatz. 529-543
  
• Hong Zang, Tonghua Zhang, Wencheng Chen:
  Bifurcations of limit cycles from Quintic Hamiltonian systems with a double figure eight loop. 544-560
  
• Hrushikesh Narhar Mhaskar:
  On the tractability of multivariate integration and approximation by neural networks. 561-590
  

Volume 20, Number 5, October 2004

• Leszek Plaskota, Klaus Ritter:
  Guest Editors' Preface. 592
  
• Josef Dick, Ian H. Sloan, Xiaoqun Wang, Henryk Wozniakowski:
  Liberating the weights. 593-623
  
• Grzegorz W. Wasilkowski:
  On polynomial-time property for a class of randomized quadratures. 624-637
  
• Friedrich Pillichshammer:
  On the root mean square weighted L₂ discrepancy of scrambled nets. 638-653
  
• Jürgen Hartinger, Reinhold Kainhofer, Robert F. Tichy:
  Quasi-Monte Carlo algorithms for unbounded, weighted integration problems. 654-668
  
• Marek Kwas, Henryk Wozniakowski:
  Sharp error bounds on quantum Boolean summation in various settings. 669-698
  
• Arvid J. Bessen:
  The power of various real-valued quantum queries. 699-712
  
• Anargyros Papageorgiou:
  Average case quantum lower bounds for computing the Boolean mean. 713-731
  
• Norbert Hofmann, Thomas Müller-Gronbach:
  On the global error of Itô-Taylor schemes for strong approximation of scalar stochastic differential equations. 732-752
  
• Hrushikesh Narhar Mhaskar:
  Local quadrature formulas on the sphere. 753-772
  
• James M. Calvin:
  Lower bound on complexity of optimization of continuous functions. 773-795
  
• Boleslaw Z. Kacewicz:
  Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result. 796-806
  

Volume 20, Number 6, December 2004

• Jakob Creutzig, Przemyslaw Wojtaszczyk:
  Linear vs. nonlinear algorithms for linear problems. 807-820
  
• Boleslaw Z. Kacewicz:
  Randomized and quantum algorithms yield a speed-up for initial-value problems. 821-834
  
• Jerzy Mycka, José Félix Costa:
  Real recursive functions and their hierarchy. 835-857
  
• Chen Guanggui, Fang Gensun:
  Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure. 858-875
  
• Siegfried Graf, Harald Luschgy:
  Sharp asymptotics of the metric entropy for ellipsoids. 876-882
  

Last update Thu May 23 15:05:54 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page