Péter Burcsi

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time	2026-01-08	Paper
How (not) to hash into class groups of imaginary quadratic fields?	2025-10-31	Paper
scientific article; zbMATH DE number 7814694 (Why is no real title available?)	2024-03-10	Paper
Numeration systems defined by addition rules	2023-10-17	Paper
The effect of false positives: Why fuzzy message detection leads to fuzzy privacy guarantees? Financial Cryptography and Data Security	2023-05-26	Paper
Reconstructibility of trees from subtree size frequencies	2022-07-08	Paper
A note on low order assumptions in RSA groups Sv. 25(2021)=knj. 60	2022-02-07	Paper
On the algorithmic complexity of some numeration-related problems Publicationes Mathematicae Debrecen	2021-04-16	Paper
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word Theoretical Computer Science	2020-10-12	Paper
Topological Analysis of Bitcoin’s Lightning Network Mathematical Research for Blockchain Economy	2020-06-29	Paper
Multi party computation motivated by the birthday problem Acta Cybernetica	2020-02-26	Paper
Reconstruction of trees from jumbled and weighted subtrees	2017-10-17	Paper
On prefix normal words and prefix normal forms Theoretical Computer Science	2016-12-23	Paper
scientific article; zbMATH DE number 6415710 (Why is no real title available?)	2015-03-16	Paper
The method of double chains for largest families with excluded subposets Electronic Journal of Graph Theory and Applications	2015-03-05	Paper
Analysis of the picture cube puzzle (available as arXiv preprint)	2014-12-30	Paper
On combinatorial generation of prefix normal words Combinatorial Pattern Matching	2014-06-30	Paper
scientific article; zbMATH DE number 6257992 (Why is no real title available?)	2014-02-17	Paper
On approximate jumbled pattern matching in strings Theory of Computing Systems	2012-12-06	Paper
Algorithms for jumbled pattern matching in strings International Journal of Foundations of Computer Science	2012-08-30	Paper
The commuter's paradox: why it takes longer to get home than to get to work Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica	2012-07-12	Paper
scientific article; zbMATH DE number 5990757 (Why is no real title available?)	2011-12-19	Paper

Research outcomes over time

This page was built for person: Péter Burcsi