Róbert Szelepcsényi (born 19 August 1966 in Žilina) is a Slovak computer scientist of Hungarian ethnicity who is a member of the Faculty of Mathematics, Physics and Informatics of Comenius University in Bratislava. He is known for showing that non-deterministic space is closed under complement, a result he obtained in 1987 independently of Neil Immerman and which is now called the Immerman-Szelepcsényi theorem. The two men shared the 1995 Gödel Prize of the ACM and EATCS for it. His own account of the proof technique, the method of forced enumeration for nondeterministic automata, appeared in Acta Informatica in 1988. The atlas records him as the mathematical side of theoretical computer science, linked to the theorem that carries his name.
Facts
Róbert Szelepcsényi
Filter Results1 entry
Connections
Principal Result
Source Róbert Szelepcsényi (Wikipedia)
Proofs Credited
Source Immerman-Szelepcsenyi theorem, Wikipedia
In the Other Atlases
Same As
Also in Computing Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Róbert Szelepcsényi (Wikipedia)LeadQuote, Lead
is a Slovak computer scientist
Sources
1. Róbert Szelepcsényi (Wikipedia)
Lead, birth date
born 19 August 1966
Lead, pronoun
His results on the closure of non-deterministic space under complement
Lead
is a Slovak computer scientist
Principal Result: Immerman-Szelepcsenyi Theorem, Lead, closure under complement
(the result known as the Immerman-Szelepcsényi theorem)
View the SourceImmerman-Szelepcsenyi theorem, Wikipedia
Proofs Credited: Immerman-Szelepcsenyi Theorem, Lead sentenceQuote, Proofs Credited: Immerman-Szelepcsenyi Theorem, Lead sentence
It was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize.
Reader 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.