Róbert Szelepcsényi (Slovak pronunciation: [ˈrɔːbert ˈseleptʂeːɲi]; born 19 August 1966, Žilina) is a Slovak computer scientist of Hungarian descent and...

complementation. It was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize. In its general...

jointly with Róbert Szelepcsényi, of the 1995 Gödel Prize in theoretical computer science for proof of what is known as the Immerman–Szelepcsényi theorem,...

longest tradition in the department. Most notably, the result of Róbert Szelepcsényi on the closure of nondeterministic space under complement, independently...

NL. This result (the Immerman–Szelepcsényi theorem) was independently discovered by Neil Immerman and Róbert Szelepcsényi in 1987; they received the 1995...

935–938, CiteSeerX 10.1.1.54.5941, doi:10.1137/0217058, ISSN 1095-7111 Szelepcsényi, R. (1988), "The method of forced enumeration for nondeterministic automata"...

contained in P#P. The Immerman–Szelepcsényi theorem was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the...

Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049 Szelepcsényi, Róbert (1988), "The method of forcing for nondeterministic automata", Acta...

Immerman–Szelepcsényi theorem, another fundamental result in computational complexity theory, was proven independently by Neil Immerman and Róbert Szelepcsényi...

Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049 Szelepcsényi, Róbert (1987), "The method of forcing for nondeterministic automata", Bulletin...

archbishop – 1637) György Lippay (primate, archbishop – 1642) György Szelepcsényi (primate, archbishop – 1666) György Széchényi (primate, archbishop –...

chain is found, the instance cannot be satisfiable. By the Immerman–Szelepcsényi theorem, it is also possible in nondeterministic logspace to verify that...

Wesselényi 1655–1667 Ferdinand III, from 1657: Leopold I none 1667–1681 Leopold I Royal Governors Ferenc Nádasdy (1667–1670) György Szelepcsényi (1670–1681)...

projects. • C. Orff: Carmina burana – Košice State Theatre (1983) • Szelepcsényi: Three Horehrons – Prague Chamber Ballet by P. Šmok (1984) • V. Godár:...

theoretical computer scientist, recipient of Gödel Prize for Immerman–Szelepcsényi theorem (1995), ACM Fellow and Guggenheim Fellow Ravindran Kannan (Ph...

of NL-completeness and co-NL-completeness follows from the Immerman–Szelepcsényi theorem. Salomaa (1981) Berstel et al. (2009), Chapter 2.3 Berstel, Jean;...