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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Matching for run-length encoded strings
Alberto Apostolico
,
Gad M. Landau
,
Steven Skiena
Journal of Complexity
15
(1), 1999, pp. 4-16
Lower bounds on the depth of monotone arithmetic computations
Don Coppersmith
,
Baruch Schieber
Journal of Complexity
15
(1), 1999, pp. 17-29
Parallel construction and query of index data structures for pattern matching on square matrices
Raffaele Giancarlo
,
Roberto Grossi
Journal of Complexity
15
(1), 1999, pp. 30-71
On-line construction of two-dimensional suffix trees
Raffaele Giancarlo
,
Daniela Guaiana
Journal of Complexity
15
(1), 1999, pp. 72-127
Efficient algorithms for approximate string matching with swaps
Dong Kyue Kim
,
Jee-Soo Lee
,
Kunsoo Park
,
Yookun Cho
Journal of Complexity
15
(1), 1999, pp. 128-147
Trade-offs between communication throughput and parallel time
Yishay Mansour
,
Noam Nisan
,
Uzi Vishkin
Journal of Complexity
15
(1), 1999, pp. 148-166
A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
Hans-Joachim Bungartz
,
Michael Griebel
Journal of Complexity
15
(2), 1999, pp. 167-199
Approximating fixed points of weakly contracting mappings
Z. Huang
,
L. Khachiyan
,
K. Sikorski
Journal of Complexity
15
(2), 1999, pp. 200-213
Approximate zeros and conditions numbers
Felipe Cucker
Journal of Complexity
15
(2), 1999, pp. 214-226
The real dimension problem is
NP_{R}
-complete
Pascal Koiran
Journal of Complexity
15
(2), 1999, pp. 227-238
Finding zeros of analytic functions:
\alpha
theory for secant type methods
Jean-Claude Yakoubsohn
Journal of Complexity
15
(2), 1999, pp. 239-281
Complexity analysis for certain convex programming problems
Marie-Cécile Darracq
Journal of Complexity
15
(2), 1999, pp. 282-293
Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials
Erich Novak
Journal of Complexity
15
(3), 1999, pp. 299-316
Monte Carlo complexity of parametric integration
Stefan Heinrich
,
Eugène Sindambiwe
Journal of Complexity
15
(3), 1999, pp. 317-341
Quasi-Monte Carlo simulation of diffusion
Christian Lécot
,
Faysal El Khettabi
Journal of Complexity
15
(3), 1999, pp. 342-359
Where does smoothness count the most for two-point boundary-value problems?
Arthur G. Werschulz
Journal of Complexity
15
(3), 1999, pp. 360-384
Brakhage's implicit iteration method and the information complexity of equations with operators having closed range
Sergei V. Pereverzev
,
Eberhard Schock
Journal of Complexity
15
(3), 1999, pp. 385-401
Weighted tensor product algorithms for linear multivariate problems
G.W. Wasilkowski
,
H. Woźniakowski
Journal of Complexity
15
(3), 1999, pp. 402-447
Stochastic analog networks and computational complexity
Hava T. Siegelmann
Journal of Complexity
15
(4), 1999, pp. 451-475
Quadrature formulas for the Wiener measure
Achim Steinbauer
Journal of Complexity
15
(4), 1999, pp. 476-498
Complexity lower bounds for approximation algebraic computation trees
Felipe Cucker
,
Dima Grigoriev
Journal of Complexity
15
(4), 1999, pp. 499-512
Efficient
p
-adic cell decompositions for univariate polynomials
Michael Maller
,
Jennifer Whitehead
Journal of Complexity
15
(4), 1999, pp. 513-525
The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables
Sui-Xiang Gao
,
Weili Wu
,
Ding-Zhu Du
,
Xiao-Dong Hu
Journal of Complexity
15
(4), 1999, pp. 526-536
Randomized algorithms over finite fields for the exact parity base problem
Giulia Galbiati
,
Francesco Maffioli
,
Carlo Viola
Journal of Complexity
15
(4), 1999, pp. 537-556
Polynomial time samplable distributions
Tomoyuki Yamakami
Journal of Complexity
15
(4), 1999, pp. 557-574