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
- 2000
- David J. Evans:
Systolic arrays for matrix over-relaxation methods. Int. J. Comput. Math. 73(3): 299-311 (2000) - David J. Evans:
Systolic array designs for matrix iterative processes. Int. J. Comput. Math. 73(4): 405-415 (2000) - David J. Evans:
Cyclic and stride reduction methods for generalised tridiagonal matrices. Int. J. Comput. Math. 73(4): 487-492 (2000) - Hasan Bulut, Mustafa Inç:
A two step method for the numerical integration of stiff differential equations. Int. J. Comput. Math. 73(3): 333-340 (2000) - Man Mohan Chawla, Mansour A. Al-Zanaidi, David J. Evans:
Non-dissipative time-integration schemes for the linear advection equation. Int. J. Comput. Math. 73(4): 503-515 (2000) - Rezaul Alam Chowdhury, M. Kaykobad, Suman Kumar Nath:
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort. Int. J. Comput. Math. 73(3): 293-297 (2000) - M. B. Elgindi, A. Kharab:
The quadratic method for computing the eigenpairs of a martix. Int. J. Comput. Math. 73(4): 517-530 (2000) - G. A. Evans, K. C. Chung:
Laplace transform inversions using optimal contours in the complex plane. Int. J. Comput. Math. 73(4): 531-543 (2000) - D. K. Gupta:
Enclosing the solutions of nonlinear systems of equations. Int. J. Comput. Math. 73(3): 389-404 (2000) - Marjan Gusev, David J. Evans:
Algorithm transformations for the data broadcast elimination method. Int. J. Comput. Math. 73(4): 433-461 (2000) - Min-Shiang Hwang:
An asymmetric cryptographuic key assignment scheme for access control in totally-ordered hierarchies. Int. J. Comput. Math. 73(4): 463-468 (2000) - Kao-Shing Hwang, Feng-Cheng Chang, Jeng-Yih Chiou:
A numerical approach to fast evaluation of time-invariant system responses. Int. J. Comput. Math. 73(3): 361-369 (2000) - Shri Raghav Kaushik, Kamala Krithivasan:
Some results on contextual grammars. Int. J. Comput. Math. 73(3): 279-291 (2000) - Mong-shu Lee:
Signal smoothness estimation in hölder spaces. Int. J. Comput. Math. 73(3): 321-332 (2000) - Changjun Li, David J. Evans:
Fast qz decomposition and its applications. Int. J. Comput. Math. 73(3): 371-387 (2000) - Lei Li, Tadao Nakamura:
Fast parallel algorithms for vandermonde determinants. Int. J. Comput. Math. 73(4): 479-486 (2000) - P. R. Parthasarathy, Selvamuthu Dharmaraja, G. Manimaran:
Transient solution of multiprocessor systems with state-dependent arrivals. Int. J. Comput. Math. 73(3): 313-320 (2000) - Nejib Smaoui:
An artificial neural network noise reduction method for chaotic attractors. Int. J. Comput. Math. 73(4): 417-431 (2000) - Haralambos K. Terzidis, George Danas:
The systems of primitive roots the degree and rank of prime numbers. Int. J. Comput. Math. 73(4): 469-478 (2000) - Yuan-Ming Wang, Ravi P. Agarwal:
Remarks on periodic boundary value problems of first order discrete systems. Int. J. Comput. Math. 73(4): 493-502 (2000) - Shijian Yan, Kaibin Huang:
The original tls solution sets of the multidimensional TLS problem. Int. J. Comput. Math. 73(3): 349-359 (2000) - Tian Zhenfu, Hu Qiuling:
A new family of three-level five-point explicit schemes with high stability properties for dispersive equation. Int. J. Comput. Math. 73(3): 341-348 (2000) - 1999
- Isto Aho, Harri Kemppainen, Kai Koskimies, Erkki Mäkinen, Tapio Niemi:
Searching neural network structures with L systems and genetic algorithms. Int. J. Comput. Math. 73(1): 55-75 (1999) - Hasan Çam:
Balanced permutations and multistage interconnection networks. Int. J. Comput. Math. 73(1): 125-137 (1999) - Nguyen Huu Cong:
Explicit pseudo two-step runge-kutta methods for parallel computers. Int. J. Comput. Math. 73(1): 77-91 (1999) - Gianfranco Corradi:
A logarithm barrier method for linear programming. Int. J. Comput. Math. 73(1): 93-104 (1999) - S. K. Gupta, Amrinder Singh:
On tree roots of graphs. Int. J. Comput. Math. 73(2): 157-166 (1999) - M. A. Hussien:
Chebyshev solution for neutral delay differential equations. Int. J. Comput. Math. 73(2): 253-260 (1999) - E. A. Ibijola, P. Kama:
On the convergence, consistency and stability of a one-step method for numerical integration of ordinary differential equation. Int. J. Comput. Math. 73(2): 261-277 (1999) - Tianzi Jiang, David J. Evans:
The worst case complexity of the fredholm equation with periodic free term and noisy information. Int. J. Comput. Math. 73(1): 1-14 (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-11-02 21:29 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