Остановите войну!
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 31 matches
- 2006
- Angela Aguglia, Massimo Giulietti:
Blocking Sets of Certain Line Sets Related to a Conic. Des. Codes Cryptogr. 39(3): 397-405 (2006) - Hassan Aly, Arne Winterhof:
On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials. Des. Codes Cryptogr. 39(2): 155-162 (2006) - Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
On Intersection Problem for Perfect Binary Codes. Des. Codes Cryptogr. 39(3): 317-322 (2006) - Paulo S. L. M. Barreto, José Felipe Voloch:
Efficient Computation of Roots in Finite Fields. Des. Codes Cryptogr. 39(2): 275-280 (2006) - Jan De Beule, Leo Storme:
Blocking All Generators of Q+(2n + 1, 3), n ≥ 4. Des. Codes Cryptogr. 39(3): 323-333 (2006) - Gilberto Bini:
A-Codes from Rational Functions over Galois Rings. Des. Codes Cryptogr. 39(2): 207-214 (2006) - Jen-Chun Chang:
New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps. Des. Codes Cryptogr. 39(3): 335-345 (2006) - Kejun Chen, Ruizhong Wei:
Super-simple (nu, 5, 5) Designs. Des. Codes Cryptogr. 39(2): 173-187 (2006) - Mathieu Ciet, Marc Joye, Kristin E. Lauter, Peter L. Montgomery:
Trading Inversions for Multiplications in Elliptic Curve Cryptography. Des. Codes Cryptogr. 39(2): 189-206 (2006) - Antonio Cossidente, Alessandro Siciliano:
The Automorphism Group of Plane Algebraic Curves with Singer Automorphisms. Des. Codes Cryptogr. 39(1): 33-37 (2006) - Dean Crnkovic:
A Series of Regular Hadamard Matrices. Des. Codes Cryptogr. 39(2): 247-251 (2006) - M. R. Darafsheh:
Designs from the Group PSL2(q), q Even. Des. Codes Cryptogr. 39(3): 311-316 (2006) - Marten van Dijk, Dwaine E. Clarke, Blaise Gassend, G. Edward Suh, Srinivas Devadas:
Speeding up Exponentiation using an Untrusted Computational Resource. Des. Codes Cryptogr. 39(2): 253-273 (2006) - Steven T. Dougherty, San Ling:
Cyclic Codes Over Z4 of Even Length. Des. Codes Cryptogr. 39(2): 127-153 (2006) - Steven T. Dougherty, Young Ho Park:
Codes Over the p-adic Integers. Des. Codes Cryptogr. 39(1): 65-80 (2006) - Jeremy Dover:
Subregular Spreads of Hermitian Unitals. Des. Codes Cryptogr. 39(1): 5-15 (2006) - Tao Feng, Yanxun Chang:
Existence of Z-cyclic 3PTWh (p) for any Prime p congruent 1 (mod 4). Des. Codes Cryptogr. 39(1): 39-49 (2006) - Agnes D. Garciano, Yutaka Hiramine, Takeo Yokonuma:
On Relative Difference Sets in Dihedral Groups. Des. Codes Cryptogr. 39(1): 51-63 (2006) - Michael Giudici:
Codes with a Certain Weight-preserving Transitive Group of Automorphisms. Des. Codes Cryptogr. 39(2): 163-172 (2006) - Cem Güneri, Ferruh Özbudak:
Improvements on Generalized Hamming Weights of Some Trace Codes. Des. Codes Cryptogr. 39(2): 215-231 (2006) - Masaaki Homma, Seon Jeong Kim:
The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic. Des. Codes Cryptogr. 39(3): 375-386 (2006) - Mahdad Khatirinejad, Petr Lisonek:
Classification and Constructions of Complete Caps in Binary Spaces. Des. Codes Cryptogr. 39(1): 17-31 (2006) - Petr Lisonek, Mahdad Khatirinejad:
Erratum for "A Family of Complete Caps in PG(n, 2)". Des. Codes Cryptogr. 39(2): 307 (2006) - Deirdre Luyckx:
A Geometric Construction of the Hyperbolic Fibrations Associated with a Flock, q Even. Des. Codes Cryptogr. 39(2): 281-288 (2006) - Barbara Masucci:
Sharing Multiple Secrets: Models, Schemes and Analysis. Des. Codes Cryptogr. 39(1): 89-111 (2006) - Katie O'Brien, Patrick Fitzpatrick:
Bounds on Codes Derived by Counting Components in Varshamov Graphs. Des. Codes Cryptogr. 39(3): 387-396 (2006) - Gilles Piret:
Luby-Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme. Des. Codes Cryptogr. 39(2): 233-245 (2006) - Maffre Samuel:
A Weak Key Test for Braid Based Cryptography. Des. Codes Cryptogr. 39(3): 347-373 (2006) - Ron Shaw, Neil A. Gordon:
The Polynomial Degree of the GrassmannianG1, n, 2. Des. Codes Cryptogr. 39(2): 289-306 (2006) - Igor E. Shparlinski:
On RSA Moduli with Prescribed Bit Patterns. Des. Codes Cryptogr. 39(1): 113-122 (2006)
skipping 1 more match
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-26 18:35 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