activity
20102021
most citedAlgorithms for Jumbled Pattern Matching in Strings

50 citations · 86 across the 10 of their papers we have counts for

collaborators

11 papers

cs.CR2021

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

Fuzzy Message Detection (FMD) is a recent cryptographic primitive invented by Beck et al. (CCS'21) where an untrusted server performs coarse message filtering for its clients in a…

cs.DS2020★ 6 cited

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

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2

A prefix normal word is a binary word with the property that no substring has more s than the prefix of the same length. By proving that the set of prefix normal words is a bubb…

cs.CY2019

Topological Analysis of Bitcoin's Lightning Network

István András Seres, László Gulyás, Dániel A. Nagy +1

Bitcoin's Lightning Network (LN) is a scalability solution for Bitcoin allowing transactions to be issued with negligible fees and settled instantly at scale. In order to use LN, f…

cs.DM2017

On the Parikh-de-Bruijn grid

Péter Burcsi, Zsuzsanna Lipták, W. F. Smyth

We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural in…

cs.DM2016★ 19 cited

On Prefix Normal Words and Prefix Normal Forms

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2

A -prefix normal word is a binary word with the property that no factor has more s than the prefix of the same length; a -prefix normal word is defined analogously. These…

cs.FL2014★ 4 cited

Normal, Abby Normal, Prefix Normal

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary…