![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.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 31 matches
- 1980
- Hussein M. Abdel-Wahab, Tiko Kameda:
On strictly optimal schedules for the cumulative cost-optimal scheduling problem. Computing 24(1): 61-86 (1980) - Alkiviadis G. Akritas:
The fastest exact algorithms for the isolation of the real roots of a polynomial equation. Computing 24(4): 299-313 (1980) - Alkiviadis G. Akritas, Stylianos D. Danielopoulos:
On the complexity of algorithms for the translation of polynomials. Computing 24(1): 51-60 (1980) - H. Bauch:
On the iterative inclusion of solutions in characteristic initial-value problems with hyperbolic differential equation zst=f(s, t, z). Computing 24(1): 21-32 (1980) - Lothar Berg:
On the simultaneous calculation of two zeros. Computing 24(1): 87-91 (1980) - Gerd Bohlender:
Embedding universal computer arithmetic in higher programming languages. Computing 24(2-3): 149-160 (1980) - Dalcidio Moraes Claudio:
Contributions to the structure of computer arithmetic. Computing 24(2-3): 115-118 (1980) - Paul Dierckx:
Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints. Computing 24(4): 349-371 (1980) - Neli S. Dimitrova:
Über die Distributivgesetze der erweiterten Intervallarithmetik. Computing 24(1): 33-49 (1980) - Ernest Gardeñes, Albert Trepat:
Fundamentals of SIGLA, an interval computing system over the completed set of intervals. Computing 24(2-3): 161-179 (1980) - Eckart W. Gekeler:
Stability of Galerkin multistep procedures in time-homogeneous hyperbolic problems. Computing 24(4): 315-324 (1980) - Kurt Grüner:
Implementation of universal computer arithmetic with optimal accuracy. Computing 24(2-3): 181-193 (1980) - Jürgen Wolff von Gudenberg:
Determination of minimum sets of the set of zeros of a function. Computing 24(2-3): 203-212 (1980) - Apostolos Hadjidimos:
Some basic results on M-matrices in connection with the Accelerated Overrelaxation (AOR) method. Computing 24(2-3): 259-268 (1980) - Frank R. de Hoog, Richard Weiss:
An approximation theory for boundary value problems on infinite intervals. Computing 24(2-3): 227-239 (1980) - P. J. van der Houwen, P. H. M. Wolkenfelt:
On the stability of multistep formulas for Volterra integral equations of the second kind. Computing 24(4): 341-347 (1980) - Edgar Kaucher, Siegfried M. Rump:
Generalized iteration methods for bounds of the solution of fixed point operator-equations. Computing 24(2-3): 131-137 (1980) - John B. Kioustelidis:
Optimal segmented approximations. Computing 24(1): 1-8 (1980) - Rudi Klatte, Christian P. Ullrich:
On conversions between screens. Computing 24(2-3): 107-114 (1980) - Rudi Klatte, Christian P. Ullrich:
Complex sector arithmetic. Computing 24(2-3): 139-148 (1980) - Rudolf Krawczyk:
Interval extensions and interval iterations. Computing 24(2-3): 119-129 (1980) - K.-P. Kugler, Uwe Pape:
Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen. Computing 24(2-3): 269-274 (1980) - John L. Larson, Ahmed H. Sameh:
Algorithms for roundoff error analysis - A relative error approach. Computing 24(4): 275-297 (1980) - Elias A. Lipitakis, David J. Evans:
Solving non-linear elliptic difference equations by extendable sparse factorization procedures. Computing 24(4): 325-339 (1980) - Klaus-Herrmann Meyn:
Convergent solution bounds for linear elliptic boundary value problems of monotone kind. Computing 24(1): 9-19 (1980) - Karl Nickel:
Arithmetic of complex sets. Computing 24(2-3): 97-105 (1980) - Dieter Oelschlägel, Herbert Süße:
Interval analytic treatment of convex programming problems. Computing 24(2-3): 213-225 (1980) - M. Raith:
Existence and uniqueness of inclusion isotonic centered ball extensions. Computing 24(2-3): 195-202 (1980) - A. Raptis:
Exponential-fitting methods for the numerical integration of the fourth-order differential equation yIV+f·y=g. Computing 24(2-3): 241-250 (1980) - Helmut Ratschek:
Representation of interval operations by coordinates. Computing 24(2-3): 93-96 (1980)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.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 2025-02-18 18:20 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