![](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 27 matches
- 2022
- Carlos Améndola
, Viet Son Pham:
Autocovariance varieties of moving average random fields. J. Symb. Comput. 109: 202-219 (2022) - Elena Angelini, Cristiano Bocci, Luca Chiantini
:
Catalecticant intersections and confinement of decompositions of forms. J. Symb. Comput. 109: 220-237 (2022) - Edoardo Ballico, Alessandra Bernardi, Emanuele Ventura
:
Strict inclusions of high rank loci. J. Symb. Comput. 109: 238-249 (2022) - Mauro Carlo Beltrametti, Alessandro Logar, Maria-Laura Torrente
:
Quartic monoid surfaces with maximum number of lines. J. Symb. Comput. 109: 250-258 (2022) - Alessandra Bernardi, Carlos D'Andrea, Thorsten Theobald:
Foreword: Special issue of JSC on the occasion of MEGA 2019. J. Symb. Comput. 109: 199-201 (2022) - Jérémy Berthomieu
, Jean-Charles Faugère:
Polynomial-division-based algorithms for computing linear recurrence relations. J. Symb. Comput. 109: 1-30 (2022) - Anna Maria Bigatti, Lorenzo Robbiano:
Saturations of subalgebras, SAGBI bases, and U-invariants. J. Symb. Comput. 109: 259-282 (2022) - Marcin Bilski, Peter Scheiblechner:
Effective approximation of the solutions of algebraic equations. J. Symb. Comput. 109: 144-176 (2022) - Janko Böhm, Wolfram Decker, Santiago Laplagne, Gerhard Pfister:
Computing integral bases via localization and Hensel lifting. J. Symb. Comput. 109: 283-324 (2022) - F. J. Castro-Jiménez
, Helena Cobo Pablos:
On certain polynomial systems involving Stirling numbers of second kind. J. Symb. Comput. 109: 325-350 (2022) - Diego Cifuentes, Kristian Ranestad, Bernd Sturmfels, Madeleine Weinstein
:
Voronoi cells of varieties. J. Symb. Comput. 109: 351-366 (2022) - Michael Clausen:
A unified FFT-based approach to maximum assignment problems related to transitive finite group actions. J. Symb. Comput. 109: 88-115 (2022) - Timothy Duff
, Nickolas Hein, Frank Sottile:
Certification for polynomial systems via square subsystems. J. Symb. Comput. 109: 367-385 (2022) - Joachim von zur Gathen, Guillermo Matera:
Shifted varieties and discrete neighborhoods around varieties. J. Symb. Comput. 109: 31-49 (2022) - Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima:
Efficient rational creative telescoping. J. Symb. Comput. 109: 57-87 (2022) - Elisa Gorla
, Daniela Mueller, Christophe Petit
:
Stronger bounds on the cost of computing Gröbner bases for HFE systems. J. Symb. Comput. 109: 386-398 (2022) - Dima Grigoriev, Danylo V. Radchenko
:
On a tropical version of the Jacobian conjecture. J. Symb. Comput. 109: 399-403 (2022) - Jacob Hartzer, Olivia Röhrig, Timo de Wolff, Oguzhan Yürük:
Initial steps in the classification of maximal mediated sets. J. Symb. Comput. 109: 404-425 (2022) - Stefan Kahrs
, Colin Runciman:
Simplifying regular expressions further. J. Symb. Comput. 109: 124-143 (2022) - Gregor Kemper:
Computing quotients by connected solvable groups. J. Symb. Comput. 109: 426-440 (2022) - Momonari Kudo:
Computing representation matrices for the action of Frobenius on cohomology groups. J. Symb. Comput. 109: 441-464 (2022) - Ernst W. Mayr, Werner M. Seiler, Evgenii V. Vorozhtsov:
Memories on Vladimir Gerdt. J. Symb. Comput. 109: 50-56 (2022) - Euisung Park:
On surfaces of minimal degree in P5. J. Symb. Comput. 109: 116-123 (2022) - Daniel Perrucci, Marie-Françoise Roy:
A new general formula for the Cauchy index on an interval with subresultants. J. Symb. Comput. 109: 465-481 (2022) - Roberto La Scala, Sharwan K. Tiwari
:
Stream/block ciphers, difference equations and algebraic attacks. J. Symb. Comput. 109: 177-198 (2022) - Miruna-Stefana Sorea
:
Measuring the local non-convexity of real algebraic curves. J. Symb. Comput. 109: 482-509 (2022) - Justyna Szpond:
Unexpected hypersurfaces with multiple fat points. J. Symb. Comput. 109: 510-519 (2022)
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 07:58 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