Остановите войну!
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 52 matches
- 2005
- Sergei A. Abramov, M. Petkovssek:
Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula. ISSAC 2005: 5-12 - Jeffrey Adams, B. David Saunders, Zhendong Wan:
Signature of symmetric rational matrices and the unitary dual of lie groups. ISSAC 2005: 13-20 - Hirokazu Anai, Shinji Hara, Kazuhiro Yokoyama:
Sum of roots with positive real parts. ISSAC 2005: 21-28 - J. M. Aroca, J. Cano, Ruyong Feng, Xiao-Shan Gao:
Algebraic general solutions of algebraic ordinary differential equations. ISSAC 2005: 29-36 - James C. Beaumont, Russell J. Bradford, James H. Davenport, Nalina Phisanbut:
Adherence is better than adjacency: computing the Riemann index using CAD. ISSAC 2005: 37-44 - Alin Bostan, Thomas Cluzeau, Bruno Salvy:
Fast algorithms for polynomial solutions of linear differential equations. ISSAC 2005: 45-52 - Delphine Boucher:
Non complete integrability of a magnetic satellite in circular orbit. ISSAC 2005: 53-60 - Alain Bretto, Luc Gillibert, Bernard Laget:
Symmetric and semisymmetric graphs construction using G-graphs. ISSAC 2005: 61-67 - Manuel Bronstein, Ziming Li, Min Wu:
Picard--Vessiot extensions for linear functional systems. ISSAC 2005: 68-75 - Christopher W. Brown, Scott McCallum:
On using bi-equational constraints in CAD construction. ISSAC 2005: 76-83 - Bruno Buchberger:
A view on the future of symbolic computation. ISSAC 2005: 1 - Orlando A. Carvajal, Frederick W. Chapman, Keith O. Geddes:
Hybrid symbolic-numeric integration in multiple dimensions via tensor-product series. ISSAC 2005: 84-91 - Zhuliang Chen, Arne Storjohann:
A BLAS based C library for exact linear algebra on integer matrices. ISSAC 2005: 92-99 - Christian Costermans, Jean-Yves Enjalbert, Vincel Hoang Ngoc Minh, Michel Petitot:
Structure and asymptotic expansion of multiple harmonic sums. ISSAC 2005: 100-107 - Xavier Dahan, Marc Moreno Maza, Éric Schost, Wenyuan Wu, Yuzhen Xie:
Lifting techniques for triangular decompositions. ISSAC 2005: 108-115 - Barry H. Dayton, Zhonggang Zeng:
Computing the multiplicity structure in solving polynomial systems. ISSAC 2005: 116-123 - Jiansong Deng, Falai Chen, Liyong Shen:
Computing µ-bases of rational curves and surfaces using polynomial matrix factorization. ISSAC 2005: 132-139 - Jean-Guillaume Dumas, Clément Pernet, Zhendong Wan:
Efficient computation of the characteristic polynomial. ISSAC 2005: 140-147 - André Galligo, Jean Pascal Pavone:
Selfintersections of a bézier bicubic surface. ISSAC 2005: 148-155 - Stefan Gerhold, Manuel Kauers:
A procedure for proving special function inequalities involving a discrete parameter. ISSAC 2005: 156-162 - Dima Grigoriev, Fritz Schwarz:
Generalized Loewy-decomposition of d-modules. ISSAC 2005: 163-170 - Markus A. Hitz:
On computing nearest singular hankel matrices. ISSAC 2005: 171-176 - Mark van Hoeij, Jacques-Arthur Weil:
Solving second order linear differential equations with Klein's theorem. ISSAC 2005: 340-347 - Bradford Hovinen, Wayne Eberly:
A reliable block Lanczos algorithm over small finite fields. ISSAC 2005: 177-184 - Fangjian Huang, Shengli Chen:
Schur partition for symmetric ternary forms and readable proof to inequalities. ISSAC 2005: 185-192 - David J. Jeffrey, Pratibha, K. B. Roach:
Affine transformations of algebraic numbers. ISSAC 2005: 193-199 - Jeremy R. Johnson, Werner Krandick, Anatole D. Ruslanov:
Architecture-aware classical Taylor shift by 1. ISSAC 2005: 200-207 - Erich L. Kaltofen, Pascal Koiran:
On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC 2005: 208-215 - Erich L. Kaltofen, Dmitriy Morozov, George Yuhasz:
Generic matrix multiplication and memory management in linBox. ISSAC 2005: 216-223 - Jennifer de Kleine, Michael B. Monagan, Allan D. Wittkopf:
Algorithms for the non-monic case of the sparse modular GCD algorithm. ISSAC 2005: 124-131
skipping 22 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-05-26 12:27 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