The Information Theory Society established the Distinguished Lecturers Program to promote interest in information theory by supporting chapters who wish to invite prominent information theory researchers to give talks at their events. The Society aims to maintain ten Distinguished Lecturers each serving for two year terms. Typically, the ITSoc Distinguished Lecturers program provides funding for airfare and travel, and the local chapter funds accommodation and local expenses. If traveling to a different continent, visits to two locations are required. The distinguished lectures should be freely accessible to the public.
Criteria and Eligibility
The selection criteria are: (a) the quality of the candidates’ contributions to research in information theory and related areas, and (b) the ability of the candidates to deliver an excellent lecture to a broad audience. The candidates may be from any geographic region and any organization, e.g., academia, industry, or government. Nominations that promote diversity are encouraged. The Distinguished Lecturers are typically members of the Â鶹´«Ã½Ó³» Information Theory Society.
See the list ofÌýcurrent Distinguished Lecturers.
All nominations for Distinguished Lecturers should be submitted using theÌýonline form.
Current (bold) and Past Distinguished Lectures
| Lecturers | Presentations |
|---|---|
| Aditya Ramamoorthy (2024-2025) | Ìý |
| Anand Sarwate (2024-2025) | Ìý |
| Anelia Somekh-Baruch (2024-2025) | Ìý |
| Si-Hyeon Lee (2024-2025) | Ìý |
| Vinod Prabhakaran (2024-2025) | Ìý |
| Ashish Khisti (2023-2024) | Ìý |
| Oliver Kosut (2023-2024) | Ìý |
| Arya Mazumdar (2023-2024) | Ìý |
| Chao Tian (2023-2024) | Ìý |
| Shun Watanabe (2023-2024) | Ìý |
| Pulkit GroverÌý(2022-2023) | Ìý |
| Hamed HassaniÌý(2022-2023) | Ìý |
| Parastoo Sadeghi (2022-2023) |
|
| Michèle WiggerÌý(2022-2023) |
|
| Ning Cai (2021-2022) | Ìý |
| Lara Dolecek (2021-2022) | Ìý |
| Deniz Gunduz (2020-2022) | Ìý |
| Lalitha Sankar (2020-2022) | Ìý |
| Yossef Steinberg (2020-2022) | Ìý |
| Changho Suh (2020-2022) | Ìý |
| Daniela Tuninetti (2020-2022) |
Low-latency high-reliability communications Demand-Private and Content-Secure Caching Networks |
| Natasha Devroye (2019-2021) |
Interactive Communications |
|
Syed Jafar (2019-2021) |
Ìý |
| Roy Yates (2019-2021) | Ìý |
| Aylin Yener (2019-2021) | Ìý |
| Marco Dalai (2018-2019) | Ìý |
| Amos Lapidoth (2018-2019) |
All data are equal, but some data are more equal than others |
| Vincent Tan (2018-2019) |
Minimum Rates of Approximate Sufficient Statistics Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Recent Advances in Ranking: Adversarial Respondents and Lower Bounds on the Bayes Risk On the Maximum Size of Block Codes Subject to a Distance Criterion Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý |
| Sennur Ulukus (2018-2019) |
Private Information Retrieval: How to Get Something Without Revealing What You Got |
| Aaron Wagner (2018-2019) |
How to Measure Side-Channel Leakage Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý Ìý |
| Tara Javidi (2017-2018) | Ìý |
| Navin Kashyap (2017-2018) |
The Communication Complexity of Secret Key Generation Feedback Capacity and Coding for Binary-Input Memoryless Channels with a No-Consecutive-Ones Input Constraint Probabilistic Forwarding Over Networks: To Code Or Not To Code? |
| Chandra Nair (2017-2018) | Ìý |
| Osvaldo Simeone (2017-2018) |
Fog-Aided Wireless Networks: An Information-Theoretic View |
| Ram Zamir (2017-2018) | Ìý |
| Martin J. Wainwright (2016-2017) | Ìý |
| Ron M. Roth (2016-2017) | Ìý |
| Olgica Milenkovic (2016-2017) | Ìý |
| Babak Hassibi (2016-2017) | Ìý |
| Suhas Diggavi (2016-2017) |
Foundations of secureÌýcyber physicalÌýsystems |
| Emina SoljaninÌý (2015-2016) |
Cloud Storage Space vs. Download Time for Large Files Ìý Network Multicast: A theoretical Minimum and an Open Problem Ìý |
| Henry PfisterÌý (2015-2016) |
Graphical Models and Inference: Insights from Spatial CouplingÌý |
| Andrea MontanariÌý (2015-2016) | Ìý |
| Gerhard KramerÌý (2015-2016) |
Communication Rates for Phase Noise Channels Ìý Bounds on the Capacity of Optical Fiber Channels Ìý Information Rates for Phase Noise ChannelsÌý(including fiber optic channels) Ìý Models and Capacity Bounds for Optical Fiber Channels Ìý |
| Alexandros Dimakis (2015-2016) | Ìý |
| Frans M.J. Willems (2014-2015) |
Combining theÌýBurrows WheelerÌýTransform and the Context-Tree Weighting Algorithm Waiting-Times ,Ìý Dependence Balances ,Ìý Search Codes , andÌý False Acceptance Ìý(4 parts)Ìý |
| Pascal Vontobel (2014-2015) | Ìý |
| Tracey Ho (2014-2015) |
Ìý |
| Giuseppe Caire (2014-2015) |
Ìý |
| Erdal Arikan (2014-2015) |
Ìý |
| Rüdiger Urbanke (2013-2014) | Ìý |
| H. Vincent Poor (2013-2014) |
Feedback in Wireless Networks: Recent Results and Discoveries Feedback in Wireless Networks: Recent Results and Discoveries Games, Privacy and Distributed Inference for the Smart Grid Smart Grid: The Role of the Information Sciences |
| Muriel Médard (2013-2014) | Ìý |
| Elza Erkip (2013-2014) | Ìý |
| Helmut Bölcskei (2013-2014) |
Ìý |
| Emre Telatar (2012-2013) |
Ìý |
| Shlomo Shamai (Shitz) (2012-2013) |
Ìý |
| Frank R. Kschischang (2012-2013) |
Ìý |
| Young-Han Kim (2012-2013) |
Ìý |
| Christina Fragouli (2012-2013) |
Ìý |
| Raymond YeungÌý (2011-2012) |
Refinement of Two Fundamental Tools in Information Theory Ìý |
| David Tse (2011-2012) |
Information Theory of High-throughput Shotgun Sequencing The Science of Information; From Communication to DNA Sequencing The Science of Information; From Communication to DNA Sequencing |
| Alex Grant (2011-2012) | Ìý |
| Max Costa Ìý (2011-2012) |
Dirty Paper Coding and Distributed Source Coding - Two views of combined source and channel coding |
| Toby Berger (2011-2012) | Ìý |
| Michael Gastpar (2010-2011) | Ìý |
| Andrea Goldsmith (2010-2011) |
The road ahead for wireless technology: Dreams and Challenges |
| Alon Orlitsky (2010-2011) | Ìý |
| Amin Shokrollahi (2010-2011) | Ìý |
| Sergio Verdú (2010-2011) | Ìý |
Ìý