Остановите войну!
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 25 matches
- 1997
- E. Adams, K. Baumann, Christian Großmann:
Comparison of Direct to Shooting Enclosures for an Inverse-Monotone Boundary Value Problem with Locally Steep Solution. Computing 59(1): 63-84 (1997) - Jürgen Bruder:
Numerical Results for a Parallel Linearly-Implicit Runge-Kutta Method. Computing 59(2): 139-152 (1997) - Yuung-Jih Chen, Shi-Jinn Horng:
Medial Axis Transform on Mesh-Connected Computers with Hyperbus Broadcasting. Computing 59(2): 95-114 (1997) - Georg Denk, Stefan Schäffler:
Adams Methods for the Efficient Solution of Stochastic Differential Equations with Additive Noise. Computing 59(2): 153-162 (1997) - Jürgen Eichenauer-Herrmann, Eva Herrmann:
Compound Cubic Congruential Pseudorandom Numbers. Computing 59(1): 85-90 (1997) - Ivan De Falco, Renato Del Balio, Ernesto Tarantino:
An Analysis of Parallel Heuristics for Task Allocation in Multicomputers. Computing 59(3): 259-276 (1997) - J. Grüner, K. Zoller:
Computing Partial Expectations from Tables. Computing 59(3): 277-284 (1997) - Tamás Herendi, Thomas Siegl, Robert F. Tichy:
Fast Gaussian Random Number Generation Using Linear Transformations. Computing 59(2): 163-182 (1997) - C. Hidber:
A Generalisation of the Cantor-Zassenhaus Algorithm. Computing 59(4): 325-330 (1997) - K. Huang, J. Yu:
Remarks on a Formula for the Pseudoinverse by the Modified Huang Algorithm. Computing 59(2): 183-185 (1997) - B. Klinger:
Numerical Integration of Singular Integrands Using Low-Discrepancy Sequences. Computing 59(3): 223-236 (1997) - Ander Murua:
Partitioned Half-Explicit Runge-Kutta Methods for Differential-Algebraic Systems of Index 2. Computing 59(1): 43-62 (1997) - R. Neubert:
Approximation of Solution Curves of Underdetermined Systems of Nonlinear Equations. Computing 59(4): 285-306 (1997) - Mario Ohlberger, Martin Rumpf:
Hierarchical and Adaptive Visualization on Nested Grids. Computing 59(4): 365-385 (1997) - Ulrich Pferschy:
Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem. Computing 59(3): 237-258 (1997) - Gerd Pönisch, Uwe Schnabel, Hubert Schwetlick:
Computing Multiple Pitchfork Bifurcation Points. Computing 59(3): 209-222 (1997) - Luis Rocha:
On the Rate of Convergence of 2-Term Recursions in IRd. Computing 59(3): 187-208 (1997) - V. Stahl:
A Sufficient Condition for Non-Overestimation in Interval Arithmetic. Computing 59(4): 349-364 (1997) - Sverre Storøy, Tor Sørevik:
Massively Parallel Augmenting Path Algorithms for the Assignment Problem. Computing 59(1): 1-16 (1997) - Jens Struckmeier:
Generation of Random Variates Using AsymptoticExpansions. Computing 59(4): 331-348 (1997) - Paolo Tilli:
Polynomial Root Finding by Means of Continuation. Computing 59(4): 307-324 (1997) - C. T. Traxler:
An Algorithm for Adaptive Mesh Refinement in n Dimensions. Computing 59(2): 115-138 (1997) - Hoang Duong Tuan:
Can Linear Programs be Used to Test Global Optimization Algorithms? Computing 59(1): 91-93 (1997) - Christian Wieners:
Bounds for the N Lowest Eigenvalues of Fourth-Order Boundary Value Problems. Computing 59(1): 29-42 (1997) - P. Zitnan:
Discrete Least-Squares Technique for Eigenvalues. Part I: The One-Dimensional Case. Computing 59(1): 17-28 (1997)
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-08-06 00:26 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