Nikos Leonardos
Orcid: 0000-0003-3909-7914
According to our database1,
Nikos Leonardos
authored at least 23 papers
between 2009 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
CoRR, March, 2025
Lower Bounds for Uniform Read-Once Threshold Formulae in the Randomized Decision Tree Model.
Proceedings of the Structural Information and Communication Complexity, 2025
2024
Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024
2023
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023
2022
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
2021
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021
Proceedings of the Algorithms for Sensor Systems, 2021
2020
IACR Cryptol. ePrint Arch., 2020
2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019
Proceedings of the Algorithms for Sensor Systems, 2019
2018
Proceedings of the Public-Key Cryptography - PKC 2018, 2018
2017
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
J. Comput. Syst. Sci., 2016
2015
Proc. Priv. Enhancing Technol., 2015
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015
Proceedings of the Topics in Cryptology, 2015
2014
IACR Cryptol. ePrint Arch., 2014
Proceedings of the Structural Information and Communication Complexity, 2014
2013
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, .
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2009
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009