Остановите войну!
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 24 matches
- 2020
- John Perry:
A dynamic F4 algorithm to compute Gröbner bases. Appl. Algebra Eng. Commun. Comput. 31(5-6): 411-434 (2020) - Rafael A. Arce-Nazario, Francis N. Castro, Domingo Gómez-Pérez, Oscar Moreno, José R. Ortiz-Ubarri, Ivelisse Rubio, Andrew Z. Tirkel:
Multidimensional linear complexity analysis of periodic arrays. Appl. Algebra Eng. Commun. Comput. 31(1): 43-63 (2020) - Boo Barkee, Michela Ceria, Theo Moriarty, Andrea Visconti:
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures. Appl. Algebra Eng. Commun. Comput. 31(3-4): 235-252 (2020) - Evangelos Bartzos, Ioannis Z. Emiris, Josef Schicho:
On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs. Appl. Algebra Eng. Commun. Comput. 31(5-6): 325-357 (2020) - Cristina Bertone, Francesca Cioffi, Luis M. Pardo:
Special Issue: "Algebraic Geometry from an Algorithmic Point of View", ACA 2019, Montréal, Canada, July 16-20, 2019. Appl. Algebra Eng. Commun. Comput. 31(5-6): 323-324 (2020) - Swati Bhardwaj, Madhu Raka:
Skew constacyclic codes over a non-chain ring ${\mathbb {F}}_{q}[u, v]/\langle f(u), g(v), uv-vu\rangle $. Appl. Algebra Eng. Commun. Comput. 31(3-4): 173-194 (2020) - Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh:
A nonexistence certificate for projective planes of order ten with weight 15 codewords. Appl. Algebra Eng. Commun. Comput. 31(3-4): 195-213 (2020) - Fatma Çaliskan, Refia Aksoy:
Linear codes over $\mathbb {F}_2 \times (\mathbb {F}_2+v\mathbb {F}_2)$ and the MacWilliams identities. Appl. Algebra Eng. Commun. Comput. 31(2): 135-147 (2020) - Michela Ceria, Teo Mora:
Toward involutive bases over effective rings. Appl. Algebra Eng. Commun. Comput. 31(5-6): 359-387 (2020) - Michela Ceria, Teo Mora, Massimiliano Sala:
HELP: a sparse error locator polynomial for BCH codes. Appl. Algebra Eng. Commun. Comput. 31(3-4): 215-233 (2020) - Hai Q. Dinh, Atul Gaur, Indivar Gupta, Abhay Kumar Singh, Manoj Kumar Singh, Roengchai Tansuchat:
Hamming distance of repeated-root constacyclic codes of length 2ps over ${\mathbb {F}}_{pm}+u{\mathbb {F}}_{pm}$. Appl. Algebra Eng. Commun. Comput. 31(3-4): 291-305 (2020) - Gert-Martin Greuel, Thuy Huong Pham:
Algorithms for group actions in arbitrary characteristic and a problem in singularity theory. Appl. Algebra Eng. Commun. Comput. 31(2): 87-100 (2020) - Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, Qiang Wang:
Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019. Appl. Algebra Eng. Commun. Comput. 31(3-4): 171-172 (2020) - Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for low rank linear matrices. Appl. Algebra Eng. Commun. Comput. 31(2): 101-133 (2020) - Gabriel Mattos Langeloh:
A comparison of unrestricted dynamic Gröbner Basis algorithms. Appl. Algebra Eng. Commun. Comput. 31(5-6): 389-409 (2020) - Dae-Woong Lee:
Digital H-spaces and actions in the pointed digital homotopy category. Appl. Algebra Eng. Commun. Comput. 31(2): 149-169 (2020) - Juliano B. Lima, Daniel Panario:
A trigonometric approach for Dickson polynomials over fields of characteristic two. Appl. Algebra Eng. Commun. Comput. 31(3-4): 253-270 (2020) - Adrien Poteaux, Martin Weimann:
Computing the equisingularity type of a pseudo-irreducible polynomial. Appl. Algebra Eng. Commun. Comput. 31(5-6): 435-460 (2020) - Charul Rajput, Maheshanand Bhaintwal:
Optimal RS-like LRC codes of arbitrary length. Appl. Algebra Eng. Commun. Comput. 31(3-4): 271-289 (2020) - Michele Rossi, Lea Terracini:
Toric varieties and Gröbner bases: the complete $\mathbb {Q}$-factorial case. Appl. Algebra Eng. Commun. Comput. 31(5-6): 461-482 (2020) - R. K. Sharma, Rohit Gupta:
Determination of a type of permutation binomials and trinomials. Appl. Algebra Eng. Commun. Comput. 31(1): 65-86 (2020) - Yan-Ping Wang, Qiang Wang, Wei-Guo Zhang:
Boomerang uniformity of normalized permutation polynomials of low degree. Appl. Algebra Eng. Commun. Comput. 31(3-4): 307-322 (2020) - Arti D. Yardi, Saravanan Vijayakumaran:
Properties of syndrome distribution for blind reconstruction of cyclic codes. Appl. Algebra Eng. Commun. Comput. 31(1): 23-41 (2020) - Giuseppe Zito:
Arf good semigroups with fixed genus. Appl. Algebra Eng. Commun. Comput. 31(1): 1-21 (2020)
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-03 16:44 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