Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Evolutionary Construction of Perfectly Balanced Boolean Functions
Luca Mariot, Stjepan Picek, Domagoj Jakobović, et al.
2022 IEEE Congress on Evolutionary Computation (CEC) (2022), pp. 1-8
Open Access | Times Cited: 15

Showing 15 citing articles:

Weightwise (Almost) Perfectly Balanced Functions Based on Total Orders
Pierrick Méaux
Lecture notes in computer science (2025), pp. 112-138
Closed Access
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
Marko Djurasevic, Domagoj Jakobović, Luca Mariot, et al.
Cryptography and Communications (2023) Vol. 15, Iss. 6, pp. 1171-1197
Open Access | Times Cited: 10
Weightwise Perfectly Balanced Functions and Nonlinearity
Agnese Gini, Pierrick Méaux
Lecture notes in computer science (2023), pp. 338-359
Closed Access | Times Cited: 9
On the weightwise nonlinearity of weightwise perfectly balanced functions
Agnese Gini, Pierrick Méaux
Discrete Applied Mathematics (2022) Vol. 322, pp. 320-341
Closed Access | Times Cited: 13
Weightwise Almost Perfectly Balanced Functions: Secondary Constructions for All n and Better Weightwise Nonlinearities
Agnese Gini, Pierrick Méaux
Lecture notes in computer science (2022), pp. 492-514
Closed Access | Times Cited: 8
On the Algebraic Immunity of Weightwise Perfectly Balanced Functions
Agnese Gini, Pierrick Méaux
Lecture notes in computer science (2023), pp. 3-23
Closed Access | Times Cited: 4
Studying Special Operators for the Application of Evolutionary Algorithms in the Seek of Optimal Boolean Functions for Cryptography
Sara Mandujano, Juan Carlos Ku-Cauich, Adriana Lara
Lecture notes in computer science (2022), pp. 383-396
Closed Access | Times Cited: 6
Evolution of Walsh Transforms with Genetic Programming
Luigi Rovito, Andrea De Lorenzo, Luca Manzoni
(2023), pp. 2386-2389
Closed Access | Times Cited: 2
Using Evolutionary Algorithms for the Search of 16-Variable Weight-Wise Perfectly Balanced Boolean Functions with High Non-linearity
Sara Mandujano, Adriana Lara, Juan Carlos Ku-Cauich
Lecture notes in computer science (2024), pp. 416-428
Closed Access
$$\mathcal {S}_0$$-equivalence classes, a new direction to find better weightwise perfectly balanced functions, and more
Agnese Gini, Pierrick Méaux
Cryptography and Communications (2024)
Closed Access
Constructing WAPB Boolean Functions From the Direct Sum of WAPB Boolean Functions
Deepak Kumar Dalai, Krishna Mallick
Lecture notes in computer science (2024), pp. 188-209
Closed Access
Progress in Cryptology – LATINCRYPT 2023

Lecture notes in computer science (2023)
Closed Access | Times Cited: 1
Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming
Luigi Rovito, Andrea De Lorenzo, Luca Manzoni
Algorithms (2023) Vol. 16, Iss. 11, pp. 499-499
Open Access | Times Cited: 1
Progress in Cryptology – INDOCRYPT 2022
Takanori Isobe, Santanu Sarkar
Lecture notes in computer science (2022)
Closed Access | Times Cited: 2
S0-equivalent classes, a new direction to find better weightwise perfectly balanced functions, and more
Agnese Gini, Pierrick Méaux
Research Square (Research Square) (2023)
Open Access
Semantic mutation operator for a fast and efficient design of bent Boolean functions
Jakub Husa, Lukáš Sekanina
Genetic Programming and Evolvable Machines (2023) Vol. 25, Iss. 1
Closed Access
Page 1

Scroll to top