Géraud Sénizergues

Géraud Sénizergues
Géraud Sénizergues
	Sénizergues in September 2017
Born	9 March 1957 (age 67)
Nationality	French
Awards	Gödel Prize (2002); Gay-Lussac Humboldt Prize (2003);
	Scientific career
Fields	Computer science
Institutions	University of Bordeaux
Website	dept-info.labri.u-bordeaux.fr/~ges/

Géraud Sénizergues (born 9 March 1957) is a French computer scientist at the University of Bordeaux.

He is known for his contributions to automata theory, combinatorial group theory and abstract rewriting systems.^[1]

He received his Ph.D. (Doctorat d'état en Informatique) from the Université Paris Diderot (Paris 7) in 1987 under the direction of Jean-Michel Autebert.^[2]

With Yuri Matiyasevich he obtained results about the Post correspondence problem.^[3] He won the 2002 Gödel Prize "for proving that equivalence of deterministic pushdown automata is decidable".^[4]^[5]^[6] In 2003 he was awarded with the Gay-Lussac Humboldt Prize.

References

^ "DBLP Geraud Senizergues".
^ "Mathematical Genealogy Project, Geraud Senizergues".
^ Matiyasevich, Y.; Senizergues, G. (1996). "Decision problems for semi-Thue systems with a few rules". Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. New Brunswick, NJ, USA: IEEE Comput. Soc. Press. pp. 523–531. doi:10.1109/LICS.1996.561469. ISBN 9780818674631. S2CID 14296200.
^ "2002 Gödel Prize". sigact.org. Retrieved 2019-05-10.
^ Sénizergues, Géraud (1997). Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto (eds.). "The equivalence problem for deterministic pushdown automata is decidable". Automata, Languages and Programming. Lecture Notes in Computer Science. 1256. Springer Berlin Heidelberg: 671–681. doi:10.1007/3-540-63165-8_221. ISBN 9783540691945.
^ Sénizergues, Géraud (2001). "L(A)=L(B)? decidability results from complete formal systems". Theoretical Computer Science. 251 (1–2): 1–166. doi:10.1016/S0304-3975(00)00285-1.

External links

This article about a French scientist is a stub. You can help Wikipedia by expanding it.

Zdroj:https://en.wikipedia.org?pojem=Géraud_Sénizergues
Text je dostupný za podmienok Creative Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších podmienok. Podrobnejšie informácie nájdete na stránke Podmienky použitia.

[GS-1] "DBLP Geraud Senizergues".

[Phd-2] "Mathematical Genealogy Project, Geraud Senizergues".

[3] Matiyasevich, Y.; Senizergues, G. (1996). "Decision problems for semi-Thue systems with a few rules". Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. New Brunswick, NJ, USA: IEEE Comput. Soc. Press. pp. 523–531. doi:10.1109/LICS.1996.561469. ISBN 9780818674631. S2CID 14296200.

[4] "2002 Gödel Prize". sigact.org. Retrieved 2019-05-10.

[5] Sénizergues, Géraud (1997). Degano, Pierpaolo; Gorrieri, Roberto; Marchetti-Spaccamela, Alberto (eds.). "The equivalence problem for deterministic pushdown automata is decidable". Automata, Languages and Programming. Lecture Notes in Computer Science. 1256. Springer Berlin Heidelberg: 671–681. doi:10.1007/3-540-63165-8_221. ISBN 9783540691945.

[6] Sénizergues, Géraud (2001). "L(A)=L(B)? decidability results from complete formal systems". Theoretical Computer Science. 251 (1–2): 1–166. doi:10.1016/S0304-3975(00)00285-1.

[1]

[2]

[3]

[4]

[5]

[6]

v t e Gödel Prize laureates
1990s	Babai / Goldwasser / Micali / Moran / Rackoff (1993) Håstad (1994) Immerman / Szelepcsényi (1995) Jerrum / Sinclair (1996) Halpern / Moses (1997) Toda (1998) Shor (1999)
2000s	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)
2010s	Arora / Mitchell (2010) Håstad (2011) Koutsoupias / Papadimitriou / Roughgarden / É. Tardos / Nisan / Ronen (2012) Boneh / Franklin / Joux (2013) Fagin / Lotem / Naor (2014) Spielman / Teng (2015) Brookes / O'Hearn (2016) Dwork / McSherry / Nissim / Smith (2017) Regev (2018) Dinur (2019)
2020s	Moser / G. Tardos (2020) Bulatov / Cai / Chen / Dyer / Richerby (2021) Brakerski / Gentry / Vaikuntanathan (2022)

Authority control databases
International	ISNI VIAF
National	France BnF data
Academics	DBLP MathSciNet Mathematics Genealogy Project zbMATH
Other	IdRef

Géraud Sénizergues
Sénizergues in September 2017
Born	(1957-03-09) 9 March 1957 (age 67)
Nationality	French
Awards	Gödel Prize (2002) Gay-Lussac Humboldt Prize (2003)
Scientific career
Fields	Computer science
Institutions	University of Bordeaux

Website	dept-info.labri.u-bordeaux.fr/~ges/