Gábor Tardos

Gábor Tardos ( born July 11, 1964 in Budapest) is a Hungarian mathematician and computer scientist.

Tardos studied at the Eotvos Lorand University in Budapest, where in 1987 he received his diploma and was awarded his doctorate in 1988 at Laszlo Babai and PP Pálfy ( Constructions in Universal Algebra ). As a student, he won four times the Swiss price of the Hungarian Mathematical Society. In 1988 he was Dickson Instructor at the University of Chicago in 1989 and a visiting professor of computer science there. 1992 to 2003 he was professor of computer science at the Eotvos Lorand University. He is currently at Simon Fraser University. Since 1990 he is also a researcher at the Alfred Renyi Institute of the Hungarian Academy of Sciences, whose scholarship he was from 1987 to 1990. He has been a visiting professor at Rutgers University (1990-1992) and the University of Toronto (1995 /96) and 1996/97 at the Institute for Advanced Study.

He deals with algebra, algorithms, combinatorics, computer-based and discrete geometry (computational geometry ) and complexity theory.

In 2004 he proved with Adam Marcus a conjecture of Richard P. Stanley and Herbert Wilf over permutations. He also developed coding method for fingerprints. In group theory, he scored 1992 partial results to a (to date unsolved ) conjecture of Hanna Neumann.

In 1988 he received the Prize of the Hungarian Grünwald Mathematical Society. In 1999 he was awarded the P. Erdos Prize and A. Renyi Prize of the Hungarian Academy of Sciences. In 1992 he was awarded the EMS price.

1996 to 2004 he was editor of the Journal of Algorithms and from 2004, the ACM Transactions on Algorithms.

He is the brother of a computer scientist and mathematicians Éva Tardos, professor at Cornell University.