Róbert Szelepcsényi (born 19 August 1966 in Žilina) is a Slovak computer scientist of Hungarian ethnicity and a member of the Faculty of Mathematics, Physics and Informatics of Comenius University in Bratislava. His results on the closure of non-deterministic space under complement, obtained in 1987 independently of Neil Immerman, are known as the Immerman-Szelepcsényi theorem and brought the Gödel Prize of ACM and EATCS to both of them in 1995. His paper on the method of forced enumeration for nondeterministic automata, which presents the technique behind the result, appeared in Acta Informatica 26(3) in 1988.
Facts
Connections
In Field
Source Wikipedia: Róbert Szelepcsényi
In the Other Atlases
Milestones Credited
Also in Mathematics Atlas: a milestone credited to this subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Róbert Szelepcsényi
Lead
born 19 August 1966
In Group: Computational Complexity Theory, Lead section
closure of non-deterministic space under complement
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.