default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Rolland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c2]Stéphane Ballet, Robert Rolland:
Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication. CAI 2022: 3-14
2010 – 2019
- 2019
- [j8]Manfred Droste, Ilias S. Kotsireas, Robert Rolland:
Preface. Theor. Comput. Sci. 800: 1-2 (2019) - 2017
- [j7]Miriam Abdón, Robert Rolland
:
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one. Appl. Algebra Eng. Commun. Comput. 28(5): 387-408 (2017) - [j6]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm. Math. Comput. 86(308): 2975-3000 (2017) - [j5]Kevin Atighehchi, Robert Rolland:
Optimization of Tree Modes for Parallel Hash Functions: A Case Study. IEEE Trans. Computers 66(9): 1585-1598 (2017) - 2015
- [i9]Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze, Robert Rolland:
On Chudnovsky-Based Arithmetic Algorithms in Finite Fields. CoRR abs/1510.00090 (2015) - [i8]Miriam Abdón, Robert Rolland:
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one. CoRR abs/1512.04788 (2015) - [i7]Kevin Atighehchi, Robert Rolland:
Optimization of Tree Modes for Parallel Hash Functions. CoRR abs/1512.05864 (2015) - 2014
- [j4]Stéphane Ballet, Robert Rolland:
On low weight codewords of generalized affine and projective Reed-Muller codes. Des. Codes Cryptogr. 73(2): 271-297 (2014) - [e2]Traian Muntean, Robert Rolland, Léon Mugwaneza:
IEEE 13th International Symposium on Parallel and Distributed Computing, ISPDC 2014, Marseille, France, June 24-27, 2014. IEEE 2014, ISBN 978-1-4799-5918-1 [contents] - 2013
- [e1]Traian Muntean, Dimitrios Poulakis, Robert Rolland:
Algebraic Informatics - 5th International Conference, CAI 2013, Porquerolles, France, September 3-6, 2013. Proceedings. Lecture Notes in Computer Science 8080, Springer 2013, ISBN 978-3-642-40662-1 [contents] - 2012
- [i6]Dimitrios Poulakis, Robert Rolland:
A Digital Signature Scheme for Long-Term Security. CoRR abs/1203.4077 (2012) - [i5]Stéphane Ballet, Robert Rolland:
Remarks on low weight codewords of generalized affine and projective Reed-Muller codes. CoRR abs/1203.4592 (2012) - [i4]Dimitrios Poulakis, Robert Rolland:
A Digital Signature Scheme for Long-Term Security. IACR Cryptol. ePrint Arch. 2012: 134 (2012) - [i3]Alexis Bonnecaze, Robert Rolland:
Collecting Data while Preserving Individuals' Privacy: A Case Study. IACR Cryptol. ePrint Arch. 2012: 603 (2012) - 2011
- [j3]Stéphane Ballet, Robert Rolland:
A note on Yao's theorem about pseudo-random generators. Cryptogr. Commun. 3(4): 189-206 (2011) - 2010
- [j2]Robert Rolland:
The second weight of generalized Reed-Muller codes in most cases. Cryptogr. Commun. 2(1): 19-40 (2010) - [c1]Kevin Atighehchi, Traian Muntean, Sylvain Parlanti, Robert Rolland, Laurent Vallet:
A Cryptographic Keys Transfer Protocol for Secure Communicating Systems. SYNASC 2010: 339-343
2000 – 2009
- 2009
- [i2]Robert Rolland:
The second weight of generalized Reed-Muller codes. CoRR abs/0902.0058 (2009) - [i1]Stéphane Ballet, Robert Rolland:
A NOTE ON YAO'S THEOREM ABOUT PSEUDORANDOM GENERATORS. IACR Cryptol. ePrint Arch. 2009: 548 (2009)
1990 – 1999
- 1992
- [j1]Robert Rolland:
The Number of MDS[7, 3] Codes on Finite Fields of Characteristic. Appl. Algebra Eng. Commun. Comput. 3: 301-310 (1992)
Coauthor Index
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.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
