![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 1994
- K. A. Ariyawansa:
On Davidon's collinear scaling algorithms for optimization. Computing 52(3): 299-307 (1994) - Luitpold Babel:
A fast algorithm for the maximum weight clique problem. Computing 52(1): 31-38 (1994) - Binay K. Bhattacharya, Shreesh Jadhav, Asish Mukhopadhyay, J.-M. Robert:
Optimal algorithms for some intersection radius problems. Computing 52(3): 269-279 (1994) - Peter Brucker, L. Nordmann:
Thek-track assignment problem. Computing 52(2): 97-122 (1994) - Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
A general approach to avoiding two by two submatrices. Computing 52(4): 371-388 (1994) - Kai Diethelm
:
Modified compound quadrature rules for strongly singular integrals. Computing 52(4): 337-354 (1994) - M. K. El-Daou, E. L. Ortiz:
A recursive formulation of collocation in terms of canonical polynomials. Computing 52(2): 177-202 (1994) - K. Freyburger:
A Remez type algorithm for generalized spline spaces. Computing 52(1): 65-87 (1994) - Gábor Galambos, André van Vliet:
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. Computing 52(3): 281-297 (1994) - Emanuele Galligani, A. Laratta:
Error analysis of null space algorithm for linear equality constrained least squares problems. Computing 52(2): 161-176 (1994) - Joseph L. Ganley, Lenwood S. Heath:
Heuristics for laying out information graphs. Computing 52(4): 389-405 (1994) - Wolfgang Hackbusch, Stefan A. Sauter:
On numerical cubatures of nearly singular surface integrals arising in BEM collocation. Computing 52(2): 139-159 (1994) - Wolfgang Hörmann:
A universal generator for discrete log-concave distributions. Computing 52(1): 89-96 (1994) - Leif Kobbelt:
A fast dot-product algorithm with minimal rounding errors. Computing 52(4): 355-369 (1994) - S.-S. Lin:
Constant-time hough transform on the processor arrays with reconfigurable bus systems. Computing 52(1): 1-15 (1994) - Wolfram Luther, Werner Otten:
Verified inclusion for eigenvalues of the first order PLL equation with general phase detector characteristics. Computing 52(3): 213-232 (1994) - Rossana Morandi, Costanza Conti
:
A discrete monotonous interpolation scheme. Computing 52(3): 257-267 (1994) - Arnold Neumaier
:
Global, rigorous and realistic bounds for the solution of dissipative differential equations. Part I: Theory. Computing 52(4): 315-336 (1994) - P. Oswald:
On the convergence rate of SOR: A worst case estimate. Computing 52(3): 245-255 (1994) - S. Petrova:
An efficient implementation of certain iterative refinement preconditioners. Computing 52(1): 51-63 (1994) - Svatopluk Poljak, Franz Rendl:
Node and edge relaxations of the Max-cut problem. Computing 52(2): 123-137 (1994) - Manabu Sakai, Riaz A. Usmani:
Numerical integration formulas based on iterated cubic splines. Computing 52(3): 309-314 (1994) - N. P. Seif, S. A. Hussein, A. S. Deif:
The interval Sylvester equation. Computing 52(3): 233-244 (1994) - Natalia V. Shakhlevich
, Yuri N. Sotskov:
Scheduling two jobs with fixed and nonfixed routes. Computing 52(1): 17-30 (1994) - Joachim Wick:
Numerical approaches to the kinetic semiconductor equation. Computing 52(1): 39-49 (1994) - W.-M. Yan, K.-L. Chung:
A fast algorithm for solving special tridiagonal systems. Computing 52(2): 203-211 (1994)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-17 13:40 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