Péter Burcsi
Péter Burcsi
Verified email at inf.elte.hu
Title
Cited by
Cited by
Year
Algorithms for jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
International Journal of Foundations of Computer Science 23 (02), 357-374, 2012
762012
On approximate jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
Theory of Computing Systems 50 (1), 35-51, 2012
482012
On table arrangements, scrabble freaks, and jumbled pattern matching
P Burcsi, F Cicalese, G Fici, Z Lipták
International Conference on Fun with Algorithms, 89-101, 2010
422010
Topological analysis of bitcoin’s lightning network
IA Seres, L Gulyás, DA Nagy, P Burcsi
Mathematical Research for Blockchain Economy, 1-12, 2020
332020
The method of double chains for largest families with excluded subposets
P Burcsi, DT Nagy
arXiv preprint arXiv:1204.5355, 2012
282012
Exhaustive search methods for CNS polynomials
P Burcsi, A Kovács
Monatshefte für Mathematik 155 (3-4), 421, 2008
212008
Decision and classification algorithms for generalized number systems
P Burcsi, A Kovács, Z Papp-Varga
Ann. Univ. Sci. Budapest. Sect. Comput 28, 141-156, 2008
162008
On prefix normal words and prefix normal forms
P Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada
Theoretical Computer Science 659, 1-13, 2017
152017
On combinatorial generation of prefix normal words
P Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada
Symposium on Combinatorial Pattern Matching, 60-69, 2014
132014
Normal, abby normal, prefix normal
P Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada
International Conference on Fun with Algorithms, 74-88, 2014
82014
An algorithm checking a necessary condition of number system constructions
P Burcsi, A Kovács
Ann. Univ. Sci. Budapest. Sect. Comput 25, 143-152, 2005
82005
Mixeth: efficient, trustless coin mixing service for ethereum
IA Seres, DA Nagy, C Buckland, P Burcsi
International Conference on Blockchain Economics, Security and Protocols …, 2019
62019
Computational investigation of Lehmer’s totient problem
P Burcsi, S Czirbusz, G Farkas
Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput 35, 43-49, 2011
62011
Algorithmic aspects of generalized number systems
P Burcsi
PhD Thesis School of Informatics, Eotvos Loránd University, Department of …, 2008
42008
Reconstructibility of trees from subtree size frequencies
D Bartha, P Burcsi
Stud. Univ. Babeş-Bolyai Math 59, 435-442, 2014
32014
On the importance of cache tuning in a cache-aware algorithm: A case study
P Burcsi, A Kovács
Computers & Mathematics with Applications 53 (6), 880-885, 2007
32007
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
P Burcsi, G Fici, Z Lipták, R Raman, J Sawada
arXiv preprint arXiv:2003.03222, 2020
22020
A P2P based storage system with reputation points and simulation results
B Bakondi, P Burcsi, P Györgyi, D Herskovics, P Ligeti, L Mérai, DA Nagy, ...
Central European Conference on Cryptology (CECC), 2014
22014
A Note on Low Order Assumptions in RSA groups.
IA Seres, P Burcsi
IACR Cryptol. ePrint Arch. 2020, 402, 2020
12020
Reconstruction of trees from jumbled and weighted subtrees
D Bartha, P Burcsi, Z Lipták
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
12016
The system can't perform the operation now. Try again later.
Articles 1–20