Остановите войну!
for scientists:
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 27 matches
- 2004
- Zheng-Jian Bai, Raymond H. Chan:
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation. Theor. Comput. Sci. 315(2-3): 309-318 (2004) - Andrej Bauer, Lars Birkedal, Dana S. Scott:
Equilogical spaces. Theor. Comput. Sci. 315(1): 35-59 (2004) - Stefano Berardi, Chantal Berline:
Building continuous webbed models for system F. Theor. Comput. Sci. 315(1): 3-34 (2004) - Dario Bini, Luca Gemignani:
Bernstein-Bezoutian matrices. Theor. Comput. Sci. 315(2-3): 319-333 (2004) - Agustín Bompadre, Guillermo Matera, Rosita Wachenchauzer, Ariel Waissbein:
Polynomial equation solving by lifting procedures for ramified fibers. Theor. Comput. Sci. 315(2-3): 335-369 (2004) - Dima Burago, Dima Grigoriev, Anatol Slissenko:
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theor. Comput. Sci. 315(2-3): 371-404 (2004) - Cristiano Calcagno:
Two-level languages for program optimization. Theor. Comput. Sci. 315(1): 61-81 (2004) - Ernie Croot, Ren-Cang Li, Hui June Zhu:
The abc conjecture and correctly rounded reciprocal square roots. Theor. Comput. Sci. 315(2-3): 405-417 (2004) - Ioannis Z. Emiris, Bernard Mourrain, Victor Y. Pan:
Preface: Algebraic and Numerical Algorithms. Theor. Comput. Sci. 315(2-3): 307-308 (2004) - Zoltán Füredi, Robert P. Kurshan:
Minimal length test vectors for multiple-fault detection. Theor. Comput. Sci. 315(1): 191-208 (2004) - Joachim von zur Gathen, Michael Nöcker:
Fast arithmetic with general Gauß periods. Theor. Comput. Sci. 315(2-3): 419-452 (2004) - Georg Heinig, Karla Rost:
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile. Theor. Comput. Sci. 315(2-3): 453-468 (2004) - Igor E. Kaporin:
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication. Theor. Comput. Sci. 315(2-3): 469-510 (2004) - Michal Konecný:
Real functions incrementally computable by finite automata. Theor. Comput. Sci. 315(1): 109-133 (2004) - Fu-Rong Lin, Wai-Ki Ching, Michael K. Ng:
Fast inversion of triangular Toeplitz matrices. Theor. Comput. Sci. 315(2-3): 511-523 (2004) - Gavin Lowe:
Semantic models for information flow. Theor. Comput. Sci. 315(1): 209-256 (2004) - Gregorio Malajovich, J. Maurice Rojas:
High probability analysis of the condition number of sparse polynomial systems. Theor. Comput. Sci. 315(2-3): 525-555 (2004) - Michael W. Mislove:
Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16. Theor. Comput. Sci. 315(1): 1-2 (2004) - Dimitrios Noutsos, Stefano Serra Capizzano, Paraskevas Vassalos:
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate. Theor. Comput. Sci. 315(2-3): 557-579 (2004) - Victor Y. Pan, Marc Van Barel, Xinmao Wang, Gianni Codevico:
Iterative inversion of structured matrices. Theor. Comput. Sci. 315(2-3): 581-592 (2004) - Luis Miguel Pardo, Jorge San Martín:
Deformation techniques to solve generalised Pham systems. Theor. Comput. Sci. 315(2-3): 593-625 (2004) - Sonia Pérez-Díaz, Juana Sendra, J. Rafael Sendra:
Parametrization of approximate algebraic curves by lines. Theor. Comput. Sci. 315(2-3): 627-650 (2004) - David J. Pym, Peter W. O'Hearn, Hongseok Yang:
Possible worlds and resources: the semantics of BI. Theor. Comput. Sci. 315(1): 257-305 (2004) - Andrea Schalk, Valeria de Paiva:
Poset-valued sets or how to build models for linear logics. Theor. Comput. Sci. 315(1): 83-107 (2004) - Michel P. Schellekens:
The correspondence between partial metrics and semivaluations. Theor. Comput. Sci. 315(1): 135-149 (2004) - Andrew J. Sommese, Jan Verschelde, Charles W. Wampler:
Numerical factorization of multivariate complex polynomials. Theor. Comput. Sci. 315(2-3): 651-669 (2004) - Zhe Yang:
Encoding types in ML-like languages. Theor. Comput. Sci. 315(1): 151-190 (2004)
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-04-24 06:35 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