Остановите войну!
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 35 matches
- 2010
- Rodrigo Abarzúa, Nicolas Thériault, Roberto Avanzi, Ismael Soto, Miguel D. Alfaro:
Optimization of the arithmetic of the ideal class group for genus 4 hyperelliptic curves over projective coordinates. Adv. Math. Commun. 4(2): 115-139 (2010) - Diego F. Aranha, Ricardo Dahab, Julio César López-Hernández, Leonardo B. Oliveira:
Efficient implementation of elliptic curve cryptography in wireless sensors. Adv. Math. Commun. 4(2): 169-187 (2010) - Roberto Avanzi, Michael J. Jacobson Jr., Renate Scheidler:
Efficient reduction of large divisors on hyperelliptic curves. Adv. Math. Commun. 4(2): 261-279 (2010) - Roberto Avanzi, Nicolas Thériault:
A filtering method for the hyperelliptic curve index calculus and its analysis. Adv. Math. Commun. 4(2): 189-213 (2010) - Christine Bachoc, Gilles Zémor:
Bounds for binary codes relative to pseudo-distances of k points. Adv. Math. Commun. 4(4): 547-565 (2010) - Tsonka Stefanova Baicheva, Iliya Bouyukliev:
On the least covering radius of binary linear codes of dimension 6. Adv. Math. Commun. 4(3): 399-404 (2010) - Peter Beelen, Kristian Brander:
Efficient list decoding of a class of algebraic-geometry codes. Adv. Math. Commun. 4(4): 485-518 (2010) - Jean-François Biasse:
Improvements in the computation of ideal class groups of imaginary quadratic number fields. Adv. Math. Commun. 4(2): 141-154 (2010) - Peter Birkner, Nicolas Thériault:
Efficient halving for genus 3 curves over binary fields. Adv. Math. Commun. 4(1): 23-47 (2010) - Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
On q-ary linear completely regular codes with ρ=2 and antipodal dual. Adv. Math. Commun. 4(4): 567-578 (2010) - Stefka Bouyuklieva, Iliya Bouyukliev:
Classification of the extremal formally self-dual even codes of length 30. Adv. Math. Commun. 4(3): 433-439 (2010) - Richard A. Brualdi, Kathleen Kiernan, Seth A. Meyer, Michael W. Schroeder:
Combinatorial batch codes and transversal matroids. Adv. Math. Commun. 4(3): 419-431 (2010) - Richard A. Brualdi, Kathleen Kiernan, Seth A. Meyer, Michael W. Schroeder:
Erratum. Adv. Math. Commun. 4(4): 597 (2010) - Jean Creignou, Hervé Diet:
Linear programming bounds for unitary codes. Adv. Math. Commun. 4(3): 323-344 (2010) - Konstantinos Drakakis:
On the generalization of the Costas property in higher dimensions. Adv. Math. Commun. 4(1): 1-22 (2010) - Gerhard Frey:
Relations between arithmetic geometry and public key cryptography. Adv. Math. Commun. 4(2): 281-305 (2010) - David Galindo, Javier Herranz, Eike Kiltz:
On the generic construction of identity-based signatures with additional properties. Adv. Math. Commun. 4(4): 453-483 (2010) - Heide Gluesing-Luerssen, Uwe Helmke, José Ignacio Iglesias Curto:
Algebraic decoding for doubly cyclic convolutional codes. Adv. Math. Commun. 4(1): 83-99 (2010) - Olof Heden, Martin Hessler:
On linear equivalence and Phelps codes. Adv. Math. Commun. 4(1): 69-81 (2010) - Fernando Hernando, Diego Ruano:
New linear codes from matrix-product codes with polynomial units. Adv. Math. Commun. 4(3): 363-367 (2010) - Laurent Imbert, Michael J. Jacobson Jr., Arthur Schmidt:
Fast ideal cubing in imaginary quadratic number and function fields. Adv. Math. Commun. 4(2): 237-260 (2010) - Ji-Woong Jang, Young-Sik Kim, Sang-Hyo Kim, Dae-Woon Lim:
New construction methods of quaternary periodic complementary sequence sets. Adv. Math. Commun. 4(1): 61-68 (2010) - Koray Karabina, Berkant Ustaoglu:
Invalid-curve attacks on (hyper)elliptic curve cryptosystems. Adv. Math. Commun. 4(3): 307-321 (2010) - Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. Adv. Math. Commun. 4(3): 345-361 (2010) - Annika Meyer:
On dual extremal maximal self-orthogonal codes of Type I-IV. Adv. Math. Commun. 4(4): 579-596 (2010) - Josep M. Miret, Jordi Pujolàs, Anna Rio:
Explicit 2-power torsion of genus 2 curves over finite fields. Adv. Math. Commun. 4(2): 155-168 (2010) - Diego Napp, Carmen Perea, Raquel Pinto:
Input-state-output representations and constructions of finite support 2D convolutional codes. Adv. Math. Commun. 4(4): 533-545 (2010) - Alina Ostafe, Igor E. Shparlinski, Arne Winterhof:
On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences. Adv. Math. Commun. 4(3): 369-379 (2010) - Amin Sakzad, Mohammad-Reza Sadeghi:
On cycle-free lattices with high rate label codes. Adv. Math. Commun. 4(4): 441-452 (2010) - Santanu Sarkar, Subhamoy Maitra:
Some applications of lattice based root finding techniques. Adv. Math. Commun. 4(4): 519-531 (2010)
skipping 5 more matches
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 22:40 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