default search action
Luis A. Medina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]José E. Calderón-Gómez, Luis A. Medina
, Carlos A. Molina-Salazar:
Short k-rotation symmetric Boolean functions. Discret. Appl. Math. 343: 49-64 (2024) - 2022
- [j14]Luis A. Medina
Walsh-Hadamard transforms of generalized p-ary functions and C-finite sequences. Discret. Appl. Math. 315: 86-96 (2022) - 2020
- [j13]Luis A. Medina
Root-Hadamard transforms and complementary sequences. Cryptogr. Commun. 12(5): 1035-1049 (2020) - [j12]Luis A. Medina
Value distribution of elementary symmetric polynomials and its perturbations over finite fields. Finite Fields Their Appl. 63: 101632 (2020)
2010 – 2019
- 2019
- [j11]Francis N. Castro, Oscar E. González
An improvement to Chevalley's theorem with restricted variables. Finite Fields Their Appl. 58: 216-221 (2019) - [i1]Luis A. Medina, Matthew Geoffrey Parker, Constanza Riera, Pantelimon Stanica:
Root-Hadamard transforms and complementary sequences. CoRR abs/1907.09360 (2019) - 2018
- [j10]Francis N. Castro, Luis A. Medina
Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent. Appl. Algebra Eng. Commun. Comput. 29(5): 433-453 (2018) - [j9]Francis N. Castro, Luis A. Medina
Exact 2-divisibility of exponential sums associated to boolean functions. Cryptogr. Commun. 10(4): 655-666 (2018) - [j8]Rafael A. Arce-Nazario, Francis N. Castro, Oscar E. González
New families of balanced symmetric functions and a generalization of Cusick, Li and Stǎnicǎ's conjecture. Des. Codes Cryptogr. 86(3): 693-701 (2018) - [j7]Francis N. Castro, Robin Chapman, Luis A. Medina
Recursions associated to trapezoid, symmetric and rotation symmetric functions over Galois fields. Discret. Math. 341(7): 1915-1931 (2018) - [j6]Francis N. Castro, Oscar E. González
Diophantine Equations With Binomial Coefficients and Perturbations of Symmetric Boolean Functions. IEEE Trans. Inf. Theory 64(2): 1347-1360 (2018) - 2017
- [j5]Francis N. Castro, Luis A. Medina
Modular periodicity of exponential sums of symmetric Boolean functions. Discret. Appl. Math. 217: 455-473 (2017) - 2015
- [j4]Francis N. Castro, Oscar E. González
A divisibility approach to the open boundary cases of Cusick-Li-Stǎnicǎ's conjecture. Cryptogr. Commun. 7(4): 379-402 (2015) - [j3]Francis N. Castro, Oscar E. González
The p-adic Valuation of Eulerian Numbers: Trees and Bernoulli Numbers. Exp. Math. 24(2): 183-195 (2015) - 2011
- [j2]Francis N. Castro, Luis A. Medina
Linear Recurrences and Asymptotic Behavior of Exponential Sums of Symmetric Boolean Functions. Electron. J. Comb. 18(2) (2011) - 2010
- [j1]Dante V. Manna, Luis A. Medina
A fast numerical algorithm for the integration of rational functions. Numerische Mathematik 115(2): 289-307 (2010)
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-10-09 20:30 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: