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 50 matches
- 2011
- Prabhanjan Vijendra Ananth, Ambedkar Dukkipati:
Border basis detection is NP-complete. ISSAC 2011: 11-18 - Ainhoa Aparicio-Monforte, Moulay A. Barkatou, Sergi Simon, Jacques-Arthur Weil:
Formal first integrals along solutions of differential systems I. ISSAC 2011: 19-26 - Daniel Bembé, André Galligo:
Virtual roots of a real polynomial and fractional derivatives. ISSAC 2011: 27-34 - Alessandra Bernardi, Jérôme Brachat, Pierre Comon, Bernard Mourrain:
Multihomogeneous polynomial decomposition using moment matrices. ISSAC 2011: 35-42 - Jonathan M. Borwein, Armin Straub:
Special values of generalized log-sine integrals. ISSAC 2011: 43-50 - Curtis Bright, Arne Storjohann:
Vector rational number reconstruction. ISSAC 2011: 51-58 - Peter Bürgisser:
Probabilistic analysis of condition numbers. ISSAC 2011: 5-6 - Benjamin A. Burton:
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. ISSAC 2011: 59-66 - Daniel Cabarcas, Jintai Ding:
Linear algebra to compute syzygies and Gröbner bases. ISSAC 2011: 67-74 - Changbo Chen, James H. Davenport, Marc Moreno Maza, Bican Xia, Rong Xiao:
Computing with semi-algebraic sets represented by triangular decomposition. ISSAC 2011: 75-82 - Shaoshi Chen, Ruyong Feng, Guofeng Fu, Ziming Li:
On the structure of compatible rational functions. ISSAC 2011: 91-98 - Changbo Chen, Marc Moreno Maza:
Algorithms for computing triangular decompositions of polynomial systems. ISSAC 2011: 83-90 - Christian Eder, John Edward Perry:
Signature-based algorithms to compute Gröbner bases. ISSAC 2011: 99-106 - Tingting Fang, Mark van Hoeij:
2-descent for second order linear differential equations. ISSAC 2011: 107-114 - Jean-Charles Faugère, Chenqi Mou:
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. ISSAC 2011: 115-122 - Mark Giesbrecht, Daniel S. Roche:
Diversification improves interpolation. ISSAC 2011: 123-130 - Aurélien Greuet, Mohab Safey El Din:
Deciding reachability of the infimum of a multivariate polynomial. ISSAC 2011: 131-138 - Leilei Guo, Feng Liu:
An algorithm for computing set-theoretic generators of an algebraic variety. ISSAC 2011: 139-146 - Li Guo, William Y. Sit, Ronghua Zhang:
On Rota's problem for linear operators in associative algebras. ISSAC 2011: 147-154 - Somit Gupta, Arne Storjohann:
Computing hermite forms of polynomial matrices. ISSAC 2011: 155-162 - William Hart, Mark van Hoeij, Andrew Novocin:
Practical polynomial factoring in polynomial time. ISSAC 2011: 163-170 - Mark van Hoeij, Jürgen Klüners, Andrew Novocin:
Generating subfields. ISSAC 2011: 345-352 - Erich L. Kaltofen, Michael Nehring:
Supersparse black box rational function interpolation. ISSAC 2011: 177-186 - Erich L. Kaltofen, Michael Nehring, B. David Saunders:
Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176 - Jeremy Yrmeyahu Kaminski, Yann Sepulcre:
Using discriminant curves to recover a surface of P4 from two generic linear projections. ISSAC 2011: 187-192 - Deepak Kapur, Yao Sun, Dingkang Wang:
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously. ISSAC 2011: 193-200 - Manuel Kauers:
The concrete tetrahedron. ISSAC 2011: 7-8 - Manuel Kauers, Carsten Schneider:
A refined denominator bounding algorithm for multivariate linear difference equations. ISSAC 2011: 201-208 - Michael Kerber, Michael Sagraloff:
Efficient real root approximation. ISSAC 2011: 209-216 - Wei Li, Xiao-Shan Gao, Chun-Ming Yuan:
Sparse differential resultant. ISSAC 2011: 225-232
skipping 20 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-08 22:18 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