Остановите войну!
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 22 matches
- 1991
- David J. Evans:
The solution of poisson's equation in a triangular region. Int. J. Comput. Math. 39(1-2): 81-98 (1991) - David J. Evans:
A new 4th order runge-kutta method for initial value problems with error control. Int. J. Comput. Math. 39(3-4): 217-227 (1991) - David J. Evans, Changjun Li:
The recursive tri-reduction method for tridiagonal linear systems. Int. J. Comput. Math. 39(3-4): 239-247 (1991) - David J. Evans, Hermineh Y. Y. Sanossian:
Back propagation architecture for computing visual depth. Int. J. Comput. Math. 39(1-2): 1-9 (1991) - Karl-Heinz Hoffmann, Peter Salamon:
Simulated annealing for single minimum optimization problems. Int. J. Comput. Math. 39(3-4): 193-204 (1991) - Massimo Ancona, Elisabetta Bruzzone, Leila De Floriani:
Using structured steiner trees for hierarchical global routing. Int. J. Comput. Math. 39(3-4): 169-192 (1991) - M. M. Chawla, Kalpdrum Passi:
A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems. Int. J. Comput. Math. 39(1-2): 99-107 (1991) - Charles B. Dunham, C. Z. Zhu:
The remez algorithm for biased uniform approximation on an interval. Int. J. Comput. Math. 39(3-4): 213-216 (1991) - C. J. Harman:
Exact numerical schemes and the three means. Int. J. Comput. Math. 39(1-2): 141-150 (1991) - M. K. Jain, R. K. Jain, R. K. Mohanty:
The numerical solution of the two-dimensional unsteady navier-stokes equations using fourth-order difference method. Int. J. Comput. Math. 39(1-2): 125-134 (1991) - Xingzhi Ji, Yau Shu Wong:
Prüfer method for periodic and semi-periodic sturm-liouville eigenvalue problems. Int. J. Comput. Math. 39(1-2): 109-123 (1991) - Fatma A. M. Mahmoud, Madiha A. M. Saleem:
Chebyshev approximation for solving the radon integral equation. Int. J. Comput. Math. 39(1-2): 67-80 (1991) - Masoud T. Milani:
On the descriptive power of simple precedence grammars. Int. J. Comput. Math. 39(1-2): 29-49 (1991) - Stephan Olariu, Zhaofang Wen:
Merging heaps in parallel. Int. J. Comput. Math. 39(1-2): 61-65 (1991) - T. E. Simos:
A two-step method with phase-lag of order infinity for the numerical integration of second order periodic initial-value problem. Int. J. Comput. Math. 39(1-2): 135-140 (1991) - O. A. Taiwo, P. Onumanyi:
A collocation approximation of singularly perturbed second order ordinary differential equation. Int. J. Comput. Math. 39(3-4): 205-211 (1991) - Jimmy J. M. Tan:
Stable matchings and stable partitions. Int. J. Comput. Math. 39(1-2): 11-20 (1991) - Paavo Turakainen:
On Nonnegative matrices generating a finite multiplicative monoid. Int. J. Comput. Math. 39(3-4): 151-161 (1991) - Vesna Vrcelj, Nevenka Adzic, Zorica Uzelac:
A numerical-asymptotic solution for singular perturbation problems. Int. J. Comput. Math. 39(3-4): 229-238 (1991) - Colin D. Walter:
Fast modular multiplication using 2-power radix. Int. J. Comput. Math. 39(1-2): 21-28 (1991) - Chengfu Yao, Jon G. Rokne:
A straightforward algorithm for computing the medial axis of a simple polygon. Int. J. Comput. Math. 39(1-2): 51-60 (1991) - A. J. van Zanten:
An iterative optimal algorithm for the generalized tower of hanoi problem. Int. J. Comput. Math. 39(3-4): 163-168 (1991)
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-06-01 03:44 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