Nikos Leonardos

Orcid: 0000-0003-3909-7914

According to our database1, Nikos Leonardos authored at least 23 papers between 2009 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Approximation Schemes for k-Subset Sum Ratio and Multiway Number Partitioning Ratio.
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
Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022
Minotaur: Multi-Resource Blockchain Consensus.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Mining in Logarithmic Space.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation.
Proceedings of the Algorithms for Sensor Systems, 2021

2020
Full Analysis of Nakamoto Consensus in Bounded-Delay Networks.
IACR Cryptol. ePrint Arch., 2020

2019
Compact Storage of Superblocks for NIPoPoW Applications.
IACR Cryptol. ePrint Arch., 2019

Oceanic Games: Centralization Risks and Incentives in Blockchain Mining.
Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

Optimal Circle Search Despite the Presence of Faulty Robots.
Proceedings of the Algorithms for Sensor Systems, 2019

2018
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017
The Bitcoin Backbone Protocol with Chains of Variable Difficulty.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Hellinger volume and number-on-the-forehead communication complexity.
J. Comput. Syst. Sci., 2016

Bootstrapping the Blockchain - Directly.
IACR Cryptol. ePrint Arch., 2016

Stable Matching with Evolving Preferences.
Proceedings of the Approximation, 2016

2015
Optimal Rate Private Information Retrieval from Homomorphic Encryption.
Proc. Priv. Enhancing Technol., 2015

The Bitcoin Backbone Protocol: Analysis and Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

Communication Optimal Tardos-Based Asymmetric Fingerprinting.
Proceedings of the Topics in Cryptology, 2015

2014
Near Optimal Rate Homomorphic Encryption for Branching Programs.
IACR Cryptol. ePrint Arch., 2014

Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host.
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
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009


  Loading...