|
|
Personal data sheet |
Print preview personal data approved: 2023. V. 15. Publications |
2021
from data base, 2023. V. 15. |
Seres István András, Burcsi Péter: A Note on Low Order Assumptions in RSA groups, RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI 25: (546) pp. 15-31. type of document: Journal paper/Article language: English URL |
2021
from data base, 2023. V. 15. |
István András Seres, Máté Horváth, Péter Burcsi: The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications, type of document: number of independent citations: 1 language: English
|
2020
from data base, 2023. V. 15. |
P Burcsi, G Fici, Z Lipták, R Raman, J Sawad: Generating a Gray code for prefix normal words in amortized polylogarithmic time per word, THEORETICAL COMPUTER SCIENCE 842: pp. 86-99. type of document: Journal paper/Article number of independent citations: 1 language: English URL |
2020
from data base, 2023. V. 15. |
Seres István András, Gulyás László, Nagy Dániel A., Burcsi Péter: Topological Analysis of Bitcoin’s Lightning Network, In: Pardalos, Panos; Kotsireas, Ilias; Guo, Yike; Knottenbelt, William (szerk.) Mathematical Research for Blockchain Economy, Springer-Verlag (2020) pp. 1-12. type of document: Part of book/Proceedings Paper number of independent citations: 27 language: English URL |
2019
from data base, 2023. V. 15. |
István András Seres, Dániel A. Nagy, Chris Buckland, Péter Burcsi: MixEth, In: Danos, Vincent; Herlihy, Maurice; Potop-Butucaru, Maria; Prat, Julien; Tucci-Piergiovanni, Sara (szerk.) International Conference on Blockchain Economics, Security and Protocols, Schloss Dagstuhl Leibniz-Zentrum für Informatik (2019) 13 type of document: Part of book/Proceedings Paper number of independent citations: 10 language: English
|
2017
from data base, 2023. V. 15. |
Burcsi P, Fici G, Liptak Z, Ruskey F, Sawada J: On prefix normal words and prefix normal forms, THEORETICAL COMPUTER SCIENCE 659: pp. 1-13. type of document: Journal paper/Article number of independent citations: 7 language: English URL |
2016
from data base, 2023. V. 15. |
Burcsi Péter, Bartha Dénes, Lipták Zsuzsanna: Reconstruction of Trees from Jumbled and Weighted Subtrees, In: Roberto, Grossi; Moshe, Lewenstein (szerk.) 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Schloss Dagstuhl Leibniz-Zentrum für Informatik (2016) p. 1. type of document: Part of book/Proceedings Paper language: English URL |
2013
from data base, 2018. V. 17. |
Peter Burcsi, Daniel T Nagy: The method of double chains for largest families with excluded subposets, ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS 1: (1) pp. 40-49. type of document: Journal paper/Article number of independent citations: 2 language: English URL |
2012
from data base, 2018. V. 17. |
Burcsi P, Cicalese F, Fici G, Liptak Zs: On Approximate Jumbled Pattern Matching in Strings, THEORY OF COMPUTING SYSTEMS 50: (1) pp. 35-51. type of document: Journal paper/Article number of independent citations: 13 language: English DOI |
2010
from data base, 2018. V. 17. |
Burcsi Péter, Cicalese Ferdinando, Fici Gabriele, Lipták Zsuzsanna: On table arrangements, scrabble freaks, and jumbled pattern matching, In: Szerk.: Boldi Paolo, Szerk.: Gargano Luisa Lecture Notes in Computer Science: Fun with Algorithms, 5th International Conferenc. Berlin; Heidelberg: Springer-Verlag, 2010. pp. 89-101. (LECTURE NOTES IN COMPUTER SCIENCE; 6099.) IX, Fun with Algorithms type of document: Part of book/Proceedings Paper number of independent citations: 8 language: English DOI |
| Number of independent citations to these publications: | 69 |
|
|
|
|
|