Остановите войну!
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 40 matches
- 1999
- Haydeh Ahrabian, Abbas Nowzari-Dalini:
On the generation of binary trees in A-order. Int. J. Comput. Math. 71(3): 351-357 (1999) - David Al-Dabass, A. Cheetham, David J. Evans:
Simulation of a multi-dimensional pattern classifier. Int. J. Comput. Math. 71(2): 197-233 (1999) - Ioannis K. Argyros:
Relations between forcing sequences and inexact newton-like iterates in banach spaceInexact newton-like iterates in banach space. Int. J. Comput. Math. 71(2): 235-246 (1999) - Mansour Asiry, G. A. Watson:
On solutions of a class of best simultaneous approximation problems. Int. J. Comput. Math. 71(3): 413-425 (1999) - Stefano Basagni:
A note on causal trees and their applications to CCS. Int. J. Comput. Math. 71(2): 137-159 (1999) - Thomas Buchholz, Andreas Klein, Martin Kutrib:
On time reduction and simulation in cellular spaces. Int. J. Comput. Math. 71(4): 459-474 (1999) - H. N. Caglar, S. H. Caglar, Edward H. Twizell:
The numerical solution of third-order boundary-value problems with fourth-degree & B-spline functions. Int. J. Comput. Math. 71(3): 373-381 (1999) - Francisco Criado, T. Gachechiladez, Hamlet Meladze:
Inverse spline-interpolation for numerically solving a piston problem with isothermic gas compression and constant velocityIsothermic gas compression and constant velocity. Int. J. Comput. Math. 71(1): 83-95 (1999) - Daoud S. Daoud:
On the stationary and non stationary extrapolation iterative methodNon stationary extrapolation iterative method. Int. J. Comput. Math. 71(2): 247-257 (1999) - István Deák:
Iteration grain sized asynchronous parallel algorithms in optimization. Int. J. Comput. Math. 71(2): 183-196 (1999) - Feodor F. Dragan, Falk Nicolai:
Lexbfs-orderings and powers of hhd-free graphs. Int. J. Comput. Math. 71(1): 35-56 (1999) - Charles B. Dunham:
Fitting approximations with fixed components at zeroFixed components at zero. Int. J. Comput. Math. 71(1): 97-98 (1999) - Charles B. Dunham:
Wilkinson-type error analysis applied to double-precision accumulation under contamination. Int. J. Comput. Math. 71(3): 369-372 (1999) - Salah M. El-Sayed:
Multi-integral methods for nonlinear boundary-value problems. Int. J. Comput. Math. 71(2): 259-265 (1999) - David J. Evans:
A systolic array for the parallel solution of block trid1agonal linear systems (Sats). Int. J. Comput. Math. 71(1): 57-70 (1999) - Robert R. Goldberg, Jacob Shapiro:
Partitioning ideal sets. Int. J. Comput. Math. 71(3): 337-349 (1999) - George A. Grawanis:
Preconditioned iterative methods for solving 3d boundary value problemsSolving 3D boundary value problems. Int. J. Comput. Math. 71(1): 117-136 (1999) - Dharmendra Kumar Gupta, C. N. Kaul:
Enclosing the square root of a positive definite symmetric matrixA positive definite symmetric matrix. Int. J. Comput. Math. 71(1): 105-115 (1999) - Kao-Shing Hwang, Long-Yeu Chung:
A novel numerical method on the resolution of the time-invariant systems responseResolution of the time-invariant systems response. Int. J. Comput. Math. 71(2): 277-290 (1999) - S. A. Hoda Ibrahim:
Multigrid treatment of l-shape domain for boundary-value problems in two and three dimensions. Int. J. Comput. Math. 71(4): 507-519 (1999) - Tianzi Jiang:
A tabu search approach to optimal structuring element extraction for mst- based shapes description. Int. J. Comput. Math. 71(4): 437-445 (1999) - A. J. Kane, David J. Evans:
Neural network software simulation. Int. J. Comput. Math. 71(4): 475-494 (1999) - Daehyon Kim:
Normalization methods for input and output vectors in backpropagation neural networks. Int. J. Comput. Math. 71(2): 161-171 (1999) - Keqin Li:
Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems. Int. J. Comput. Math. 71(1): 21-34 (1999) - Lei Li, Hiroshi Niki, Morito Sasanabe:
A nonparameter criterion for generalized diagonally dominant matricesGeneralized diagonally dominant matrices. Int. J. Comput. Math. 71(2): 267-275 (1999) - Qun Lin, Jon G. Rokne:
Fitting parametric disk curves. Int. J. Comput. Math. 71(2): 173-182 (1999) - Alexander Meduna:
Prefix pushdown automata and their simplification. Int. J. Comput. Math. 71(1): 1-20 (1999) - Alexander Meduna:
Middle quotients of linear languages. Int. J. Comput. Math. 71(3): 319-335 (1999) - George E. Okecha:
On the numerical solution of strongly singular fredholm integral equations of the second kind. Int. J. Comput. Math. 71(4): 531-540 (1999) - M. Othman, Abdul Rahman Abdullah:
An efficient multigrid poisson solver. Int. J. Comput. Math. 71(4): 541-553 (1999)
skipping 10 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-04-27 19:49 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