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 28 matches
- 2013
- Christoph Aistleitner:
On the inverse of the discrepancy for infinite dimensional infinite sequences. J. Complex. 29(2): 182-194 (2013) - Ioannis K. Argyros, Sanjay Kumar Khattri:
On the Secant method. J. Complex. 29(6): 454-471 (2013) - Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the complexity of solving quadratic Boolean systems. J. Complex. 29(1): 53-75 (2013) - Luca Brandolini, Leonardo Colzani, Giacomo Gigante, Giancarlo Travaglini:
On the Koksma-Hlawka inequality. J. Complex. 29(2): 158-172 (2013) - Christine Choirat, Raffaello Seri:
Numerical properties of generalized discrepancies on spheres of arbitrary dimension. J. Complex. 29(2): 216-235 (2013) - Ezequiel Dratman:
Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption. J. Complex. 29(3-4): 263-282 (2013) - Dinh Dung, Charles A. Micchelli:
Multivariate approximation by translates of the Korobov function on Smolyak grids. J. Complex. 29(6): 424-437 (2013) - Mario Fernández, Luis M. Pardo:
An Arithmetic Poisson Formula for the multi-variate resultant. J. Complex. 29(5): 323-350 (2013) - Leslaw Gajek, Wojciech Niemiro, Piotr Pokarowski:
Optimal Monte Carlo integration with fixed relative precision. J. Complex. 29(1): 4-26 (2013) - Bruno Grenet, Pascal Koiran, Natacha Portier:
On the complexity of the multivariate resultant. J. Complex. 29(2): 142-157 (2013) - Markus Hegland, Grzegorz W. Wasilkowski:
On tractability of approximation in special function spaces. J. Complex. 29(1): 76-91 (2013) - Joos Heintz, Bart Kuijpers, Andres Rojas Paredes:
Software Engineering and complexity in effective Algebraic Geometry. J. Complex. 29(1): 92-138 (2013) - Chao-Wen Huang, Chia-Wei Lee, Huang-Ming Gao, Sun-Yuan Hsieh:
The internal Steiner tree problem: Hardness and approximations. J. Complex. 29(1): 27-43 (2013) - Bahman Kalantari:
Algorithms for quaternion polynomial root-finding. J. Complex. 29(3-4): 302-322 (2013) - Ker-I Ko:
On the complexity of computing the Hausdorff distance. J. Complex. 29(3-4): 248-262 (2013) - Gerhard Larcher:
Probabilistic diophantine approximation and the distribution of Halton-Kronecker sequences. J. Complex. 29(6): 397-423 (2013) - Zhen Ma, Wen-Feng Qi, Tian Tian:
On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR. J. Complex. 29(2): 173-181 (2013) - Lev Markhasin:
Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension. J. Complex. 29(5): 370-388 (2013) - Pawel Przybylowicz wins the 2012 Information-Based Complexity Young Researcher Award. J. Complex. 29(1): 2 (2013)
- Pawel Siedlecki:
Uniform weak tractability. J. Complex. 29(6): 438-453 (2013) - Shu Tezuka:
On the discrepancy of generalized Niederreiter sequences. J. Complex. 29(3-4): 240-247 (2013) - Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann:
Efficient algorithms for the longest common subsequence problem with sequential substring constraints. J. Complex. 29(1): 44-52 (2013) - Grzegorz W. Wasilkowski:
Erratum to "Liberating the dimension for L2-approximation" [Journal of Complexity 28 (2012) 304-319]. J. Complex. 29(1): 139 (2013) - Grzegorz W. Wasilkowski:
On tractability of linear tensor product problems for ∞∞-variate classes of functions. J. Complex. 29(5): 351-369 (2013) - Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award. J. Complex. 29(2): 141 (2013)
- Haizhang Zhang, Jun Zhang:
Vector-valued reproducing kernel Banach spaces with applications to multi-task learning. J. Complex. 29(2): 195-215 (2013) - Shengli Zhao, Pengfei Li, Min-Qian Liu:
On blocked resolution IV designs containing clear two-factor interactions. J. Complex. 29(5): 389-395 (2013) - Yong-Dao Zhou, Kai-Tai Fang, Jian-Hui Ning:
Mixture discrepancy for quasi-random point sets. J. Complex. 29(3-4): 283-301 (2013)
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 2024-12-24 13:55 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