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
- 2002
- Daniel Berleant:
Reliable Computing: Special Issue on Dependable Reasoning about Uncertainty. Reliab. Comput. 8(2): 175-176 (2002) - Chong-Kan Chiu, Jimmy Ho-Man Lee:
Efficient Interval Linear Equality Solving in Constraint Logic Programming. Reliab. Comput. 8(2): 139-174 (2002) - Hans-Jürgen Dobner:
Kernel-Splitting Technique for Enclosing the Solution of Fredholm Equations of the First Kind. Reliab. Comput. 8(6): 469-479 (2002) - Rida T. Farouki, Helmut Pottmann:
Exact Minkowski Products of N Complex Disks. Reliab. Comput. 8(1): 43-66 (2002) - Jürgen Wolff von Gudenberg:
Interval Arithmetic on Multimedia Architectures. Reliab. Comput. 8(4): 307-312 (2002) - Eldon R. Hansen, G. William Walster:
Sharp Bounds on Interval Polynomial Roots. Reliab. Comput. 8(2): 115-122 (2002) - Gerhard Heindl, Vladik Kreinovich, Maria Rifqi:
In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative. Reliab. Comput. 8(3): 213-227 (2002) - Jens Hoefkens, Martin Berz:
Verification of Invertibility of Complicated Functions over Large Domains. Reliab. Comput. 8(1): 67-82 (2002) - Charles R. Johnson, Ronald L. Smith:
Intervals of Inverse M-Matrices. Reliab. Comput. 8(3): 239-243 (2002) - R. Baker Kearfott:
On Existence and Uniqueness Verification for Non-Smooth Functions. Reliab. Comput. 8(4): 267-282 (2002) - R. Baker Kearfott, G. William Walster:
SIAM Conference on Optimization, Validated Computing 2002, and the Fields Institute Informal Working Group on Validated Optimization. Reliab. Comput. 8(5): 419-424 (2002) - R. Baker Kearfott, G. William Walster:
Symbolic Preconditioning with Taylor Models: Some Examples. Reliab. Comput. 8(6): 453-468 (2002) - Lubomir V. Kolev:
Outer Solution of Linear Systems Whose Elements Are Affine Functions of Interval Parameters. Reliab. Comput. 8(6): 493-501 (2002) - Igor Kozine, Lev V. Utkin:
Interval-Valued Finite Markov Chains. Reliab. Comput. 8(2): 97-113 (2002) - Vladik Kreinovich:
Range Estimation Is NP-Hard for ?2 Accuracy and Feasible for epsilon2-[delta]. Reliab. Comput. 8(6): 481-491 (2002) - Weldon A. Lodwick:
Reliable Computing: Special Issue on the Linkages between Interval Mathematics and Fuzzy Set Theory. Reliab. Comput. 8(1): 93-95 (2002) - Weldon A. Lodwick, Vladik Kreinovich:
Interval-Related Talks at the Annual Conference of the North American Fuzzy Information Processing Society NAFIPS'02. Reliab. Comput. 8(5): 425-426 (2002) - Eugene Loh, G. William Walster:
Rump's Example Revisited. Reliab. Comput. 8(3): 245-248 (2002) - Jan Mayer:
An Approach to Overcome Division by Zero in the Interval Gauss Algorithm. Reliab. Comput. 8(3): 229-237 (2002) - Ramon E. Moore:
Sparse Systems in Fixed Point Form. Reliab. Comput. 8(4): 249-265 (2002) - Paluri S. V. Nataraj, Airani Kalathil Prakash:
A Parallelized Version of the Covering Algorithm for Solving Parameter-Dependent Systems of Nonlinear Equations. Reliab. Comput. 8(2): 123-130 (2002) - Paluri S. V. Nataraj, Suresh Mandir Sheela:
A New Subdivision Strategy for Range Computations. Reliab. Comput. 8(1): 83-92 (2002) - Paluri S. V. Nataraj, Suresh Mandir Sheela:
A QFT Procedure for Generating Design Frequencies and Bounds of Guaranteed Accuracy. Reliab. Comput. 8(6): 427-451 (2002) - Arnold Neumaier:
Grand Challenges and Scientific Standards in Interval Analysis. Reliab. Comput. 8(4): 313-320 (2002) - William Oberkampf, Jon C. Helton, Steven F. Wojtkiewicz, Cliff A. Joslyn, Scott Ferson:
Epistemic Uncertainty Workshop. Reliab. Comput. 8(6): 503-505 (2002) - João Batista S. de Oliveira, Luiz Henrique de Figueiredo:
Interval Computation of Viswanath's Constant. Reliab. Comput. 8(2): 131-138 (2002) - Stefan Ratschan:
Approximate Quantified Constraint Solving by Cylindrical Box Decomposition. Reliab. Comput. 8(1): 21-42 (2002) - Miguel Ángel Sainz, Ernest Gardeñes, Lambert Jorba:
Formal Solution to Systems of Interval Linear or Non-Linear Equations. Reliab. Comput. 8(3): 189-211 (2002) - Miguel Ángel Sainz, Ernest Gardeñes, Lambert Jorba:
Interval Estimations of Solution Sets to Real-Valued Systems of Linear or Non-Linear Equations. Reliab. Comput. 8(4): 283-305 (2002) - Uwe Schäfer:
Two Ways to Extend the Cholesky Decomposition to Block Matrices with Interval Entries. Reliab. Comput. 8(1): 1-20 (2002)
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 2024-11-23 19:23 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