Sign In

Communications of the ACM

ACM TechNews

Algorithm Pioneer Wins Kyoto Prize

View as: Print Mobile App Share:
Laszlo Lovasz

Laszlo Lovasz receiving the Kyoto Prize, which includes a $550,000 award plus recognition for technological achievement that is said to be on par with the Nobel Prize in stature.

Credit: R. Colin Johnson / EE Times

Eotvos Lorand University professor Laszlo Lovasz, who has solved several information technology (IT) problems using graph theory, has been awarded the Kyoto Prize. "Graph theory represents a different approach to optimization problems that uses geometry to compute results instead of differential equations," says Lovasz. "It turns out that very large networks in many different fields can be described by graphs, from cryptography to physical systems."

Lovasz's work has led to breakthroughs in RSA encryption technology, 4G channel capacity, extending the point-to-point IT of Claude Shannon, and the weak perfect graph conjecture. Lovasz may be best known for the breakthrough principles called the "Lovasz local lemma" and the "LLL-algorithm," which are widely used in cryptography, and for the multiple-input and multiple-output wireless communications scheme.

The Kyoto Prize was founded by Kyocera chairman Kazuo Inamori in 1984 and comes with a $550,000 award.

From EE Times
View Full Article


Abstracts Copyright © 2010 Information Inc., Bethesda, Maryland, USA


No entries found

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account