Остановите войну!
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 30 matches
- 1979
- Götz Alefeld:
Zur Konvergenz des Iterationsverfahrens bei linearen Gleichungssystemen. Computing 21(3): 267-272 (1979) - Helmut Alt:
Square rooting is as difficult as multiplication. Computing 21(3): 221-232 (1979) - Gerald Bitzer:
Über eine Minimaleigenschaft der äquidistanten trigonometrischen Interpolation in 2n+1 Knoten. Computing 21(2): 177-182 (1979) - Jürgen Bräuninger:
A quasi-Newton method for minimization under linear constraints without evaluating any derivatives. Computing 21(2): 127-141 (1979) - Hermann Brunner:
Superconvergence of collocation methods for Volterra integral equations of the first kind. Computing 21(2): 151-157 (1979) - Edmund M. Clarke:
Program invariants as fixedpoints. Computing 21(4): 273-294 (1979) - David J. Evans, Apostolos Hadjidimos:
On the factorization of special symmetric periodic and non-periodic quindiagonal matrices. Computing 21(3): 259-266 (1979) - Klaus D. Heidtmann:
Verbesserte Einzelschrittverfahren. Computing 21(2): 143-150 (1979) - E. Huntley, Alan Solon Ivor Zinober:
Applications of numerical double laplace transform algorithms to the solution of linear partial differential equations. Computing 21(3): 245-258 (1979) - Helmut Jürgensen:
Transformationendarstellungen endlicher abstrakt präsentierter Halbgruppen. Computing 21(4): 333-342 (1979) - F. Lether, D. Wilhelmsen, R. Frazier:
On the positivity of cotes numbers for interpolatory quadratures with Jacobi abscissas. Computing 21(2): 171-175 (1979) - Wolfgang Lindenberg, Leonhard Gerhards:
Clique detection for nondirected graphs: Two new algorithms. Computing 21(4): 295-322 (1979) - Iván Lux:
Another special method to sample probability density functions. Computing 21(4): 359-364 (1979) - Silvano Martello:
An algorithm for finding a minimal equivalent graph of a strongly connected digraph. Computing 21(3): 183-194 (1979) - J. T. Marti:
On the convergence of the discrete ART algorithm for the reconstruction of digital pictures from their projections. Computing 21(2): 105-111 (1979) - Sean McKee:
Best convergence rates of linear multistep methods for Volterra first kind equations. Computing 21(4): 343-358 (1979) - Gheorghe Paun:
On the generative capacity of tree controlled grammars. Computing 21(3): 213-220 (1979) - Theodore J. Rivlin:
Approximation by circles. Computing 21(2): 93-104 (1979) - Jon G. Rokne:
A note on the Bernstein algorithm for bounds for interval polynomials. Computing 21(2): 159-170 (1979) - Herbert Sonntag:
Ein Verfahren zur Alternativroutensuche in Verkehrsnetzen. Computing 21(4): 323-331 (1979) - Silke Stiller:
Konvergenzverhalten bei der numerischen Lösung von Randwertproblemen mittels eines Doppelschichtpotential-Ansatzes. Computing 21(3): 233-243 (1979) - Reginald P. Tewarson:
A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations. Computing 21(2): 113-125 (1979) - Vijay K. Vaishnavi, Hans-Peter Kriegel, Derick Wood:
Height balanced 2-3 trees. Computing 21(3): 195-211 (1979) - 1978
- Rudolf Bayer, Theo Härder:
Preplanning of disk merges. Computing 21(1): 1-16 (1978) - Rudolf Bayer, Theo Härder:
A performance model for preplanned disk sorting. Computing 21(1): 17-35 (1978) - Ludwig J. Cromme:
Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm. Computing 21(1): 37-52 (1978) - Sven-Åke Gustafson:
Convergence acceleration on a general class of power series. Computing 21(1): 53-69 (1978) - Sven-Åke Gustafson:
Algorithm 38 two computer codes for convergence acceleration. Computing 21(1): 87-91 (1978) - Silvano Martello, Paolo Toth:
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem. Computing 21(1): 81-86 (1978) - Augustin Paulik:
On the determination of the weights in multi-dimensional numerical quadrature. Computing 21(1): 71-79 (1978)
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-24 15:31 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