Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Complexity AND YEAR=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantum approximation I. Embeddings of finite-dimensional
L_p
spaces
Stefan Heinrich
Journal of Complexity
20
(1), 2004, pp. 5-26
Quantum approximation II. Sobolev embeddings
Stefan Heinrich
Journal of Complexity
20
(1), 2004, pp. 27-45
Finite-order weights imply tractability of multivariate integration
Ian H. Sloan
,
Xiaoqun Wang
,
Henryk Wózniakowski
Journal of Complexity
20
(1), 2004, pp. 46-74
Quantum complexity of parametric integration
Carsten Wiegand
Journal of Complexity
20
(1), 2004, pp. 75-96
Smoothed analysis of
\kappa(A)
Mario Wschebor
Journal of Complexity
20
(1), 2004, pp. 97-107
Optimal designs for weighted approximation and integration of stochastic processes on
[O, \infty )
Leszek Plaskota
,
Klaus Ritter
,
Grzegorz W. Wasilkowski
Journal of Complexity
20
(1), 2004, pp. 108-131
A class of I.P.P. codes with efficient identification
Alexander Barg
,
Gregory Kabatiansky
Journal of Complexity
20
(2-3), 2004, pp. 137-147
On the complexity of the discrete logarithm and Diffie-Hellman problems
Ian F. Blake
,
Theo Garefalakis
Journal of Complexity
20
(2-3), 2004, pp. 148-170
Linear recurrences with polynomial coefficients
Manuel Bronstein
,
Patrick Solé
Journal of Complexity
20
(2-3), 2004, pp. 171-181
On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
Claude Carlet
Journal of Complexity
20
(2-3), 2004, pp. 182-204
Highly nonlinear mappings
Claude Carlet
,
Cunsheng Ding
Journal of Complexity
20
(2-3), 2004, pp. 205-244
Normal Boolean functions
Pascale Charpin
Journal of Complexity
20
(2-3), 2004, pp. 245-265
On the constructions and nonlinearity of binary vector-output correlation-immune functions
Lusheng Chen
,
Fang-Wei Fu
,
Victor K.-W. Wei
Journal of Complexity
20
(2-3), 2004, pp. 266-283
On counting and generating curves over small finite fields
Qi Cheng
,
Ming-Deh Huang
Journal of Complexity
20
(2-3), 2004, pp. 284-296
A simple proof to the minimum distance of
Z_4
-linear Goethals-like codes
Tor Helleseth
,
Jyrki Lahtonen
,
Kalle Ranto
Journal of Complexity
20
(2-3), 2004, pp. 297-304
Distributional properties of
d
-FCSR sequences
Andrew Klapper
Journal of Complexity
20
(2-3), 2004, pp. 305-317
Z_8
-Kerdock codes and pseudorandom binary sequences
Jyrki Lahtonen
,
San Ling
,
Patrick Solé
,
Dmitrii Zinoviev
Journal of Complexity
20
(2-3), 2004, pp. 318-330
Computing zeta functions of Artin-Schreier curves over finite fields II
Alan G.B. Lauder
,
Daqing Wan
Journal of Complexity
20
(2-3), 2004, pp. 331-349
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Wilfried Meidl
,
Arne Winterhof
Journal of Complexity
20
(2-3), 2004, pp. 350-355
Oblivious keyword search
Wakaha Ogata
,
Kaoru Kurosawa
Journal of Complexity
20
(2-3), 2004, pp. 356-371
On maximum length convolutional codes under a trellis complexity constraint
Eirik Rosnes
,
Øyvind Ytrehus
Journal of Complexity
20
(2-3), 2004, pp. 372-403
Classical and quantum function reconstruction via character evaluation
Alexander Russell
,
Igor E. Shparlinski
Journal of Complexity
20
(2-3), 2004, pp. 404-422
Noisy Chinese remaindering in the Lee norm
Igor E. Shparlinski
,
Ron Steinfeld
Journal of Complexity
20
(2-3), 2004, pp. 423-437
On Viterbi-like algorithms and their application to Reed-Muller codes
Yuansheng Tang
,
San Ling
Journal of Complexity
20
(2-3), 2004, pp. 438-457
Shared generation of pseudo-random functions
Huaxiong Wang
,
Josef Pieprzyk
Journal of Complexity
20
(2-3), 2004, pp. 458-472
Seiten 1
2
>