Peter Burcsi

According to our database, Peter Burcsi authored at least 22 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

How (not) to hash into class groups of imaginary quadratic fields?

István András Seres, Péter Burcsi, Péter Kutas

IACR Cryptol. ePrint Arch., 2024

2023

Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time.

István András Seres, Péter Burcsi

IACR Cryptol. ePrint Arch., 2023

2021

The Effect of False Positives: Why Fuzzy Message Detection Leads to Fuzzy Privacy Guarantees?

István András Seres, Balázs Pejó, Péter Burcsi

IACR Cryptol. ePrint Arch., 2021

The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications.

István András Seres, Máté Horváth, Péter Burcsi

IACR Cryptol. ePrint Arch., 2021

2020

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada

Theor. Comput. Sci., 2020

A Note on Low Order Assumptions in RSA groups.

István András Seres, Péter Burcsi

IACR Cryptol. ePrint Arch., 2020

2019

MixEth: efficient, trustless coin mixing service for Ethereum.

István András Seres, Dániel A. Nagy, Chris Buckland, Péter Burcsi

IACR Cryptol. ePrint Arch., 2019

Multi Party Computation Motivated by the Birthday Problem.

Péter Hudoba, Péter Burcsi

Acta Cybern., 2019

Topological Analysis of Bitcoin's Lightning Network.

István András Seres, László Gulyás, Dániel A. Nagy, Péter Burcsi

Proceedings of the 1st International Conference on Mathematical Research for Blockchain Economy, 2019

2017

On prefix normal words and prefix normal forms.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Theor. Comput. Sci., 2017

On the Parikh-de-Bruijn grid.

Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth

CoRR, 2017

2016

Reconstruction of Trees from Jumbled and Weighted Subtrees.

Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2014

Normal, Abby Normal, Prefix Normal.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

On Combinatorial Generation of Prefix Normal Words.

Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

The method of double chains for largest families with excluded subposets.

Peter Burcsi, Dániel T. Nagy

Electron. J. Graph Theory Appl., 2013

2012

On Approximate Jumbled Pattern Matching in Strings.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Theory Comput. Syst., 2012

Algorithms for Jumbled Pattern Matching in Strings.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Int. J. Found. Comput. Sci., 2012

Analysis of the picture cube puzzle

Peter Burcsi

CoRR, 2012

2010

Start-phase control of distributed systems written in Erlang/OTP

Peter Burcsi, Attila Kovács, Antal Tátrai

CoRR, 2010

On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching.

Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

Algorithmic Aspects of Generalized Number Systems

Péter Burcsi

PhD thesis, 2009

2007

On the importance of cache tuning in a cache-aware algorithm: A case study.

Peter Burcsi, Attila Kovács

Comput. Math. Appl., 2007