![](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
- 2013
- Carmen Amarra, Michael Giudici
, Cheryl E. Praeger
:
Symmetric diameter two graphs with affine-type vertex-quasiprimitive automorphism group. Des. Codes Cryptogr. 68(1-3): 127-139 (2013) - Anton Betten
, Eun Ju Cheon, Seon Jeong Kim, Tatsuya Maruta:
Three families of multiple blocking sets in Desarguesian projective planes of even order. Des. Codes Cryptogr. 68(1-3): 49-59 (2013) - Linda Beukemann, Klaus Metsch:
Small tight sets of hyperbolic quadrics. Des. Codes Cryptogr. 68(1-3): 11-24 (2013) - Jan De Beule:
On large maximal partial ovoids of the parabolic quadric Q(4, q). Des. Codes Cryptogr. 68(1-3): 3-10 (2013) - Bart De Bruyn:
The pseudo-hyperplanes and homogeneous pseudo-embeddings of the generalized quadrangles of order (3, t). Des. Codes Cryptogr. 68(1-3): 259-284 (2013) - Marco Buratti, Anita Pasotti
, Dianhua Wu:
On optimal (v, 5, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 68(1-3): 349-371 (2013) - Ilaria Cardinali
, Antonio Pasini:
On certain forms and quadrics related to symplectic dual polar spaces in characteristic 2. Des. Codes Cryptogr. 68(1-3): 229-258 (2013) - Yu Qing Chen, Tao Feng
:
Abelian and non-abelian Paley type group schemes. Des. Codes Cryptogr. 68(1-3): 141-154 (2013) - Kris Coolsaet:
On the classification of nonsingular 2×2×2×2 hypercubes. Des. Codes Cryptogr. 68(1-3): 179-194 (2013) - Peter Dankelmann
, Jennifer D. Key, Bernardo Gabriel Rodrigues:
Codes from incidence matrices of graphs. Des. Codes Cryptogr. 68(1-3): 373-393 (2013) - Ulrich Dempwolff:
More translation planes and semifields from Dembowski-Ostrom polynomials. Des. Codes Cryptogr. 68(1-3): 81-103 (2013) - Thomas Feulner, Lin Sok, Patrick Solé, Alfred Wassermann:
Towards the classification of self-dual bent functions in eight variables. Des. Codes Cryptogr. 68(1-3): 395-406 (2013) - Dina Ghinelli, James W. P. Hirschfeld, Dieter Jungnickel, Joseph A. Thas:
Editorial: Finite geometries. Des. Codes Cryptogr. 68(1-3): 1-2 (2013) - Massimo Giulietti
, Gábor Korchmáros
:
Arcs in AG(2, q) determining few directions. Des. Codes Cryptogr. 68(1-3): 61-72 (2013) - Massimo Giulietti
, Gábor Korchmáros
, Stefano Marcugini, Fernanda Pambianco:
Transitive A 6-invariant k-arcs in PG(2, q). Des. Codes Cryptogr. 68(1-3): 73-79 (2013) - David G. Glynn
:
Permanent formulae from the Veronesean. Des. Codes Cryptogr. 68(1-3): 39-47 (2013) - David G. Glynn
:
Nonfactorizable nonsingular hypercubes. Des. Codes Cryptogr. 68(1-3): 195-203 (2013) - Thomas Honold, Michael Kiermaier:
The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic. Des. Codes Cryptogr. 68(1-3): 105-126 (2013) - Dieter Jungnickel, Vladimir D. Tonchev
:
New invariants for incidence structures. Des. Codes Cryptogr. 68(1-3): 163-177 (2013) - Anna Kasikova, Hendrik Van Maldeghem:
Vertex opposition in spherical buildings. Des. Codes Cryptogr. 68(1-3): 285-318 (2013) - Michel Lavrauw
:
Finite semifields and nonsingular tensors. Des. Codes Cryptogr. 68(1-3): 205-227 (2013) - Tatsuya Maruta, Yusuke Oya:
On the minimum length of ternary linear codes. Des. Codes Cryptogr. 68(1-3): 407-425 (2013) - Valentina Pepe, Hendrik Van Maldeghem:
Lax embeddings of the Hermitian unital. Des. Codes Cryptogr. 68(1-3): 325-347 (2013) - John B. Polhill, James A. Davis, Ken Smith:
A new product construction for partial difference sets. Des. Codes Cryptogr. 68(1-3): 155-161 (2013) - Morgan Rodgers
:
Cameron-Liebler line classes. Des. Codes Cryptogr. 68(1-3): 33-37 (2013) - Péter Sziklai, Geertrui Van de Voorde:
A small minimal blocking set in PG(n, pt), spanning a (t-1)-space, is linear. Des. Codes Cryptogr. 68(1-3): 25-32 (2013) - Koen Thas:
Local half Moufang quadrangles. Des. Codes Cryptogr. 68(1-3): 319-324 (2013)
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-07-08 01:33 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