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