Login
 Forum
 
 
Personal data sheet
 Print preview
personal data approved: 2019. XI. 08.
Personal data
Szabolcs Iván
name Szabolcs Iván
name of institution
doctoral school
SzTE Doctoral School of Computer Science (Supervisor)
Contact details
E-mail address szabivaninf.u-szeged.hu
phone number +36 62 544-494
own web page
Academic title
scientific degree, title Ph.D.
year degree was obtained 2009
discipline to which degree belongs mathematics and computing
institution granting the degree University of Szeged
Employment
2008 - University of Szeged
university professor or researcher
Thesis topic supervisor
number of doctoral students supervised until now 1
number of students who fulfilled course requirements 0
students who obtained their degrees:
present PhD students:
Kitti Gelle (PhD) (2020/08)  IDI2-SzTE
  Thesis topic proposals
Research
research area Expressiveness of devices generating languages of infinite words; applying combinatorics in computer science
research field in which current research is conducted computer sciences
Publications
2019

Gelle Kitti, Iván Szabolcs: The ordinal generated by an ordinal grammar is computable, THEORETICAL COMPUTER SCIENCE 793: pp. 1-13.
type of document: Journal paper/Article
language: English
URL 
2019

Gelle Kitti, Iván Szabolcs: Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 30: (06n07) pp. 1029-1045.
type of document: Journal paper/Article
language: English
URL 
2018

Kitti Gelle, Szabolcs Iván: Recognizing Union-Find trees is NP-complete, INFORMATION PROCESSING LETTERS 131: pp. 7-14.
type of document: Journal paper/Article
language: English
URL 
2017

Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey Shallit: Fractional Coverings, Greedy Coverings, and Rectifier Networks, In: Vollmer, H; Vallée, B (szerk.) 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Schloss Dagstuhl Leibniz-Zentrum für Informatik (2017) pp. 23:1-23:14.
type of document: Part of book/Proceedings Paper
language: English
URL 
2016

Szabolcs Iván: Complexity of atoms, combinatorially, INFORMATION PROCESSING LETTERS 116: (5) pp. 356-360.
type of document: Journal paper/Article
number of independent citations: 21
language: English
URL 
2014

Szabolcs Iván: Synchronizing weighted automata, In: Ésik, Zoltán; Fülöp, Zoltán (szerk.) 14th International Conference on Automata and Formal Languages, University of New South Wales, Australia (2014) pp. 301-313.
type of document: Part of book/Proceedings Paper
number of independent citations: 2
language: English
2011

Esik Z, Ivan S: Buchi context-free languages, THEORETICAL COMPUTER SCIENCE 412: (8-10) pp. 805-821.
type of document: Journal paper/Article
number of independent citations: 2
language: English
URL 
2009

Gazdag Z, Ivan S, Nagy-Gyorgy J: Improved upper bounds on synchronizing nondeterministic automata, INFORMATION PROCESSING LETTERS 109: (17) pp. 986-990.
type of document: Journal paper/Article
number of independent citations: 7
language: English
URL 
2008

Ésik Zoltán, Iván Szabolcs: Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics, FUNDAMENTA INFORMATICAE 82: (1-2) pp. 79-103.
type of document: Journal paper/Article
number of independent citations: 7
language: English
2008

Ésik Zoltán, Iván Szabolcs: Products of Tree Automata with an Application to Temporal Logic, FUNDAMENTA INFORMATICAE 82: (1-2) pp. 61-78.
type of document: Journal paper/Article
number of independent citations: 4
language: English
Number of independent citations to these publications:43 
Scientometric data
list of publications and citations
number of scientific publications that meet accreditation criteria:
35
number of scientific publications:
35
monographs and professional books:
0
monographs/books in which chapters/sections were contributed:
0 
number of independent citations to scientific publications and creative works:
55

 
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. )