![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
- 1982
- N. S. Asaithambi, Shen Zuhe, Ramon E. Moore:
On computing the range of values. Computing 28(3): 225-237 (1982) - Wolf-Jürgen Beyn, Jens Lorenz:
Spurious solutions for discrete superlinear boundary value problems. Computing 28(1): 43-51 (1982) - Hanspeter Bieri, Walter Nef:
A recursive sweep-plane algorithm, determining all cells of a finite division of Rd. Computing 28(3): 189-198 (1982) - Heribert Blum, Manfred Dobrowolski:
On finite element methods for elliptic equations on domains with corners. Computing 28(1): 53-63 (1982) - John M. Bownds:
Theory and performance of a subroutine for solving Volterra Integral Equations. Computing 28(4): 317-332 (1982) - Felix Breitenecker:
On the solution of linear boundary value problems by extended invariant imbedding. Computing 28(4): 333-343 (1982) - Luc Devroye:
A note on the average depth of tries. Computing 28(4): 367-371 (1982) - J. D. P. Donnelly:
Discrete invariant imbedding and front-tracking. Computing 28(2): 181-188 (1982) - Charles B. Dunham:
Remez algorithm for Chebyshev approximation with interpolation. Computing 28(1): 75-78 (1982) - Didier Fayard, Gérard Plateau:
An algorithm for the solution of the 0-1 knapsack problem. Computing 28(3): 269-287 (1982) - Michael Gipser:
On global convergence of coordinate relaxation in the case of an unsymmetrical, diagonally dominant Jacobian. Computing 28(4): 345-361 (1982) - Roland Hornung:
Discrete minimax problem: Algorithms and numerical comparisons. Computing 28(2): 139-154 (1982) - Edgar Kaucher, Siegfried M. Rump:
E-methods for fixed point equations f(x)=x. Computing 28(1): 31-42 (1982) - G. Keller:
Numerical solution of initial-value problems by collocation methods using generalized piecewise functions. Computing 28(3): 199-211 (1982) - John B. Kioustelidis:
Monotonicity of the error of optimal segmented approximations. Computing 28(1): 69-74 (1982) - R. Krawczyk, Karl Nickel:
Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie. Computing 28(2): 117-137 (1982) - John E. Lavery:
Solution of quasilinear hyperbolic initial-boundary-value problems by the method of pseudolinear equations. Computing 28(3): 213-223 (1982) - Alexander Leitsch:
Fiducial intervals for the waiting time in batch and time-sharing systems. Computing 28(4): 289-303 (1982) - H. Leuprecht, Wilhelm Oberaigner:
Parallel algorithms for the rounding exact summation of floating point numbers. Computing 28(2): 89-104 (1982) - Ladislav Luksan:
New combined method for unconstrained minimization. Computing 28(2): 155-169 (1982) - Wolfgang Mönch:
Iterative refinement of approximations to a generalized inverse of a matrix. Computing 28(1): 79-87 (1982) - Karl Hans Müller:
A recurrence for Dirichlet problems. Computing 28(1): 65-68 (1982) - Helmut Prodinger:
A note on a result of R. Kemp on R-typly rooted planted plane trees. Computing 28(4): 363-366 (1982) - A. D. Raptis:
Two-step methods for the numerical solution of the Schrödinger equation. Computing 28(4): 373-378 (1982) - Helmut Ratschek, W. Sauer:
Linear interval equations. Computing 28(2): 105-115 (1982) - Walter J. Reuß:
Eine repräsentative Auswahl von Knotenmatrizen zu Klassen isomorpher Graphen. Computing 28(3): 247-255 (1982) - Jon G. Rokne:
Optimal computation of the Bernstein algorithm for the bound of an interval polynomial. Computing 28(3): 239-246 (1982) - Jon G. Rokne, T. Wu:
The circular complex centered form. Computing 28(1): 17-30 (1982) - Antonio Ramón Vaquero Sánchez, José M. Troya:
Optimization and approximation algorithm for placement of records on linear storage devices. Computing 28(4): 305-316 (1982) - Leszek Slominski:
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations. Computing 28(3): 257-267 (1982)
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-02 13:25 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