Login
 Forum


 Doctoral program 

 Theses defended 

 Naturalized degrees 

 Habilitation presentations 

 Documents (all in Hung.) 

 Contacts 
 
 
Personal data sheet
 Print preview
personal data approved: 2023. V. 15.
Personal data
name Péter Burcsi
name of institution
doctoral school
ELTE Doctoral School of Informatics (Supervisor)
the share of work in the different doctoral schools. ELTE Doctoral School of Informatics 100%
Contact details
E-mail address bupecompalg.inf.elte.hu
phone number +36 1 372-2500/8448
own web page
Academic title
scientific degree, title Ph.D.
year degree was obtained 2009
discipline to which degree belongs computer sciences
institution granting the degree Eötvös Loránd University
Employment
2005 - Eötvös Loránd University, Budapest
university professor or researcher
Thesis topic supervisor
number of doctoral students supervised until now 0
number of students who fulfilled course requirements 0
students who obtained their degrees:
István András Seres PhD 2024  IDI2-ELTE
Dénes Bartha PhD 2022  IDI2-ELTE
Marcell János Uray PhD 2022  IDI2-ELTE
completed course requirement:
Attila Réti (PhD) 2022/08  IDI2-ELTE
Dávid Bóka (PhD) 2017/08  IDI2-ELTE
Dénes Bartha (PhD) 2017/08  IDI2-ELTE
István András Seres (PhD) 2022/08  IDI2-ELTE
Marcell János Uray (PhD) 2020/08  IDI2-ELTE
Péter Hudoba (PhD) 2018/08  IDI2-ELTE
present PhD students:
Shaymaa Abdulhussein Shnain (PhD) (2026/08)  IDI2-ELTE
  Thesis topic proposals
Research
research area Computational number theory, combinatorics on words
research field in which current research is conducted computer sciences
mathematics and computing
Publications
2021

 Seres István András, Burcsi Péter: A Note on Low Order Assumptions in RSA groups, RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI 25: (546) pp. 15-31.
type of document: Journal paper/Article
language: English
URL 
2021

 István András Seres, Máté Horváth, Péter Burcsi: The Legendre Pseudorandom Function as a Multivariate Quadratic Cryptosystem: Security and Applications,
type of document:
number of independent citations: 1
language: English
2020

 P Burcsi, G Fici, Z Lipták, R Raman, J Sawad: Generating a Gray code for prefix normal words in amortized polylogarithmic time per word, THEORETICAL COMPUTER SCIENCE 842: pp. 86-99.
type of document: Journal paper/Article
number of independent citations: 1
language: English
URL 
2020

 Seres István András, Gulyás László, Nagy Dániel A., Burcsi Péter: Topological Analysis of Bitcoin’s Lightning Network, In: Pardalos, Panos; Kotsireas, Ilias; Guo, Yike; Knottenbelt, William (szerk.) Mathematical Research for Blockchain Economy, Springer-Verlag (2020) pp. 1-12.
type of document: Part of book/Proceedings Paper
number of independent citations: 27
language: English
URL 
2019

 István András Seres, Dániel A. Nagy, Chris Buckland, Péter Burcsi: MixEth, In: Danos, Vincent; Herlihy, Maurice; Potop-Butucaru, Maria; Prat, Julien; Tucci-Piergiovanni, Sara (szerk.) International Conference on Blockchain Economics, Security and Protocols, Schloss Dagstuhl Leibniz-Zentrum für Informatik (2019) 13
type of document: Part of book/Proceedings Paper
number of independent citations: 10
language: English
2017

 Burcsi P, Fici G, Liptak Z, Ruskey F, Sawada J: On prefix normal words and prefix normal forms, THEORETICAL COMPUTER SCIENCE 659: pp. 1-13.
type of document: Journal paper/Article
number of independent citations: 7
language: English
URL 
2016

 Burcsi Péter, Bartha Dénes, Lipták Zsuzsanna: Reconstruction of Trees from Jumbled and Weighted Subtrees, In: Roberto, Grossi; Moshe, Lewenstein (szerk.) 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), Schloss Dagstuhl Leibniz-Zentrum für Informatik (2016) p. 1.
type of document: Part of book/Proceedings Paper
language: English
URL 
2013

 Peter Burcsi, Daniel T Nagy: The method of double chains for largest families with excluded subposets, ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS 1: (1) pp. 40-49.
type of document: Journal paper/Article
number of independent citations: 2
language: English
URL 
2012

 Burcsi P, Cicalese F, Fici G, Liptak Zs: On Approximate Jumbled Pattern Matching in Strings, THEORY OF COMPUTING SYSTEMS 50: (1) pp. 35-51.
type of document: Journal paper/Article
number of independent citations: 13
language: English
DOI 
2010

 Burcsi Péter, Cicalese Ferdinando, Fici Gabriele, Lipták Zsuzsanna: On table arrangements, scrabble freaks, and jumbled pattern matching, In: Szerk.: Boldi Paolo, Szerk.: Gargano Luisa Lecture Notes in Computer Science: Fun with Algorithms, 5th International Conferenc. Berlin; Heidelberg: Springer-Verlag, 2010. pp. 89-101. (LECTURE NOTES IN COMPUTER SCIENCE; 6099.)
IX, Fun with Algorithms
type of document: Part of book/Proceedings Paper
number of independent citations: 8
language: English
DOI 
Number of independent citations to these publications:69 
Scientometric data
list of publications and citations
number of scientific publications that meet accreditation criteria:
41
number of scientific publications:
42
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
0 
scientific publications published abroad that meet the accreditation criteria:
22
publications not in Hungarian, published in Hungary, meeting the accreditation criteria:
13
number of independent citations to scientific publications and creative works:
295


2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
 
All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 2.2358 ( 2017. X. 31. )