Остановите войну!
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 19 matches
- 2007
- Sven Beuchler, Veronika Pillwein:
Sparse shape functions for tetrahedral p -FEM using integrated Jacobi polynomials. Computing 80(4): 345-375 (2007) - Marco Caliari:
Accurate evaluation of divided differences for polynomial interpolation of exponential propagators. Computing 80(2): 189-201 (2007) - Leah Epstein, Rob van Stee:
Calculating lower bounds for caching problems. Computing 80(3): 275-285 (2007) - Maxim V. Fedorov, Heinz-Jürgen Flad, Gennady N. Chuev, Lars Grasedyck, Boris N. Khoromskij:
A structured low-rank wavelet solver for the Ornstein-Zernike integral equation. Computing 80(1): 47-73 (2007) - Vasile Gradinaru:
Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation. Computing 80(1): 1-22 (2007) - Wolfgang Hackbusch:
Fast and exact projected convolution for non-equidistant grids. Computing 80(2): 137-168 (2007) - Johannes Hatzl:
Median problems on wheels and cactus graphs. Computing 80(4): 377-393 (2007) - B. Heinrich, B. Jung:
The Fourier-Nitsche-mortaring for elliptic problems with reentrant edges. Computing 80(3): 221-246 (2007) - Vincent Heuveline, Friedhelm Schieweck:
H 1-interpolation on quadrilateral and hexahedral meshes with hanging nodes. Computing 80(3): 203-220 (2007) - Jiangguo Liu, Hongsen Chen, Richard E. Ewing, Guan Qin:
An efficient algorithm for characteristic tracking on two-dimensional triangular meshes. Computing 80(2): 121-136 (2007) - T. Lundy, J. Van Buskirk:
A new matrix approach to real FFTs and convolutions of length 2 k . Computing 80(1): 23-45 (2007) - Gunar Matthies, Friedhelm Schieweck:
On the reference mapping for quadrilateral and hexahedral finite elements on multilevel adaptive grids. Computing 80(2): 95-119 (2007) - Paluri S. V. Nataraj, Nandkishor Kubal:
On the Asaithambi-Zuhe-Moore algorithm for computing the range of values. Computing 80(3): 247-253 (2007) - Suely Oliveira, Fang Yang:
An algebraic approach for H-matrix preconditioners. Computing 80(2): 169-188 (2007) - Jeffrey S. Ovall:
Hierarchical matrix techniques for a domain decomposition algorithm. Computing 80(4): 287-297 (2007) - Aris Pagourtzis, Katerina Potika, Stathis Zachos:
Path multicoloring with fewer colors in spiders and caterpillars. Computing 80(3): 255-274 (2007) - Arnold Reusken, M. Soemers:
On the robustness of a multigrid method for anisotropic reaction-diffusion problems. Computing 80(4): 299-317 (2007) - Robert Scheichl, Eero Vainikko:
Additive Schwarz with aggregation-based coarsening for elliptic problems with highly variable coefficients. Computing 80(4): 319-343 (2007) - Bart Vandewoestyne, Ronald Cools, T. Warnock:
On obtaining quadratic and cubic error convergence using weighted Kronecker-sequences. Computing 80(1): 75-94 (2007)
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-28 18:28 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