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
- 1983
- Rainer Ansorge, Klaus Taubert:
Remarks on composite integration methods for ordinary differential equations. Computing 31(1): 69-82 (1983) - Peter Bathelt, F. Hofmann:
A comparison of two Petri net types. Computing 31(2): 141-148 (1983) - Gunter Bolch:
Approximation von Leistungsgrößen symmetrischer Mehrprozessorsysteme. Computing 31(4): 305-315 (1983) - Felix Breitenecker:
On the choice of an appropriate imbedding algorithm for the solution of unstable linear boundary value problems. Computing 31(2): 173-176 (1983) - Giorgio Carpaneto, Paolo Toth:
Algorithm for the solution of the assignment problem for sparse matrices. Computing 31(1): 83-94 (1983) - W. B. van Dam, J. B. G. Frenk, Alexander H. G. Rinnooy Kan:
The asymptotic behaviour of a distributive sorting method. Computing 31(4): 287-303 (1983) - Ernst-Erich Doberkat:
Continuous models that are equivalent to randomness for the analysis of many sorting algorithms. Computing 31(1): 11-31 (1983) - Hossam A. ElGindy, David Avis, Godfried T. Toussaint:
Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing 31(3): 191-202 (1983) - Gregor Engels, Rupert Gall, Manfred Nagl, Wilhelm Schäfer:
Software specification using graph grammars. Computing 31(4): 317-346 (1983) - Jürgen Wolff von Gudenberg:
Computing zy with maximum accuracy. Computing 31(2): 185-189 (1983) - W. M. Häußler:
A local convergence analysis for the Gauss-Newton and Levenberg-Morrison-Marquardt Algorithms. Computing 31(3): 231-244 (1983) - L. Hering:
Darstellung von Bézier-Kurven als B-Spline-Kurven. Computing 31(2): 149-153 (1983) - M. B. Korchemkin:
A heuristic partitioning algorithm for a packaging problem. Computing 31(3): 203-209 (1983) - Rudolf Krawczyk:
Interval operators of a function of which the Lipschitz matrix is an interval M-matrix. Computing 31(3): 245-253 (1983) - Rudolf Krawczyk:
A remark about the convergence of interval sequences. Computing 31(3): 255-259 (1983) - M. Lautsch:
An implicit off-step point method for the integration of stiff differential equations. Computing 31(2): 177-183 (1983) - C. Maas:
Determining the interval number of a triangle-free graph. Computing 31(4): 347-354 (1983) - Qin Mengzhao:
Difference schemes for the dispersive equation. Computing 31(3): 261-267 (1983) - Burkhard Monien:
The complexity of determining a shortest cycle of even length. Computing 31(4): 355-369 (1983) - G. Münzel, G. Renner:
Zur Charakterisierung und Berechnung von symmetrischen Kubaturformeln. Computing 31(3): 211-230 (1983) - E. L. Ortiz, H. Samara:
Numerical solution of differential eigenvalue problems with an operational approach to the Tau method. Computing 31(2): 95-103 (1983) - Ekow J. Otoo, T. H. Merrett:
A storage scheme for extendible arrays. Computing 31(1): 1-9 (1983) - D. G. Papworth:
Exact tests of fit for a poisson distribution. Computing 31(1): 33-45 (1983) - W. Prochazka:
Conformal mapping of the unit circle or of the upper half plane onto a polygon. Computing 31(2): 155-172 (1983) - Arnold L. Rosenberg, Ivan Hal Sudborough:
Bandwidth and pebbling. Computing 31(2): 115-139 (1983) - Karl Strehmel, Rüdiger Weiner:
Nonlinear contractivity of a class of semi-implicit multistep methods. Computing 31(4): 371-381 (1983) - George I. Tsamasphyros, Pericles S. Theocaris:
On the convergence of some quadrature rules for Cauchy principal-value and finite-part integrals. Computing 31(2): 105-114 (1983) - H. Werner:
Algorithm 51. A reliable and numerically stable program for rational interpolation of lagrange data. Computing 31(3): 269-286 (1983) - Zahari Zlatev:
Consistency and convergence of general linear multistep variable stepsize variable formula methods. Computing 31(1): 47-67 (1983)
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-11-29 10:38 CET 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