Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jc/jc15.bht:"
download as .bib file
@article{DBLP:journals/jc/ApostolicoLS99,
author = {Alberto Apostolico and
Gad M. Landau and
Steven Skiena},
title = {Matching for Run-Length Encoded Strings},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {4--16},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0493},
doi = {10.1006/JCOM.1998.0493},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/ApostolicoLS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/BungartzG99,
author = {Hans{-}Joachim Bungartz and
Michael Griebel},
title = {A Note on the Complexity of Solving Poisson's Equation for Spaces
of Bounded Mixed Derivatives},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {167--199},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0499},
doi = {10.1006/JCOM.1999.0499},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/BungartzG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/CoppersmithS99,
author = {Don Coppersmith and
Baruch Schieber},
title = {Lower Bounds on the Depth of Monotone Arithmetic Computations},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {17--29},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0494},
doi = {10.1006/JCOM.1998.0494},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/CoppersmithS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Cucker99,
author = {Felipe Cucker},
title = {Approximate Zeros and Condition Numbers},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {214--226},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0503},
doi = {10.1006/JCOM.1999.0503},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Cucker99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/CuckerG99,
author = {Felipe Cucker and
Dima Grigoriev},
title = {Complexity Lower Bounds for Approximation Algebraic Computation Trees},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {499--512},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0519},
doi = {10.1006/JCOM.1999.0519},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/CuckerG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Darracq99,
author = {Marie{-}C{\'{e}}cile Darracq},
title = {Complexity Analysis for Certain Convex Programming Problems},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {282--293},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0500},
doi = {10.1006/JCOM.1999.0500},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Darracq99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/EppsteinI99,
author = {David Eppstein and
Giuseppe F. Italiano},
title = {{PREFACE:} Festschrift for Zvi Galil},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {1--3},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0492},
doi = {10.1006/JCOM.1998.0492},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/EppsteinI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GalbiatiMV99,
author = {Giulia Galbiati and
Francesco Maffioli and
Carlo Viola},
title = {Randomized Algorithms over Finite Fields for the Exact Parity Base
Problem},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {537--556},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0522},
doi = {10.1006/JCOM.1999.0522},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GalbiatiMV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GaoWDH99,
author = {Sui{-}Xiang Gao and
Weili Wu and
Ding{-}Zhu Du and
Xiao{-}Dong Hu},
title = {The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True
for Ten Variables},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {526--536},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0521},
doi = {10.1006/JCOM.1999.0521},
timestamp = {Thu, 02 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GaoWDH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GiancarloG99,
author = {Raffaele Giancarlo and
Roberto Grossi},
title = {Parallel Construction and Query of Index Data Structures for Pattern
Matching on Square Matrices},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {30--71},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0496},
doi = {10.1006/JCOM.1998.0496},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GiancarloG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GiancarloG99a,
author = {Raffaele Giancarlo and
Daniela Guaiana},
title = {On-line Construction of Two-Dimensional Suffix Trees},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {72--127},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0495},
doi = {10.1006/JCOM.1998.0495},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GiancarloG99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/HeinrichS99,
author = {Stefan Heinrich and
Eug{\`{e}}ne Sindambiwe},
title = {Monte Carlo Complexity of Parametric Integration},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {317--341},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0508},
doi = {10.1006/JCOM.1999.0508},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/HeinrichS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/HuangKS99,
author = {Z. Huang and
Leonid G. Khachiyan and
Christopher (Krzysztof) Sikorski},
title = {Approximating Fixed Points of Weakly Contracting Mappings},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {200--213},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0504},
doi = {10.1006/JCOM.1999.0504},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/HuangKS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/KimLPC99,
author = {Dong Kyue Kim and
Jee{-}Soo Lee and
Kunsoo Park and
Yookun Cho},
title = {Efficient Algorithms for Approximate String Matching with Swaps},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {128--147},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0497},
doi = {10.1006/JCOM.1998.0497},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/KimLPC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Koiran99,
author = {Pascal Koiran},
title = {The Real Dimension Problem Is NPR-Complete},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {227--238},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0502},
doi = {10.1006/JCOM.1999.0502},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Koiran99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/LecotK99,
author = {Christian L{\'{e}}cot and
Faysal El Khettabi},
title = {Quasi-Monte Carlo Simulation of Diffusion},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {342--359},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0509},
doi = {10.1006/JCOM.1999.0509},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/LecotK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/MallerW99,
author = {Michael Maller and
Jennifer Whitehead},
title = {Efficient \emph{p}-adic Cell Decompositions for Univariate Polynomials},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {513--525},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0520},
doi = {10.1006/JCOM.1999.0520},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/MallerW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/MansourNV99,
author = {Yishay Mansour and
Noam Nisan and
Uzi Vishkin},
title = {Trade-offs between Communication Throughput and Parallel Time},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {148--166},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0498},
doi = {10.1006/JCOM.1998.0498},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/MansourNV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Novak99,
author = {Erich Novak},
title = {Intractability Results for Positive Quadrature Formulas and Extremal
Problems for Trigonometric Polynomials},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {299--316},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0507},
doi = {10.1006/JCOM.1999.0507},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Novak99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/PereverzevS99,
author = {Sergei V. Pereverzev and
Eberhard Schock},
title = {Brakhage's Implicit Iteration Method and the Information Complexity
of Equations with Operators Having Closed Range},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {385--401},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0511},
doi = {10.1006/JCOM.1999.0511},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jc/PereverzevS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Siegelmann99,
author = {Hava T. Siegelmann},
title = {Stochastic Analog Networks and Computational Complexity},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {451--475},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0505},
doi = {10.1006/JCOM.1999.0505},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Siegelmann99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Steinbauer99,
author = {Achim Steinbauer},
title = {Quadrature Formulas for the Wiener Measure},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {476--498},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0518},
doi = {10.1006/JCOM.1999.0518},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Steinbauer99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Traub99,
author = {Joseph F. Traub},
title = {From the Editor},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {449},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0516},
doi = {10.1006/JCOM.1999.0516},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Traub99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/WasilkowskiW99,
author = {Grzegorz W. Wasilkowski and
Henryk Wozniakowski},
title = {Weighted Tensor Product Algorithms for Linear Multivariate Problems},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {402--447},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0512},
doi = {10.1006/JCOM.1999.0512},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/WasilkowskiW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Werschulz99,
author = {Arthur G. Werschulz},
title = {Where Does Smoothness Count the Most for Two-Point Boundary-Value
Problems?},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {360--384},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0510},
doi = {10.1006/JCOM.1999.0510},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Werschulz99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/X99,
title = {1998 Best Paper Award},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {295},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0506},
doi = {10.1006/JCOM.1999.0506},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/X99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/X99a,
title = {1999 Prize for Achievement in Information-Based Complexity},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {296},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0513},
doi = {10.1006/JCOM.1999.0513},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/X99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/X99b,
title = {Year 2000 Prize for Achievement in Information-Based Complexity},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {297},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0514},
doi = {10.1006/JCOM.1999.0514},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/X99b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/X99c,
title = {Dagstuhl Invited Papers},
journal = {J. Complex.},
volume = {15},
number = {3},
pages = {298},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0515},
doi = {10.1006/JCOM.1999.0515},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/X99c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/X99d,
title = {Announcement: Best Paper Award Committee 1999},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {450},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0517},
doi = {10.1006/JCOM.1999.0517},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/X99d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Yakoubsohn99,
author = {Jean{-}Claude Yakoubsohn},
title = {Finding Zeros of Analytic Functions: alpha Theory for Secant Type
Methods},
journal = {J. Complex.},
volume = {15},
number = {2},
pages = {239--281},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0501},
doi = {10.1006/JCOM.1999.0501},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Yakoubsohn99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Yamakami99,
author = {Tomoyuki Yamakami},
title = {Polynomial Time Samplable Distributions},
journal = {J. Complex.},
volume = {15},
number = {4},
pages = {557--574},
year = {1999},
url = {https://doi.org/10.1006/jcom.1999.0523},
doi = {10.1006/JCOM.1999.0523},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Yamakami99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-24 06:34 CEST from data curated 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:
