Clark School Home UMD

ISR News Story

Alum Amnon Lotem wins EATCS/ACM SIGACT Gödel Prize

Alumnus Amnon Lotem (CS Ph.D. 2000) and co-authors Ronald Fagin (IBM Research—Almaden) and Moni Naor (Weizmann Institute of Science) have been honored with the 2014 Gödel Prize for their paper, “Optimal Aggregation Algorithms for Middleware.” Lotem was advised at Maryland by Professor Dana Nau (CS/ISR).

The paper introduced the powerful “threshold algorithm” that is widely used in applications and systems that demand optimal results for gathering multi-sourced information. It provides a framework to design and analyze algorithms where aggregation of information from multiple data sources is needed, such as in information retrieval and machine learning. In these situations, the threshold algorithm offers a very efficient method for producing a single unified list of the “top k” results from the combined data sources. The threshold algorithm’s elegant mathematical properties and simplicity are particularly suitable for use in middleware, software that is often used to augment computer operating systems that support complex, distributed applications. The authors also introduced the notion of instance optimality, an extremely strong guarantee of performance, and showed that the threshold algorithm is instance optimal. The paper’s groundbreaking results have built a foundation for much follow-on research.

Lotem first started pursuing the ideas in the paper in a course on databases during his time at Maryland. His instructor suggested he examine an idea for improving the existing “Fagin’s algorithm” in data aggregation. Lotem created an optimal algorithm for the defined problem, and he and the instructor, Mike Franklin, subsequently co-authored on a paper that summarized both algorithms, and analyzed optimal aggregation algorithms for middleware.

Lotem is an algorithms and technologies expert in the Israeli high-tech industry. The prize will be awarded in July at the 41st International Colloquium on Automata, Languages, and Programming in Copenhagen.

The Gödel Prize recognizes outstanding papers in theoretical computer science and is presented by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery’s Special Interest Group on Algorithms and Computation Theory (ACM SIGACT).

Related Articles:
Alum Mingyan Liu is PI for Multiscale Network Games of Collusion and Competition MURI
Nau, Gelfand, Goldstein part of MURI developing the potential of mean-field game theory
Alumnus Philip Twu's exciting career in space robotics
Kedem, De Oliveira win Canadian Journal of Statistics Award
ISR researchers win additional $948K NSF Neural and Cognitive Systems grant
Alum Leonard Petnga to join University of Alabama Huntsville faculty
Nima Ghalichechian begins Ohio State tenure-track position 
Alum Domenic Forte receives NSF CAREER Award
Alumnus Fumin Zhang promoted to full professor at Georgia Tech
Alumnus Ravi Tandon receives NSF CAREER Award

May 4, 2014


Prev   Next

 

 

Current Headlines

C.D. Mote, Jr. Delivers Roy V. Wright Lecture

Stephen Trimberger in residence as ISR visiting research engineer

Brin Family Prize Celebrates Student Innovation

Alumnus Ravi Tandon Receives 2018 Keysight Early Career Professor Award 

Alum Mingyan Liu is PI for Multiscale Network Games of Collusion and Competition MURI

Haptic Safety for Unmanned Vehicles

Three ISR faculty receive UMD Brain and Behavior Initiative seed grants

Aneesh Raghavan wins Ann G. Wylie Dissertation Fellowship

Book edited by Ghodssi, Lin in top 25 percent of most downloaded Springer eBooks

Why a robot can't yet outjump a flea

News Resources

Return to Newsroom

Search News

Archived News

Events Resources

Events Calendar