Luca Trevisan

Luca Trevisan

Luca Trevisan ist ein italienischer Mathematiker und Informatiker.

Trevisan promovierte 1997 an der Universität La Sapienza in Rom bei Pierluigi Crescenzi. Als Post-Doc war er am MIT and 1998 am Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) der Rutgers University und Princeton University. Er war Assistant Professor an der Columbia University und ist zur Zeit Professor an der University of California, Berkeley.

Er befasst sich mit Komplexitätstheorie, Kryptographie, Näherungsalgorithmen in der kombinatorischen Optimierung, Zufälligkeitsproblemen in der Berechenbarkeitstheorie.

2000 erhielt er den Oberwolfach-Preis und war im selben Jahr Sloan Fellow. 2006 war er Invited Speaker auf dem ICM in Madrid (Pseudorandomness and combinatorial constructions).

Weblinks


Wikimedia Foundation.

Игры ⚽ Поможем написать реферат

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Trevisan — ist der Name folgender Personen: Luca Trevisan, italienischer Mathematiker und Informatiker Ludovico Trevisan (1401–1464), venezianischer Kardinal Marcantonio Trevisan (1475–1554), 80. Doge von Venedig Vittore Benedetto Antonio Trevisan de Saint… …   Deutsch Wikipedia

  • Sipser-Lautemann theorem — In computational complexity theory, the Sipser Lautemann theorem or Sipser Gács Lautemann theorem states that BPP (Bounded error Probablistic Polynomial) time, is contained in the polynomial time hierarchy, and more specifically Sigma;2 cap; Pi;2 …   Wikipedia

  • Arithmetic combinatorics — arose out of the interplay between number theory, combinatorics, ergodic theory and harmonic analysis. It is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). Additive… …   Wikipedia

  • Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n …   Wikipedia

  • PCP (complexity) — In computational complexity theory, PCP is the class of decision problems having probabilistically checkable proof systems. Introduction and definition In complexity theory, a PCP system can be viewed as an interactive proof system in which the… …   Wikipedia

  • Space hierarchy theorem — In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines can solve more problems in (asymptotically) more space, subject to certain conditions. For… …   Wikipedia

  • List-decoding — In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates. The notion was proposed by Elias in the 1950 s. The main idea behind list decoding is that the …   Wikipedia

  • Time hierarchy theorem — In computational complexity theory, the time hierarchy theorems are important statements about time bounded computation on Turing machines. Informally, these theorems say that given more time, a Turing machine can solve more problems. For example …   Wikipedia

  • Oberwolfach Prize — The Oberwolfach Prize of Mathematisches Forschungsinstitut Oberwolfach is awarded approximately every three years for excellent achievements in changing fields of mathematics to young European mathematicians not older than 35 years. It is… …   Wikipedia

  • Graphe cycle —  Ne doit pas être confondu avec Graphe des cycles ni Cycle (théorie des graphes). Graphe cycle C8 …   Wikipédia en Français

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”