default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Burcsi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]István András Seres, Péter Burcsi, Péter Kutas:
How (not) to hash into class groups of imaginary quadratic fields? IACR Cryptol. ePrint Arch. 2024: 34 (2024)- 2023
- [i15]István András Seres, Péter Burcsi:
Behemoth: transparent polynomial commitment scheme with constant opening proof size and verifier time. IACR Cryptol. ePrint Arch. 2023: 670 (2023) - 2022
- [c7]István András Seres, Balázs Pejó, Péter Burcsi:
The Effect of False Positives: Why Fuzzy Message Detection Leads to Fuzzy Privacy Guarantees? Financial Cryptography 2022: 123-148 - 2021
- [i14]István András Seres, Balázs Pejó, Péter Burcsi:
The Effect of False Positives: Why Fuzzy Message Detection Leads to Fuzzy Privacy Guarantees? CoRR abs/2109.06576 (2021) - [i13]István András Seres, Máté Horváth, Péter Burcsi:
The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications. IACR Cryptol. ePrint Arch. 2021: 182 (2021) - [i12]István András Seres, Balázs Pejó, Péter Burcsi:
The Effect of False Positives: Why Fuzzy Message Detection Leads to Fuzzy Privacy Guarantees? IACR Cryptol. ePrint Arch. 2021: 1180 (2021) - 2020
- [j7]Péter Burcsi, Gabriele Fici
, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - [i11]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR abs/2003.03222 (2020) - [i10]István András Seres, Péter Burcsi:
A Note on Low Order Assumptions in RSA groups. IACR Cryptol. ePrint Arch. 2020: 402 (2020)
2010 – 2019
- 2019
- [j6]Péter Hudoba, Péter Burcsi:
Multi Party Computation Motivated by the Birthday Problem. Acta Cybern. 24(1): 29-41 (2019) - [c6]István András Seres, László Gulyás, Dániel A. Nagy, Péter Burcsi:
Topological Analysis of Bitcoin's Lightning Network. MARBLE 2019: 1-12 - [c5]István András Seres, Dániel A. Nagy, Chris Buckland, Péter Burcsi:
MixEth: Efficient, Trustless Coin Mixing Service for Ethereum. Tokenomics 2019: 13:1-13:20 - [i9]István András Seres, László Gulyás, Dániel A. Nagy, Péter Burcsi:
Topological Analysis of Bitcoin's Lightning Network. CoRR abs/1901.04972 (2019) - [i8]István András Seres, Dániel A. Nagy, Chris Buckland, Péter Burcsi:
MixEth: efficient, trustless coin mixing service for Ethereum. IACR Cryptol. ePrint Arch. 2019: 341 (2019) - 2017
- [j5]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - [i7]Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth:
On the Parikh-de-Bruijn grid. CoRR abs/1711.06264 (2017) - 2016
- [c4]Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták:
Reconstruction of Trees from Jumbled and Weighted Subtrees. CPM 2016: 10:1-10:13 - [i6]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2014
- [c3]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c2]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [i5]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i4]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - 2013
- [j4]Peter Burcsi, Dániel T. Nagy:
The method of double chains for largest families with excluded subposets. Electron. J. Graph Theory Appl. 1(1): 40-49 (2013) - 2012
- [j3]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23(2): 357-374 (2012) - [j2]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50(1): 35-51 (2012) - [i3]Peter Burcsi:
Analysis of the picture cube puzzle. CoRR abs/1207.6383 (2012) - 2011
- [i2]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. CoRR abs/1102.1746 (2011) - 2010
- [c1]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. FUN 2010: 89-101 - [i1]Peter Burcsi, Attila Kovács, Antal Tátrai:
Start-phase control of distributed systems written in Erlang/OTP. CoRR abs/1003.1395 (2010)
2000 – 2009
- 2009
- [b1]Péter Burcsi:
Algorithmic Aspects of Generalized Number Systems. Eötvös Loránd University, Hungary, 2009 - 2007
- [j1]Peter Burcsi, Attila Kovács:
On the importance of cache tuning in a cache-aware algorithm: A case study. Comput. Math. Appl. 53(6): 880-885 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
