Остановите войну!
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 35 matches
- 1970
- Joachim H. Ahrens, Ulrich Dieter, Andreas Grube:
Pseudo-random numbers - A new proposal for the choice of multiplicators. Computing 6(1-2): 121-138 (1970) - Götz Alefeld:
Über die aus monoton zerlegbaren Operatoren gebildeten Iterationsverfahren. Computing 6(1-2): 161-172 (1970) - Götz Alefeld, Jürgen Herzberger:
ALGOL-60 Algorithmen zur Auflösung linearer Gleichungssysteme mit Fehlererfassung. Computing 6(1-2): 28-34 (1970) - Ivo Babuska:
Finite element method for domains with corners. Computing 6(3-4): 264-273 (1970) - Karel Culík:
Asynchroneous automata. Computing 6(1-2): 191-199 (1970) - Hansjörg Dirschmid:
Ein Einschließungssatz für den absolut größten Eigenwert normaler Operatoren in separablen Hilbert-Räumen. Computing 6(1-2): 72-75 (1970) - Hansjörg Dirschmid:
Zur Einschließung der Komponenten des ersten Eigenvektors normaler Operatoren in unitären Räumen. Computing 6(1-2): 76-79 (1970) - Rainer Dussel, Bernhard A. Schmitt:
Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall. Computing 6(1-2): 35-60 (1970) - Calvin C. Elgot:
The common algebraic structure of exit-automata and machines. Computing 6(3-4): 349-370 (1970) - Erwin Fehlberg:
Klassische Runge-Kutta-Formeln vierter und niedrigerer Ordnung mit Schrittweiten-Kontrolle und ihre Anwendung auf Wärmeleitungsprobleme. Computing 6(1-2): 61-71 (1970) - Walther L. Fischer:
Topological invariants of matrices. Computing 6(1-2): 97-103 (1970) - Jan Golinski:
Investigation of a certain stray process applied to the optimum synthesis problems. Computing 6(1-2): 139-160 (1970) - A. K. Govil, Santosh Kumar:
Stochastic behaviour of a complex system under priority repair. Computing 6(1-2): 200-213 (1970) - Fred G. Gustavson, Werner Liniger:
A fast random number generator with good statistical properties. Computing 6(3-4): 221-226 (1970) - G. J. Habetler, Robert L. Schiffman:
A finite difference method for analyzing the compression of poro-viscoelastic media. Computing 6(3-4): 342-348 (1970) - Dirk Henze:
Über Eindeutigkeitsfragen bei nichtlinearer L1- und Tschebyscheff-Approximation. Computing 6(3-4): 330-338 (1970) - Rainer Kreß:
Interpolation auf einem unendlichen Intervall. Computing 6(3-4): 274-288 (1970) - Dietrich Marsal:
Elementare Eingabelung der Lösungsfunktion und der Eigenwerte inhomogener gewöhnlicher und singulärer Integralgleichungen zweiter Art mit festen Integrationsgrenzen. Computing 6(1-2): 80-93 (1970) - Otto Mayer:
Über eine Klasse komplexer Intervallgleichungssysteme mit iterationsfähiger Gestalt. Computing 6(1-2): 104-106 (1970) - Klaus Neumann:
Ein Verfahren zur Lösung gewisser nichtlinearer Kontrollprobleme. Computing 6(3-4): 249-263 (1970) - Karl Nickel:
Fehlerschranken zu Näherungswerten von Polynomwurzeln. Computing 6(1-2): 9-27 (1970) - Erich Nuding, Ingrid Kahlert-Warmbold:
A computer-oriented representation of matrices. Computing 6(1-2): 1-8 (1970) - G. Neves de Oliveria:
Inverse Eigenvalue Problems for Complex Matrices. Computing 6(3-4): 339-341 (1970) - Helmut Ratschek:
Die binären Systeme der Intervallarithmetik. Computing 6(3-4): 295-308 (1970) - Robert Schaback, Dietrich Braess:
Eine Lösungsmethode für die lineare Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung. Computing 6(3-4): 289-294 (1970) - Erich Schmid, Wilhelm Barth, Karl-Heinz Wolff, F. Oehme, H. Florian:
Buchbesprechungen. Computing 6(3-4): 373-376 (1970) - Erich Schmid, I. Iroch, H. Bertele, Lothar Collatz, L. Havelec, H. Kremser, Wilhelm Barth:
Buchbesprechungen. Computing 6(1-2): 214-220 (1970) - Gunther Schmidt:
Ein kontinuierliches Modell für Kraftfahrzeugströmungen. Computing 6(1-2): 107-120 (1970) - Jochen W. Schmidt, H. Leonhardt:
Eingrenzung von Lösungen mit Hilfe der Regula falsi. Computing 6(3-4): 318-329 (1970) - Klaus Schmidt, Peter Zinterhof:
Über Quadraturformeln auf Tω. Computing 6(1-2): 94-96 (1970)
skipping 5 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-07 18:53 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