Остановите войну!
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 29 matches
- 2000
- Pierre Alliez, Olivier Devillers, Jack Snoeyink:
Removing Degeneracies by Perturbing the Problem or Perturbing the World. Reliab. Comput. 6(1): 61-79 (2000) - Bernhard Beckermann, George Labahn:
Effective Computation of Rational Approximants and Interpolants. Reliab. Comput. 6(4): 365-390 (2000) - Ole Caprani, Lars Hvidegaard, Mikkel Mortensen, Thomas Schneider:
Robust and Efficient Ray Intersection of Implicit Surfaces. Reliab. Comput. 6(1): 9-21 (2000) - Leocadio G. Casado, Inmaculada García, Yaroslav D. Sergeyev:
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions. Reliab. Comput. 6(2): 179-191 (2000) - Graçaliz Pereira Dimuro, Antônio Carlos da Rocha Costa, Dalcidio Moraes Claudio:
A Coherence Space of Rational Intervals for a Construction of IR. Reliab. Comput. 6(2): 139-178 (2000) - William W. Edmonson, Wen H. Lee, John M. M. Anderson:
Interval Methods for Sinusoidal Parameter Estimation: A Comparative Analysis. Reliab. Comput. 6(3): 321-336 (2000) - Jeffrey S. Ely, Anthony P. Leclerc:
Correct Delaunay Triangulation in the Presence of Inexact Inputs and Arithmetic. Reliab. Comput. 6(1): 23-38 (2000) - Jean-Daniel Fournier, Maciej Pindor:
Rational Interpolation from Stochastic Data: A New Froissart's Phenomenon. Reliab. Comput. 6(4): 391-409 (2000) - Jürgen Garloff:
Application of Bernstein Expansion to the Solution of Control Problems. Reliab. Comput. 6(3): 303-320 (2000) - Marina L. Gavrilova, Helmut Ratschek, Jon G. Rokne:
Exact Computation of Delaunay and Power Triangulations. Reliab. Comput. 6(1): 39-60 (2000) - Peter R. Graves-Morris:
Reliability of Lanczos-Type Product Methods from Perturbation Theory. Reliab. Comput. 6(4): 411-428 (2000) - Eldon R. Hansen:
The Hull of Preconditioned Interval Linear Equations. Reliab. Comput. 6(2): 95-103 (2000) - Eldon R. Hansen:
Reminiscence. Reliab. Comput. 6(2): 225-226 (2000) - Timothy J. Hickey, Zhe Qju, Maarten H. van Emden:
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations. Reliab. Comput. 6(1): 81-92 (2000) - Werner Hofschuster, Walter Krämer:
Mathematical Function Software on the Web--Are Such Codes Useful for Verification Algorithms? Reliab. Comput. 6(2): 207-218 (2000) - Ralf Hungerbühler, Jürgen Garloff:
Computation of the Bernstein Coefficients on Subdivided Triangles. Reliab. Comput. 6(2): 115-121 (2000) - Hiroshi Kai, Matu-Tarow Noda:
Hybrid Rational Function Approximation and Its Accuracy Analysis. Reliab. Comput. 6(4): 429-438 (2000) - Nicos Karcanias, Marilena Mitrouli:
Numerical Computation of the Least Common Multiple of a Set of Polynomials. Reliab. Comput. 6(4): 439-457 (2000) - Michel Kieffer, Luc Jaulin, Eric Walter, Dominique Meizel:
Robust Autonomous Robot Localization Using Interval Analysis. Reliab. Comput. 6(3): 337-362 (2000) - Misha Koshelev:
Every Superinterval of the Function Range Can Be an Interval-Computations Enclosure. Reliab. Comput. 6(2): 219-223 (2000) - Yuzo Ohta:
Nonconvex Polygon Interval Arithmetic as a Tool for the Analysis and Design of Robust Control Systems. Reliab. Comput. 6(3): 247-279 (2000) - Helmut Ratschek, Jon G. Rokne:
Introduction to the Special Issue: What Can One Learn from Box-Plane Intersections? Reliab. Comput. 6(1): 1-8 (2000) - Nathalie Revol, Jean-Claude Yakoubsohn:
Accelerated Shift-and-Add Algorithms. Reliab. Comput. 6(2): 193-205 (2000) - Tetsuya Sakurai, Hiroshi Sugiura:
On Factorization of Analytic Functions and Its Verification. Reliab. Comput. 6(4): 459-470 (2000) - Dusan M. Stipanovic, Dragoslav D. Siljak:
Jacobi and Gauss-Seidel Iterations for Polytopic Systems: Convergence via Convex M-Matrices. Reliab. Comput. 6(2): 123-137 (2000) - Josep Vehí, José Rodellar, Miguel Ángel Sainz, Joaquim Armengol:
Analysis of the Robustness of Predictive Controllers via Modal Intervals. Reliab. Comput. 6(3): 281-301 (2000) - Long Wang:
Composite Interval Control Systems: Some Strong Kharitonov-Like Properties. Reliab. Comput. 6(3): 231-246 (2000) - Interval Integration. Reliab. Comput. 6(1): 93-94 (2000)
- Kiyotaka Yamamura:
Finding All Solutions of Nonlinear Equations Using Linear Combinations of Functions. Reliab. Comput. 6(2): 105-113 (2000)
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-05-05 12:18 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