default search action
Nikos Leonardos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Juan A. Garay
, Aggelos Kiayias
The Bitcoin Backbone Protocol: Analysis and Applications. J. ACM 71(4): 25:1-25:49 (2024) - [c15]Aggelos Kiayias, Nikos Leonardos, Yu Shen
Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions. EUROCRYPT (3) 2024: 34-63 - 2023
- [j6]Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Optimal circle search despite the presence of faulty robots. Inf. Process. Lett. 182: 106391 (2023) - [j5]Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Byzantine fault tolerant symmetric-persistent circle evacuation. Theor. Comput. Sci. 956: 113839 (2023) - [c14]Pourandokht Behrouz, Orestis Konstantinidis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou, Marianna Spyrakou:
Byzantine Fault-Tolerant Protocols for (n, f)-Evacuation from a Circle. ALGOWIN 2023: 87-100 - [i16]Aggelos Kiayias, Nikos Leonardos, Yu Shen:
Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions. IACR Cryptol. ePrint Arch. 2023: 1253 (2023) - 2022
- [c13]Matthias Fitzi, Xuechao Wang
Minotaur: Multi-Resource Blockchain Consensus. CCS 2022: 1095-1108 - [i15]Matthias Fitzi, Xuechao Wang, Sreeram Kannan, Aggelos Kiayias, Nikos Leonardos, Pramod Viswanath, Gerui Wang:
Minotaur: Multi-Resource Blockchain Consensus. CoRR abs/2201.11780 (2022) - [i14]Nikos Leonardos:
Lower bounds for uniform read-once threshold formulae in the randomized decision tree model. CoRR abs/2203.17168 (2022) - [i13]Matthias Fitzi, Xuechao Wang, Sreeram Kannan, Aggelos Kiayias, Nikos Leonardos, Pramod Viswanath, Gerui Wang:
Minotaur: Multi-Resource Blockchain Consensus. IACR Cryptol. ePrint Arch. 2022: 104 (2022) - 2021
- [c12]Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation. ALGOSENSORS 2021: 111-123 - [c11]Aggelos Kiayias, Nikos Leonardos, Dionysis Zindros:
Mining in Logarithmic Space. CCS 2021: 3487-3501 - [i12]Aggelos Kiayias, Nikos Leonardos, Dionysis Zindros:
Mining in Logarithmic Space. IACR Cryptol. ePrint Arch. 2021: 623 (2021) - 2020
- [i11]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
Full Analysis of Nakamoto Consensus in Bounded-Delay Networks. IACR Cryptol. ePrint Arch. 2020: 277 (2020)
2010 – 2019
- 2019
- [c10]Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou:
Optimal Circle Search Despite the Presence of Faulty Robots. ALGOSENSORS 2019: 192-205 - [c9]Nikos Leonardos, Stefanos Leonardos
Oceanic Games: Centralization Risks and Incentives in Blockchain Mining. MARBLE 2019: 183-199 - [i10]Nikos Leonardos, Stefanos Leonardos, Georgios Piliouras:
Oceanic Games: Centralization Risks and Incentives in Blockchain Mining. CoRR abs/1904.02368 (2019) - [i9]Kostis Karantias, Aggelos Kiayias, Nikos Leonardos, Dionysis Zindros:
Compact Storage of Superblocks for NIPoPoW Applications. IACR Cryptol. ePrint Arch. 2019: 1444 (2019) - 2018
- [c8]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos:
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. Public Key Cryptography (2) 2018: 465-495 - 2017
- [c7]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. CRYPTO (1) 2017: 291-323 - 2016
- [j4]Troy Lee, Nikos Leonardos, Michael E. Saks, Fengming Wang:
Hellinger volume and number-on-the-forehead communication complexity. J. Comput. Syst. Sci. 82(6): 1064-1074 (2016) - [c6]Varun Kanade
Stable Matching with Evolving Preferences. APPROX-RANDOM 2016: 36:1-36:13 - [i8]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos:
Bootstrapping the Blockchain - Directly. IACR Cryptol. ePrint Arch. 2016: 991 (2016) - [i7]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. IACR Cryptol. ePrint Arch. 2016: 1048 (2016) - 2015
- [j3]Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Optimal Rate Private Information Retrieval from Homomorphic Encryption. Proc. Priv. Enhancing Technol. 2015(2): 222-243 (2015) - [j2]Evangelos Bampas
Improved periodic data retrieval in asynchronous rings with a faulty host. Theor. Comput. Sci. 608: 231-254 (2015) - [c5]Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa
Communication Optimal Tardos-Based Asymmetric Fingerprinting. CT-RSA 2015: 469-486 - [c4]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. EUROCRYPT (2) 2015: 281-310 - [i6]Varun Kanade, Nikos Leonardos, Frédéric Magniez:
Stable Matching with Evolving Preferences. CoRR abs/1509.01988 (2015) - 2014
- [c3]Evangelos Bampas, Nikos Leonardos, Euripides Markou, Aris Pagourtzis
Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host. SIROCCO 2014: 355-370 - [i5]Troy Lee, Nikos Leonardos, Michael E. Saks, Fengming Wang:
Hellinger volume and number-on-the-forehead communication complexity. CoRR abs/1407.5425 (2014) - [i4]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. IACR Cryptol. ePrint Arch. 2014: 765 (2014) - [i3]Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Near Optimal Rate Homomorphic Encryption for Branching Programs. IACR Cryptol. ePrint Arch. 2014: 851 (2014) - 2013
- [c2]Nikos Leonardos:
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, . ICALP (1) 2013: 696-708 - 2012
- [i2]Nikos Leonardos:
An improved lower bound for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [j1]Nikos Leonardos, Michael E. Saks:
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Comput. Complex. 19(2): 153-181 (2010)
2000 – 2009
- 2009
- [c1]Nikos Leonardos, Michael E. Saks:
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. CCC 2009: 341-350 - [i1]Nikos Leonardos, Michael E. Saks:
Lower bounds on the randomized communication complexity of read-once functions. Electron. Colloquium Comput. Complex. TR09 (2009)
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-09-10 01:15 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: