Róbert Szelepcsényi
Slovak computer scientist
Róbert Szelepcsényi (Slovak pronunciation: [ˈrɔːbert ˈseleptʂeːɲi]; born 19 August 1966, Žilina[1]) is a Slovak computer scientist of Hungarian descent 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, independently obtained in 1987 also by Neil Immerman (the result known as the Immerman–Szelepcsényi theorem), brought the Gödel Prize of ACM and EATCS to both of them in 1995.[2]
Scientific articles
- Róbert Szelepcsényi: The Method of Forced Enumeration for Nondeterministic Automata. Acta Informatica 26(3): 279-284 (1988)
References
- v
- t
- e
Gödel Prize laureates
- Vardi / Wolper (2000)
- Arora / Feige / Goldwasser / Lund / Lovász / Motwani / Safra / Sudan / Szegedy (2001)
- Sénizergues (2002)
- Freund / Schapire (2003)
- Herlihy / Saks / Shavit / Zaharoglou (2004)
- Alon / Matias / Szegedy (2005)
- Agrawal / Kayal / Saxena (2006)
- Razborov / Rudich (2007)
- Teng / Spielman (2008)
- Reingold / Vadhan / Wigderson (2009)
Authority control databases  | |
|---|---|
| International |
|
| Academics |
|
 | This Slovak biographical article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
| P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
