Остановите войну!
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 34 matches
- 1988
- Nikolaos Apostolatos, Vasilios Vlassopoulos:
Abschätzung von Produkten gitterpositiver Matrizen und optimale Vorhersage stochastischer Quellen. Computing 40(4): 301-313 (1988) - Peter Brucker:
An efficient algorithm for the job-shop problem with two jobs. Computing 40(4): 353-359 (1988) - Hermann Brunner:
The approximate solution of initial-value problems for general Volterra integro-differential equations. Computing 40(2): 125-137 (1988) - Richard J. Charron:
Adapting rational approximants for Fourier series to data representation problems. Computing 40(3): 217-228 (1988) - Claudia Chiodo, Giuliana Criscuolo:
On the convergence of a rule by Monegato for the numerical evaluation of Cauchy principal value integrals. Computing 40(1): 67-74 (1988) - Ronald Cools, Ann Haegemans:
Another step forward in searching for cubature formulae with a minimal number of knots for the square. Computing 40(2): 139-146 (1988) - Maria Rosaria Crisci, Elvira Russo, Antonia Vecchio:
On the stability of the one-step exact collocation method for the second kind volterra integral equation with degenerate kernel. Computing 40(4): 315-328 (1988) - Andreas Drexl:
A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40(1): 1-8 (1988) - Andreas Frommer, Werner Straub:
Error-bounds for zeroes of polynomials using complex circular arithmetic. Computing 40(3): 273-280 (1988) - Karin Gatermann:
The construction of symmetric cubature formulas for the square and the triangle. Computing 40(3): 229-240 (1988) - Joachim Gwinner:
Acceptable solutions of linear complementarity problems. Computing 40(4): 361-366 (1988) - Per Christian Hansen:
Computation of the singular value expansion. Computing 40(3): 185-199 (1988) - Jürgen Herzberger:
On the monotonicity of higher-order interval iterations for bounding the inverse matrix. Computing 40(4): 367-372 (1988) - Annegret Hoy:
A relation between Newton and Gauss-Newton steps for singular nonlinear equations. Computing 40(1): 19-27 (1988) - Kazup Ishihara:
Successive overrelaxation method with projection for finite element solutions applied to the Dirichlet problem of the nonlinear elliptic equation Δu-bu2. Computing 40(1): 51-65 (1988) - Song Jiang:
On a finite element method for the equations of one-dimensional nonlinear thermoviscoelasticity. Computing 40(2): 111-124 (1988) - Jyrki Katajainen:
The region approach for computing relative neighbourhood graphs in the Lp metric. Computing 40(2): 147-161 (1988) - Devinder Kaur, Yehuda Wallach:
Parallel methods for tridiagonal equations. Computing 40(3): 267-272 (1988) - J. Thomas King, A. Neubauer:
A variant of finite-dimensional Tikhonov regularization with a-posteriori parameter choice. Computing 40(2): 91-109 (1988) - Rupert Lasser, J. Tritschler:
How to compute the n-fold convolution power of elementary functions without numerical integration. Computing 40(4): 347-351 (1988) - Zi-Cai Li, Tien Dai Bui:
A new kind of combinations between the Ritz-Galerkin and finite element methods for singularity problems. Computing 40(1): 29-50 (1988) - Henk Meijer, Selim G. Akl:
Bit serial addition trees and their applications. Computing 40(1): 9-17 (1988) - Peter William Meyer:
A fixed point multiple shooting method. Computing 40(1): 75-83 (1988) - Th. Mohr, C. Pasche:
A parallel shortest path algorithm. Computing 40(4): 281-292 (1988) - Günter W. Mühlbach:
On multivariate interpolation by generalized polynomials on subsets of grids. Computing 40(3): 201-215 (1988) - A. Peyerimhoff, E. Stickel, Eduard Wirsing:
On the rate of convergence for two-term recursions. Computing 40(4): 329-335 (1988) - Zuhe Shen, Arnold Neumaier:
A note on Moore's interval test for zeros of nonlinear systems. Computing 40(1): 85-89 (1988) - Helmuth Späth, Jörg Meier:
Flexible smoothing with periodic cubic splines and fitting with closed curves. Computing 40(4): 293-300 (1988) - Emilio Spedicato, W. Burmeister:
A strict bound to the condition number of bordered positive definite matrices. Computing 40(2): 181-183 (1988) - Karl Strehmel, Rüdiger Weiner, I. Dannehl:
A study ofB-convergence of linearly implicit Runge-Kutta methods. Computing 40(3): 241-253 (1988)
skipping 4 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-05-04 04:51 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