


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 1999
- Alberto Apostolico, Gad M. Landau, Steven Skiena
:
Matching for Run-Length Encoded Strings. J. Complex. 15(1): 4-16 (1999) - Hans-Joachim Bungartz, Michael Griebel:
A Note on the Complexity of Solving Poisson's Equation for Spaces of Bounded Mixed Derivatives. J. Complex. 15(2): 167-199 (1999) - Don Coppersmith, Baruch Schieber:
Lower Bounds on the Depth of Monotone Arithmetic Computations. J. Complex. 15(1): 17-29 (1999) - Felipe Cucker
:
Approximate Zeros and Condition Numbers. J. Complex. 15(2): 214-226 (1999) - Felipe Cucker
, Dima Grigoriev:
Complexity Lower Bounds for Approximation Algebraic Computation Trees. J. Complex. 15(4): 499-512 (1999) - Marie-Cécile Darracq:
Complexity Analysis for Certain Convex Programming Problems. J. Complex. 15(2): 282-293 (1999) - David Eppstein, Giuseppe F. Italiano:
PREFACE: Festschrift for Zvi Galil. J. Complex. 15(1): 1-3 (1999) - Giulia Galbiati, Francesco Maffioli, Carlo Viola:
Randomized Algorithms over Finite Fields for the Exact Parity Base Problem. J. Complex. 15(4): 537-556 (1999) - Sui-Xiang Gao, Weili Wu, Ding-Zhu Du, Xiao-Dong Hu:
The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables. J. Complex. 15(4): 526-536 (1999) - Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. J. Complex. 15(1): 30-71 (1999) - Raffaele Giancarlo, Daniela Guaiana:
On-line Construction of Two-Dimensional Suffix Trees. J. Complex. 15(1): 72-127 (1999) - Stefan Heinrich, Eugène Sindambiwe:
Monte Carlo Complexity of Parametric Integration. J. Complex. 15(3): 317-341 (1999) - Z. Huang, Leonid G. Khachiyan, Christopher (Krzysztof) Sikorski:
Approximating Fixed Points of Weakly Contracting Mappings. J. Complex. 15(2): 200-213 (1999) - Dong Kyue Kim, Jee-Soo Lee, Kunsoo Park, Yookun Cho:
Efficient Algorithms for Approximate String Matching with Swaps. J. Complex. 15(1): 128-147 (1999) - Pascal Koiran:
The Real Dimension Problem Is NPR-Complete. J. Complex. 15(2): 227-238 (1999) - Christian Lécot, Faysal El Khettabi:
Quasi-Monte Carlo Simulation of Diffusion. J. Complex. 15(3): 342-359 (1999) - Michael Maller, Jennifer Whitehead:
Efficient p-adic Cell Decompositions for Univariate Polynomials. J. Complex. 15(4): 513-525 (1999) - Yishay Mansour, Noam Nisan, Uzi Vishkin:
Trade-offs between Communication Throughput and Parallel Time. J. Complex. 15(1): 148-166 (1999) - Erich Novak:
Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials. J. Complex. 15(3): 299-316 (1999) - Sergei V. Pereverzev
, Eberhard Schock:
Brakhage's Implicit Iteration Method and the Information Complexity of Equations with Operators Having Closed Range. J. Complex. 15(3): 385-401 (1999) - Hava T. Siegelmann:
Stochastic Analog Networks and Computational Complexity. J. Complex. 15(4): 451-475 (1999) - Achim Steinbauer:
Quadrature Formulas for the Wiener Measure. J. Complex. 15(4): 476-498 (1999) - Joseph F. Traub:
From the Editor. J. Complex. 15(4): 449- (1999) - Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Weighted Tensor Product Algorithms for Linear Multivariate Problems. J. Complex. 15(3): 402-447 (1999) - Arthur G. Werschulz:
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems? J. Complex. 15(3): 360-384 (1999) - 1998 Best Paper Award. J. Complex. 15(3): 295- (1999)
- 1999 Prize for Achievement in Information-Based Complexity. J. Complex. 15(3): 296- (1999)
- Year 2000 Prize for Achievement in Information-Based Complexity. J. Complex. 15(3): 297- (1999)
- Dagstuhl Invited Papers. J. Complex. 15(3): 298- (1999)
- Announcement: Best Paper Award Committee 1999. J. Complex. 15(4): 450- (1999)
skipping 2 more matches
loading more results
failed to load more results, please try again later

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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-26 19:20 CET 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