Остановите войну!
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 16 matches
- 2019
- Bart De Bruyn, Binod Kumar Sahoo:
On minimum size blocking sets of the outer tangents to a hyperbolic quadric in PG(3, q). Finite Fields Their Appl. 56: 31-57 (2019) - Anne Canteaut, Léo Perrin:
On CCZ-equivalence, extended-affine equivalence, and function twisting. Finite Fields Their Appl. 56: 209-246 (2019) - Pascale Charpin, Jie Peng:
New links between nonlinearity and differential uniformity. Finite Fields Their Appl. 56: 188-208 (2019) - Wun-Seng Chou, Xiang-dong Hou:
On a conjecture of Fernando, Hou and Lappano concerning permutation polynomials over finite fields. Finite Fields Their Appl. 56: 58-92 (2019) - Leo Creedon, Kieran Hughes:
Derivations on group algebras with coding theory applications. Finite Fields Their Appl. 56: 247-265 (2019) - Bence Csajbók, Giuseppe Marino, Olga Polverino, Ferdinando Zullo:
A characterization of linearized polynomials with maximum kernel. Finite Fields Their Appl. 56: 109-130 (2019) - H. R. Dorbidi:
On a conjecture about the commuting graphs of finite matrix rings. Finite Fields Their Appl. 56: 93-96 (2019) - Ofir Gorodetsky:
Irreducible polynomials over F2r with three prescribed coefficients. Finite Fields Their Appl. 56: 150-187 (2019) - Ziling Heng, Cunsheng Ding:
The subfield codes of hyperoval and conic codes. Finite Fields Their Appl. 56: 308-331 (2019) - Saadoun Mahmoudi, Karim Samei:
Additive codes over Galois rings. Finite Fields Their Appl. 56: 332-350 (2019) - Dario Spirito:
Vector subspaces of finite fields and star operations on pseudo-valuation domains. Finite Fields Their Appl. 56: 17-30 (2019) - Zhi-Wei Sun:
On some determinants with Legendre symbol entries. Finite Fields Their Appl. 56: 285-307 (2019) - Kohei Yamada, Miwako Mishima, Junya Satoh, Masakazu Jimbo:
Multifold factorizations of cyclic groups into subsets. Finite Fields Their Appl. 56: 131-149 (2019) - Guanghui Zhang:
On the Chebotarëv theorem over finite fields. Finite Fields Their Appl. 56: 97-108 (2019) - Dabin Zheng, Mu Yuan, Long Yu:
Two types of permutation polynomials with special forms. Finite Fields Their Appl. 56: 1-16 (2019) - Haiyan Zhou, Yao Sun:
Counting points on diagonal equations over Galois rings GR(p2, p2r). Finite Fields Their Appl. 56: 266-284 (2019)
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-04 13:47 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