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 64 matches
- 2020
- Vikram Sharma:
Generalizing the davenport-mahler-mignotte bound. ISSAC 2020: 410-417 - Jie Wang, Victor Magron:
A second order cone characterization for sums of nonnegative circuits. ISSAC 2020: 450-457 - Simon Abelard, Alain Couvreur, Grégoire Lecerf:
Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curves. ISSAC 2020: 14-21 - Mohammadali Asadi, Alexander Brandt, Robert H. C. Moir, Marc Moreno Maza, Yuzhen Xie:
On the parallelization of triangular decompositions. ISSAC 2020: 22-29 - Erick Rodríguez Bazan, Evelyne Hubert:
Ideal Interpolation, H-bases and symmetry. ISSAC 2020: 402-409 - Anton Betten:
The orbiter ecosystem for combinatorial data. ISSAC 2020: 30-37 - Stavros Birmpilis, George Labahn, Arne Storjohann:
A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix. ISSAC 2020: 38-45 - Alin Bostan:
Computing the N-th term of a q-holonomic sequence. ISSAC 2020: 46-53 - Manfred Buchacher, Manuel Kauers, Gleb Pogudin:
Separating variables in bivariate polynomial ideals. ISSAC 2020: 54-61 - Jose Capco, Mohab Safey El Din, Josef Schicho:
Robots, computer algebra and eight connected components. ISSAC 2020: 62-69 - Xavier Caruso, Tristan Vaccon, Thibaut Verron:
Signature-based algorithms for Gröbner bases over tate algebras. ISSAC 2020: 70-77 - Hara Charalambous, Kostas Karagiannis, Sotiris Karanikolopoulos, Aristides Kontogeorgis:
Syzygies of ideals of polynomial rings over principal ideal domains. ISSAC 2020: 78-82 - Shaoshi Chen, Lixin Du, Manuel Kauers, Thibaut Verron:
Integral bases for p-recursive sequences. ISSAC 2020: 91-98 - Cyrille Chenavier, Clemens Hofstadler, Clemens G. Raab, Georg Regensburger:
Compatible rewriting of noncommutative polynomials for proving operator identities. ISSAC 2020: 83-90 - Frédéric Chyzak, Philippe Dumas:
A Gröbner-basis theory for divide-and-conquer recurrences. ISSAC 2020: 99-106 - Teresa Cortadellas, Carlos D'Andrea, M. Eulalia Montoro:
Bounds for degrees of minimal μ: bases of parametric surfaces. ISSAC 2020: 107-113 - David A. Cox:
Reflections on elimination theory. ISSAC 2020: 1-4 - Annie A. M. Cuyt:
What do sparse interpolation, padé approximation, gaussian quadrature and tensor decomposition have in common? ISSAC 2020: 12 - Xavier Dahan, Tristan Vaccon:
On a non-archimedean broyden method. ISSAC 2020: 114-121 - Michael DiPasquale, Zachary Flores, Chris Peterson:
On the apolar algebra of a product of linear forms. ISSAC 2020: 130-137 - Alicia Dickenstein:
Positive solutions of sparse polynomial systems. ISSAC 2020: 5-7 - Volker Diekert, Igor Potapov, Pavel Semukhin:
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC 2020: 122-129 - Mareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff:
Global optimization via the dual SONC cone and linear programming. ISSAC 2020: 138-145 - Hao Du, Jing Guo, Ziming Li, Elaine Wong:
An additive decomposition in logarithmic towers and beyond. ISSAC 2020: 146-153 - Timothy Duff, Michael Ruddy:
Numerical equality tests for rational maps and signatures of curves. ISSAC 2020: 154-161 - Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic:
On fast multiplication of a matrix by its transpose. ISSAC 2020: 162-169 - Jesse Elliott, Mark Giesbrecht, Éric Schost:
On the bit complexity of finding points in connected components of a smooth real hypersurface. ISSAC 2020: 170-177 - Matthew England:
Real quantifier elimination by cylindrical algebraic decomposition, and improvements by machine learning. ISSAC 2020: 13 - Sebastian Falkensteiner, Cristhian Garay-López, Mercedes Haiech, Marc Paul Noordman, Zeinab Toghani, François Boulier:
The fundamental theorem of tropical partial differential algebraic geometry. ISSAC 2020: 178-185 - Abhibhav Garg, Nitin Saxena:
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree. ISSAC 2020: 186-193
skipping 34 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-12-19 13:43 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