{"id":"acm-prize-2025-zaharia","year":2025,"award_slug":"acm-prize-in-computing","person_names":["Matei Zaharia"],"person_slugs":["matei-zaharia"],"title":"Distributed data systems and computing infrastructure","kind":"laureate","topics":["distributed systems","data engineering","machine learning"],"institutions":["Stanford University","Databricks"],"significance":"Recognized the systems infrastructure that helped make large-scale data, analytics, and applied AI practical in production environments.","event_source_label":"2025 ACM Prize in Computing announcement","event_source_url":"https://www.acm.org/media-center/2026/april/acm-prize-2025","related_works":[{"title":"Apache Spark","type":"software","year":2014,"url":"https://spark.apache.org/","source_quality":"canonical"}],"featured":true,"award_name":"ACM Prize in Computing","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/acm-prize","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Matei Zaharia","decade":"2020s","search_blob":"Distributed data systems and computing infrastructure | ACM Prize in Computing | ACM Prize in Computing | Recognizes early- to mid-career professionals whose work has fundamental impact across computing. | Matei Zaharia | distributed systems data engineering machine learning | Stanford University Databricks | Recognized the systems infrastructure that helped make large-scale data, analytics, and applied AI practical in production environments. | Apache Spark | 2025 | 2020s"}
{"id":"godel-2025-chattopadhyay-zuckerman","year":2025,"award_slug":"godel-prize","person_names":["Eshan Chattopadhyay","David Zuckerman"],"person_slugs":["eshan-chattopadhyay","david-zuckerman"],"title":"Explicit two-source extractors and resilient functions","kind":"paper_award","topics":["complexity","randomness extraction","theory"],"institutions":["Cornell University","University of Texas at Austin"],"significance":"Recognized a breakthrough on explicit two-source extractors, resolving a long-open problem in randomness and complexity theory.","event_source_label":"2025 Gödel Prize citation","event_source_url":"https://sigact.org/prizes/g%C3%B6del/citation2025.html","related_works":[{"title":"Explicit Two-Source Extractors and Resilient Functions","type":"paper","year":2016,"url":"https://dl.acm.org/doi/10.1145/2897518.2897528","source_quality":"canonical"}],"featured":true,"award_name":"Gödel Prize","award_category":"theory_award","official_program_label":"Official awards page / index","official_program_url":"https://sigact.org/prizes/godel-prize/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Eshan Chattopadhyay, David Zuckerman","decade":"2020s","search_blob":"Explicit two-source extractors and resilient functions | Gödel Prize | Gödel Prize | Honors outstanding papers in theoretical computer science with deep long-term influence. | Eshan Chattopadhyay David Zuckerman | complexity randomness extraction theory | Cornell University University of Texas at Austin | Recognized a breakthrough on explicit two-source extractors, resolving a long-open problem in randomness and complexity theory. | Explicit Two-Source Extractors and Resilient Functions | 2025 | 2020s"}
{"id":"icde-2025-spatialhadoop","year":2025,"award_slug":"icde-influential-paper-award","person_names":["Ahmed Eldawy","Mohamed F. Mokbel"],"person_slugs":["ahmed-eldawy","mohamed-f-mokbel"],"title":"SpatialHadoop and scalable spatial data processing","kind":"paper_award","topics":["databases","data engineering","geospatial systems"],"institutions":["University of Minnesota"],"significance":"Highlights a practical bridge between big-data systems and spatial analytics for large geospatial workloads.","related_works":[{"title":"SpatialHadoop: A MapReduce Framework for Spatial Data","type":"paper","year":2015,"url":"https://ieeexplore.ieee.org/document/7113349","source_quality":"canonical"}],"award_name":"ICDE Influential Paper","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://tab.computer.org/tcde/icde_inf_paper.html","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Ahmed Eldawy, Mohamed F. Mokbel","decade":"2020s","featured":false,"search_blob":"SpatialHadoop and scalable spatial data processing | ICDE 10-Year Influential Paper Award | ICDE Influential Paper | Surfaces influential data engineering work through a ten-year retrospective lens. | Ahmed Eldawy Mohamed F. Mokbel | databases data engineering geospatial systems | University of Minnesota | Highlights a practical bridge between big-data systems and spatial analytics for large geospatial workloads. | SpatialHadoop: A MapReduce Framework for Spatial Data | 2025 | 2020s"}
{"id":"ijcai-2025-dechter","year":2025,"award_slug":"ijcai-research-excellence-award","person_names":["Rina Dechter"],"person_slugs":["rina-dechter"],"title":"Constraint reasoning and probabilistic inference","kind":"laureate","topics":["artificial intelligence","constraint satisfaction","probabilistic inference"],"institutions":["University of California, Irvine"],"significance":"Recognized a body of work that unified search, inference, and complexity ideas across core symbolic AI problems.","event_source_label":"IJCAI 2025 invited talks","event_source_url":"https://2025.ijcai.org/invited-talks/","related_works":[{"title":"Constraint Processing","type":"book","year":2003,"url":"https://doi.org/10.1016/B978-1-55860-890-0.X5000-2","source_quality":"canonical"}],"featured":true,"award_name":"IJCAI Research Excellence","award_category":"ai_award","official_program_label":"Official awards page / index","official_program_url":"https://www.ijcai.org/awards","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Rina Dechter","decade":"2020s","search_blob":"Constraint reasoning and probabilistic inference | IJCAI Research Excellence Award | IJCAI Research Excellence | Career award for major contributions to artificial intelligence research. | Rina Dechter | artificial intelligence constraint satisfaction probabilistic inference | University of California, Irvine | Recognized a body of work that unified search, inference, and complexity ideas across core symbolic AI problems. | Constraint Processing | 2025 | 2020s"}
{"id":"sigir-tot-2025-image-recs","year":2025,"award_slug":"sigir-test-of-time","person_names":["Julian McAuley","Christopher Targett","Javen Shi","Anton van den Hengel"],"person_slugs":["julian-mcauley","christopher-targett","javen-shi","anton-van-den-hengel"],"title":"Image-based recommendations on styles and substitutes","kind":"paper_award","topics":["information retrieval","recommendation systems","computer vision"],"institutions":["University of California, San Diego","University of Adelaide"],"significance":"Highlights retrieval-era work that connected visual understanding with recommendation, style, and substitutes in online catalogs.","event_source_label":"SIGIR 2025 awards and accepted papers","event_source_url":"https://sigir2025.dei.unipd.it/accepted-papers.html","related_works":[{"title":"Image-based Recommendations on Styles and Substitutes","type":"paper","year":2015,"url":"https://dl.acm.org/doi/10.1145/2766462.2767755","source_quality":"canonical"}],"award_name":"SIGIR Test of Time","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://sigir.org/awards/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Julian McAuley, Christopher Targett, Javen Shi, Anton van den Hengel","decade":"2020s","featured":false,"search_blob":"Image-based recommendations on styles and substitutes | SIGIR Test of Time Award | SIGIR Test of Time | Highlights influential information retrieval papers years after publication. | Julian McAuley Christopher Targett Javen Shi Anton van den Hengel | information retrieval recommendation systems computer vision | University of California, San Diego University of Adelaide | Highlights retrieval-era work that connected visual understanding with recommendation, style, and substitutes in online catalogs. | Image-based Recommendations on Styles and Substitutes | 2025 | 2020s"}
{"id":"aaai-classic-2024-maximum-entropy-irl","year":2024,"award_slug":"aaai-classic-paper-award","person_names":["Brian Ziebart","Andrew Maas","J. Andrew Bagnell","Anind K. Dey"],"person_slugs":["brian-ziebart","andrew-maas","j-andrew-bagnell","anind-k-dey"],"title":"Maximum entropy inverse reinforcement learning","kind":"paper_award","topics":["artificial intelligence","reinforcement learning","decision making"],"institutions":["Carnegie Mellon University"],"significance":"Revisits a paper that made entropy-regularized inverse reinforcement learning a lasting tool for imitation, planning, and alignment-style research.","related_works":[{"title":"Maximum Entropy Inverse Reinforcement Learning","type":"paper","year":2008,"url":"https://cdn.aaai.org/AAAI/2008/AAAI08-227.pdf","source_quality":"canonical"}],"featured":true,"award_name":"AAAI Classic Paper","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://aaai.org/about-aaai/aaai-awards/aaai-classic-paper-award/","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Brian Ziebart, Andrew Maas, J. Andrew Bagnell, Anind K. Dey","decade":"2020s","search_blob":"Maximum entropy inverse reinforcement learning | AAAI Classic Paper Award | AAAI Classic Paper | Revisits AI conference papers whose importance becomes more visible over time. | Brian Ziebart Andrew Maas J. Andrew Bagnell Anind K. Dey | artificial intelligence reinforcement learning decision making | Carnegie Mellon University | Revisits a paper that made entropy-regularized inverse reinforcement learning a lasting tool for imitation, planning, and alignment-style research. | Maximum Entropy Inverse Reinforcement Learning | 2024 | 2020s"}
{"id":"acm-prize-2024-hoefler","year":2024,"award_slug":"acm-prize-in-computing","person_names":["Torsten Hoefler"],"person_slugs":["torsten-hoefler"],"title":"High-performance computing for the AI era","kind":"laureate","topics":["high-performance computing","systems","artificial intelligence"],"institutions":["ETH Zürich"],"significance":"Recognized contributions that advanced large-scale high-performance computing and its role in modern AI systems and infrastructure.","event_source_label":"2024 ACM Prize in Computing announcement","event_source_url":"https://awards.acm.org/about/2024-acm-prize","related_works":[{"title":"Torsten Hoefler research profile","type":"profile","year":2024,"url":"https://spcl.inf.ethz.ch/People/torstenhoefler.html","source_quality":"contextual"}],"award_name":"ACM Prize in Computing","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/acm-prize","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Torsten Hoefler","decade":"2020s","featured":false,"search_blob":"High-performance computing for the AI era | ACM Prize in Computing | ACM Prize in Computing | Recognizes early- to mid-career professionals whose work has fundamental impact across computing. | Torsten Hoefler | high-performance computing systems artificial intelligence | ETH Zürich | Recognized contributions that advanced large-scale high-performance computing and its role in modern AI systems and infrastructure. | Torsten Hoefler research profile | 2024 | 2020s"}
{"id":"godel-2024-williams","year":2024,"award_slug":"godel-prize","person_names":["Ryan Williams"],"person_slugs":["ryan-williams"],"title":"ACC circuit lower bounds breakthrough","kind":"paper_award","topics":["complexity","circuit lower bounds","theory"],"institutions":["Massachusetts Institute of Technology"],"significance":"Recognized a landmark lower-bounds result showing that exponential-time nondeterministic computation cannot be captured by polynomial-size non-uniform ACC circuits.","event_source_label":"2024 Gödel Prize citation","event_source_url":"https://sigact.org/prizes/g%C3%B6del/citation2024.html","related_works":[{"title":"Non-Uniform ACC Circuit Lower Bounds","type":"paper","year":2011,"url":"https://doi.org/10.1109/CCC.2011.36","source_quality":"canonical"}],"award_name":"Gödel Prize","award_category":"theory_award","official_program_label":"Official awards page / index","official_program_url":"https://sigact.org/prizes/godel-prize/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Ryan Williams","decade":"2020s","featured":false,"search_blob":"ACC circuit lower bounds breakthrough | Gödel Prize | Gödel Prize | Honors outstanding papers in theoretical computer science with deep long-term influence. | Ryan Williams | complexity circuit lower bounds theory | Massachusetts Institute of Technology | Recognized a landmark lower-bounds result showing that exponential-time nondeterministic computation cannot be captured by polynomial-size non-uniform ACC circuits. | Non-Uniform ACC Circuit Lower Bounds | 2024 | 2020s"}
{"id":"hopper-2024-diakonikolas","year":2024,"award_slug":"grace-murray-hopper-award","person_names":["Ilias Diakonikolas"],"person_slugs":["ilias-diakonikolas"],"title":"Robust statistics with algorithmic reach","kind":"laureate","topics":["algorithms","robust statistics","machine learning"],"institutions":["University of Wisconsin–Madison"],"significance":"Highlights algorithmic robust statistics as a fast-growing bridge between theory and practical machine learning reliability.","event_source_label":"2024 Grace Murray Hopper Award announcement","event_source_url":"https://www.acm.org/media-center/2025/may/hopper-award-2024","related_works":[{"title":"Algorithmic High-Dimensional Robust Statistics","type":"book","year":2022,"url":"https://www.cambridge.org/core/books/algorithmic-highdimensional-robust-statistics/EF7F8F5C5E3D6D7AF2F8AA6B3E235E25","source_quality":"canonical"}],"award_name":"Grace Hopper Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/hopper","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Ilias Diakonikolas","decade":"2020s","featured":false,"search_blob":"Robust statistics with algorithmic reach | ACM Grace Murray Hopper Award | Grace Hopper Award | Highlights a single recent generation-defining contribution from a young computing professional. | Ilias Diakonikolas | algorithms robust statistics machine learning | University of Wisconsin–Madison | Highlights algorithmic robust statistics as a fast-growing bridge between theory and practical machine learning reliability. | Algorithmic High-Dimensional Robust Statistics | 2024 | 2020s"}
{"id":"ijcai-2024-dietterich","year":2024,"award_slug":"ijcai-research-excellence-award","person_names":["Thomas G. Dietterich"],"person_slugs":["thomas-g-dietterich"],"title":"Machine learning for robust and trustworthy AI","kind":"laureate","topics":["artificial intelligence","machine learning","robustness"],"institutions":["Oregon State University"],"significance":"Recognized a career of influential machine learning research spanning ensemble methods, sequential decision-making, and robust AI systems.","event_source_label":"IJCAI 2024 keynote speakers","event_source_url":"https://ijcai24.org/keynote-speakers/","related_works":[{"title":"Machine Learning for Sequential Data: A Review","type":"article","year":2022,"url":"https://www.aaai.org/ojs/index.php/aimagazine/article/view/2756","source_quality":"canonical"}],"award_name":"IJCAI Research Excellence","award_category":"ai_award","official_program_label":"Official awards page / index","official_program_url":"https://www.ijcai.org/awards","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Thomas G. Dietterich","decade":"2020s","featured":false,"search_blob":"Machine learning for robust and trustworthy AI | IJCAI Research Excellence Award | IJCAI Research Excellence | Career award for major contributions to artificial intelligence research. | Thomas G. Dietterich | artificial intelligence machine learning robustness | Oregon State University | Recognized a career of influential machine learning research spanning ensemble methods, sequential decision-making, and robust AI systems. | Machine Learning for Sequential Data: A Review | 2024 | 2020s"}
{"id":"kanellakis-2024-krawczyk","year":2024,"award_slug":"kanellakis-award","person_names":["Hugo Krawczyk"],"person_slugs":["hugo-krawczyk"],"title":"Provable security with practical impact","kind":"laureate","topics":["cryptography","security","protocols"],"institutions":["Technion","Amazon Web Services"],"significance":"Shows how provable-security ideas can become durable foundations for real-world protocol and infrastructure security.","related_works":[{"title":"HMQV: A High-Performance Secure Diffie-Hellman Protocol","type":"paper","year":2005,"url":"https://iacr.org/archive/crypto2005/36210372/36210372.pdf","source_quality":"canonical"}],"award_name":"Kanellakis Award","award_category":"bridge_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/kanellakis","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Hugo Krawczyk","decade":"2020s","featured":false,"search_blob":"Provable security with practical impact | ACM Paris Kanellakis Theory and Practice Award | Kanellakis Award | Honors theoretical work with concrete influence on computing practice. | Hugo Krawczyk | cryptography security protocols | Technion Amazon Web Services | Shows how provable-security ideas can become durable foundations for real-world protocol and infrastructure security. | HMQV: A High-Performance Secure Diffie-Hellman Protocol | 2024 | 2020s"}
{"id":"knuth-2024-alur","year":2024,"award_slug":"knuth-prize","person_names":["Rajeev Alur"],"person_slugs":["rajeev-alur"],"title":"Timed and hybrid models for system design","kind":"laureate","topics":["formal methods","verification","cyber-physical systems"],"institutions":["University of Pennsylvania"],"significance":"Celebrates foundational models that shaped verification, synthesis, and analysis for modern reactive and cyber-physical systems.","event_source_label":"2024 Knuth Prize citation","event_source_url":"https://sigact.org/prizes/knuth/citation2024.html","related_works":[{"title":"Principles of Cyber-Physical Systems","type":"book","year":2015,"url":"https://mitpress.mit.edu/9780262029117/principles-of-cyber-physical-systems/","source_quality":"canonical"}],"award_name":"Knuth Prize","award_category":"theory_award","official_program_label":"Official awards page / index","official_program_url":"https://sigact.org/prizes/knuth-prize/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Rajeev Alur","decade":"2020s","featured":false,"search_blob":"Timed and hybrid models for system design | Donald E. Knuth Prize | Knuth Prize | Celebrates landmark achievements in theoretical computer science across a career. | Rajeev Alur | formal methods verification cyber-physical systems | University of Pennsylvania | Celebrates foundational models that shaped verification, synthesis, and analysis for modern reactive and cyber-physical systems. | Principles of Cyber-Physical Systems | 2024 | 2020s"}
{"id":"sigir-tot-2024-explicit-factor-models","year":2024,"award_slug":"sigir-test-of-time","person_names":["Yongfeng Zhang","Guokun Lai","Min Zhang","Yi Zhang","Yiqun Liu","Shaoping Ma"],"person_slugs":["yongfeng-zhang","guokun-lai","min-zhang","yi-zhang","yiqun-liu","shaoping-ma"],"title":"Explicit factor models for explainable recommendation","kind":"paper_award","topics":["information retrieval","recommendation systems","explainability"],"institutions":["Tsinghua University"],"significance":"Recognized early influential work on explainable recommendation that connected phrase-level sentiment signals with transparent latent-factor models.","event_source_label":"SIGIR Test of Time Award winners","event_source_url":"https://sigir.org/test-of-time-award-winners/","related_works":[{"title":"Explicit Factor Models for Explainable Recommendation Based on Phrase-Level Sentiment Analysis","type":"paper","year":2014,"url":"https://dl.acm.org/doi/10.1145/2600428.2609579","source_quality":"canonical"}],"award_name":"SIGIR Test of Time","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://sigir.org/awards/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Yongfeng Zhang, Guokun Lai, Min Zhang, Yi Zhang, Yiqun Liu, Shaoping Ma","decade":"2020s","featured":false,"search_blob":"Explicit factor models for explainable recommendation | SIGIR Test of Time Award | SIGIR Test of Time | Highlights influential information retrieval papers years after publication. | Yongfeng Zhang Guokun Lai Min Zhang Yi Zhang Yiqun Liu Shaoping Ma | information retrieval recommendation systems explainability | Tsinghua University | Recognized early influential work on explainable recommendation that connected phrase-level sentiment signals with transparent latent-factor models. | Explicit Factor Models for Explainable Recommendation Based on Phrase-Level Sentiment Analysis | 2024 | 2020s"}
{"id":"turing-2024-barto-sutton","year":2024,"award_slug":"turing-award","person_names":["Andrew G. Barto","Richard S. Sutton"],"person_slugs":["andrew-g-barto","richard-s-sutton"],"title":"Reinforcement learning foundations","kind":"laureate","topics":["artificial intelligence","reinforcement learning","control"],"institutions":["University of Massachusetts Amherst","University of Alberta"],"significance":"Recognized the concepts and methods that made reinforcement learning a durable core area of AI.","related_works":[{"title":"Reinforcement Learning: An Introduction","type":"book","year":1998,"url":"https://incompleteideas.net/book/the-book.html","source_quality":"contextual"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Andrew G. Barto, Richard S. Sutton","decade":"2020s","search_blob":"Reinforcement learning foundations | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Andrew G. Barto Richard S. Sutton | artificial intelligence reinforcement learning control | University of Massachusetts Amherst University of Alberta | Recognized the concepts and methods that made reinforcement learning a durable core area of AI. | Reinforcement Learning: An Introduction | 2024 | 2020s"}
{"id":"vonneumann-2024-manning","year":2024,"award_slug":"john-von-neumann-medal","person_names":["Christopher D. Manning"],"person_slugs":["christopher-d-manning"],"title":"Statistical and neural language understanding","kind":"laureate","topics":["natural language processing","machine learning","representation learning"],"institutions":["Stanford University"],"significance":"Recognized work spanning statistical NLP, large-scale language resources, and neural representation methods that reshaped modern language AI.","related_works":[{"title":"GloVe: Global Vectors for Word Representation","type":"paper","year":2014,"url":"https://doi.org/10.3115/v1/D14-1162","source_quality":"canonical"}],"featured":true,"award_name":"von Neumann Medal","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://www.ieee.org/about/awards/medals/von-neumann.html","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Christopher D. Manning","decade":"2020s","search_blob":"Statistical and neural language understanding | IEEE John von Neumann Medal | von Neumann Medal | Recognizes career-level leadership and impact spanning computing science and engineering, from core systems to modern computational methods. | Christopher D. Manning | natural language processing machine learning representation learning | Stanford University | Recognized work spanning statistical NLP, large-scale language resources, and neural representation methods that reshaped modern language AI. | GloVe: Global Vectors for Word Representation | 2024 | 2020s"}
{"id":"hopper-2023-mittal","year":2023,"award_slug":"grace-murray-hopper-award","person_names":["Prateek Mittal"],"person_slugs":["prateek-mittal"],"title":"Cross-layer internet privacy and security","kind":"laureate","topics":["security","privacy","internet"],"institutions":["Princeton University"],"significance":"Recognized foundational work on protecting internet privacy and security through cross-layer methods spanning networks, anonymity, and machine learning.","event_source_label":"2023 ACM technical awards announcement","event_source_url":"https://awards.acm.org/about/2023-technical-awards","related_works":[{"title":"Prateek Mittal research profile","type":"profile","year":2023,"url":"https://www.cs.princeton.edu/~pmittal/","source_quality":"contextual"}],"award_name":"Grace Hopper Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/hopper","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Prateek Mittal","decade":"2020s","featured":false,"search_blob":"Cross-layer internet privacy and security | ACM Grace Murray Hopper Award | Grace Hopper Award | Highlights a single recent generation-defining contribution from a young computing professional. | Prateek Mittal | security privacy internet | Princeton University | Recognized foundational work on protecting internet privacy and security through cross-layer methods spanning networks, anonymity, and machine learning. | Prateek Mittal research profile | 2023 | 2020s"}
{"id":"knuth-2023-tardos","year":2023,"award_slug":"knuth-prize","person_names":["Éva Tardos"],"person_slugs":["eva-tardos"],"title":"Algorithms, approximation, and game theory","kind":"laureate","topics":["algorithms","approximation algorithms","algorithmic game theory"],"institutions":["Cornell University"],"significance":"Recognized career-defining contributions to combinatorial optimization, approximation algorithms, and algorithmic game theory.","event_source_label":"2023 Knuth Prize citation","event_source_url":"https://sigact.org/prizes/knuth/citation2023.html","related_works":[{"title":"Algorithm Design","type":"book","year":2005,"url":"https://www.cs.princeton.edu/~wayne/kleinberg-tardos/","source_quality":"contextual"}],"award_name":"Knuth Prize","award_category":"theory_award","official_program_label":"Official awards page / index","official_program_url":"https://sigact.org/prizes/knuth-prize/","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Éva Tardos","decade":"2020s","featured":false,"search_blob":"Algorithms, approximation, and game theory | Donald E. Knuth Prize | Knuth Prize | Celebrates landmark achievements in theoretical computer science across a career. | Éva Tardos | algorithms approximation algorithms algorithmic game theory | Cornell University | Recognized career-defining contributions to combinatorial optimization, approximation algorithms, and algorithmic game theory. | Algorithm Design | 2023 | 2020s"}
{"id":"vldb-2023-distributed-graphlab","year":2023,"award_slug":"vldb-ten-year-award","person_names":["Yucheng Low","Joseph Gonzalez","Aapo Kyrola","Danny Bickson","Carlos Guestrin","Joseph M. Hellerstein"],"person_slugs":["yucheng-low","joseph-gonzalez","aapo-kyrola","danny-bickson","carlos-guestrin","joseph-m-hellerstein"],"title":"Distributed GraphLab for machine learning in the cloud","kind":"paper_award","topics":["machine learning systems","distributed systems","databases"],"institutions":["Carnegie Mellon University","University of California, Berkeley"],"significance":"Recognized a test-of-time systems paper that helped shape large-scale graph-parallel machine learning and cloud analytics infrastructure.","event_source_label":"VLDB 2023 conference awards","event_source_url":"https://vldb.org/2023/?conference-awards","related_works":[{"title":"Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud","type":"paper","year":2012,"url":"https://www.vldb.org/pvldb/vol5/p716_yuchenglow_vldb2012.pdf","source_quality":"canonical"}],"award_name":"VLDB 10-Year Award","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://www.vldb.org/awards.html","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, Joseph M. Hellerstein","decade":"2020s","featured":false,"search_blob":"Distributed GraphLab for machine learning in the cloud | VLDB 10-Year Best Paper Award | VLDB 10-Year Award | Recognizes database papers whose importance is clear over a ten-year horizon. | Yucheng Low Joseph Gonzalez Aapo Kyrola Danny Bickson Carlos Guestrin Joseph M. Hellerstein | machine learning systems distributed systems databases | Carnegie Mellon University University of California, Berkeley | Recognized a test-of-time systems paper that helped shape large-scale graph-parallel machine learning and cloud analytics infrastructure. | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2023 | 2020s"}
{"id":"aaai-classic-2020-junker","year":2020,"award_slug":"aaai-classic-paper-award","person_names":["Ulrich Junker"],"person_slugs":["ulrich-junker"],"title":"Preferred explanations in over-constrained systems","kind":"paper_award","topics":["artificial intelligence","constraint satisfaction","preference reasoning"],"institutions":["ILOG"],"significance":"Recognized influential work on formalizing and computing user-preferred failure explanations in over-constrained problems.","related_works":[{"title":"QuickXPlain: Preferred Explanations and Relaxations for Over-Constrained Problems","type":"paper","year":2004,"url":"https://aaai.org/Papers/AAAI/2004/AAAI04-027.pdf","source_quality":"canonical"}],"award_name":"AAAI Classic Paper","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://aaai.org/about-aaai/aaai-awards/aaai-classic-paper-award/","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Ulrich Junker","decade":"2020s","featured":false,"search_blob":"Preferred explanations in over-constrained systems | AAAI Classic Paper Award | AAAI Classic Paper | Revisits AI conference papers whose importance becomes more visible over time. | Ulrich Junker | artificial intelligence constraint satisfaction preference reasoning | ILOG | Recognized influential work on formalizing and computing user-preferred failure explanations in over-constrained problems. | QuickXPlain: Preferred Explanations and Relaxations for Over-Constrained Problems | 2020 | 2020s"}
{"id":"turing-2020-compilers","year":2020,"award_slug":"turing-award","person_names":["Alfred V. Aho","Monica S. Lam","Ravi Sethi","Jeffrey D. Ullman"],"person_slugs":["alfred-v-aho","monica-s-lam","ravi-sethi","jeffrey-d-ullman"],"title":"Compilers and education at scale","kind":"laureate","topics":["compilers","programming languages","computer science education"],"institutions":["Columbia University","Stanford University"],"significance":"Honored the theory, textbooks, and compiler methods that trained generations of software engineers.","related_works":[{"title":"Compilers: Principles, Techniques, and Tools","type":"book","year":1986,"url":"https://www.informit.com/store/compilers-principles-techniques-and-tools-9780321486813","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman","decade":"2020s","featured":false,"search_blob":"Compilers and education at scale | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Alfred V. Aho Monica S. Lam Ravi Sethi Jeffrey D. Ullman | compilers programming languages computer science education | Columbia University Stanford University | Honored the theory, textbooks, and compiler methods that trained generations of software engineers. | Compilers: Principles, Techniques, and Tools | 2020 | 2020s"}
{"id":"vldb-2020-dremel","year":2020,"award_slug":"vldb-ten-year-award","person_names":["Sergey Melnik","Andrey Gubarev","Jing Jing Long","Geoffrey Romer","Shiva Shivakumar","Matt Tolton","Theo Vassilakis"],"person_slugs":["sergey-melnik","andrey-gubarev","jing-jing-long","geoffrey-romer","shiva-shivakumar","matt-tolton","theo-vassilakis"],"title":"Dremel and interactive web-scale analytics","kind":"paper_award","topics":["databases","data analytics","distributed systems"],"institutions":["Google"],"significance":"Recognized the columnar interactive-query architecture that influenced modern cloud analytics systems and SQL warehouses.","event_source_label":"2020 VLDB Endowment Awards","event_source_url":"https://vldb2020.org/vldb-endowment-awards.html","related_works":[{"title":"Dremel: Interactive Analysis of Web-Scale Datasets","type":"paper","year":2010,"url":"https://research.google/pubs/dremel-interactive-analysis-of-web-scale-datasets/","source_quality":"canonical"}],"featured":true,"award_name":"VLDB 10-Year Award","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://www.vldb.org/awards.html","source_scope":"event-level","citation_specificity":"year-specific-or-event-specific","person_label":"Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, Theo Vassilakis","decade":"2020s","search_blob":"Dremel and interactive web-scale analytics | VLDB 10-Year Best Paper Award | VLDB 10-Year Award | Recognizes database papers whose importance is clear over a ten-year horizon. | Sergey Melnik Andrey Gubarev Jing Jing Long Geoffrey Romer Shiva Shivakumar Matt Tolton Theo Vassilakis | databases data analytics distributed systems | Google | Recognized the columnar interactive-query architecture that influenced modern cloud analytics systems and SQL warehouses. | Dremel: Interactive Analysis of Web-Scale Datasets | 2020 | 2020s"}
{"id":"icde-2018-k-anonymity-networks","year":2018,"award_slug":"icde-influential-paper-award","person_names":["Bin Zhou","Jian Pei"],"person_slugs":["bin-zhou","jian-pei"],"title":"Privacy preservation through k-anonymity in social networks","kind":"paper_award","topics":["databases","privacy","graph data"],"institutions":["Simon Fraser University"],"significance":"Highlighted influential early work on privacy-preserving publication of social-network data using k-anonymity ideas adapted to graphs.","related_works":[{"title":"Preserving Privacy in Social Networks Against Neighborhood Attacks","type":"paper","year":2008,"url":"https://doi.org/10.1109/ICDE.2008.4497459","source_quality":"canonical"}],"award_name":"ICDE Influential Paper","award_category":"paper_award","official_program_label":"Official awards page / index","official_program_url":"https://tab.computer.org/tcde/icde_inf_paper.html","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Bin Zhou, Jian Pei","decade":"2010s","featured":false,"search_blob":"Privacy preservation through k-anonymity in social networks | ICDE 10-Year Influential Paper Award | ICDE Influential Paper | Surfaces influential data engineering work through a ten-year retrospective lens. | Bin Zhou Jian Pei | databases privacy graph data | Simon Fraser University | Highlighted influential early work on privacy-preserving publication of social-network data using k-anonymity ideas adapted to graphs. | Preserving Privacy in Social Networks Against Neighborhood Attacks | 2018 | 2010s"}
{"id":"turing-2018-deep-learning","year":2018,"award_slug":"turing-award","person_names":["Yoshua Bengio","Geoffrey Hinton","Yann LeCun"],"person_slugs":["yoshua-bengio","geoffrey-hinton","yann-lecun"],"title":"Deep learning renaissance","kind":"laureate","topics":["artificial intelligence","deep learning","computer vision"],"institutions":["Université de Montréal","University of Toronto","New York University"],"significance":"Recognized the neural network advances that transformed modern AI, vision, speech, and generative systems.","related_works":[{"title":"Deep Learning","type":"book","year":2016,"url":"https://www.deeplearningbook.org/","source_quality":"canonical"},{"title":"Gradient-Based Learning Applied to Document Recognition","type":"paper","year":1998,"url":"https://ieeexplore.ieee.org/document/726791","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Yoshua Bengio, Geoffrey Hinton, Yann LeCun","decade":"2010s","search_blob":"Deep learning renaissance | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Yoshua Bengio Geoffrey Hinton Yann LeCun | artificial intelligence deep learning computer vision | Université de Montréal University of Toronto New York University | Recognized the neural network advances that transformed modern AI, vision, speech, and generative systems. | Deep Learning Gradient-Based Learning Applied to Document Recognition | 2018 | 2010s"}
{"id":"turing-2013-lamport","year":2013,"award_slug":"turing-award","person_names":["Leslie Lamport"],"person_slugs":["leslie-lamport"],"title":"Distributed systems theory and practice","kind":"laureate","topics":["distributed systems","concurrency","formal specification"],"institutions":["Microsoft Research"],"significance":"Unified algorithms, clocks, consensus thinking, and formal specification for reliable distributed systems.","related_works":[{"title":"Time, Clocks, and the Ordering of Events in a Distributed System","type":"paper","year":1978,"url":"https://dl.acm.org/doi/10.1145/359545.359563","source_quality":"canonical"},{"title":"LaTeX","type":"software","year":1984,"url":"https://www.latex-project.org/","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Leslie Lamport","decade":"2010s","search_blob":"Distributed systems theory and practice | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Leslie Lamport | distributed systems concurrency formal specification | Microsoft Research | Unified algorithms, clocks, consensus thinking, and formal specification for reliable distributed systems. | Time, Clocks, and the Ordering of Events in a Distributed System LaTeX | 2013 | 2010s"}
{"id":"turing-2011-pearl","year":2011,"award_slug":"turing-award","person_names":["Judea Pearl"],"person_slugs":["judea-pearl"],"title":"Probabilistic reasoning and causal inference","kind":"laureate","topics":["artificial intelligence","machine learning","causality"],"institutions":["UCLA"],"significance":"Moved probabilistic networks and causal reasoning into the core language of intelligent systems.","related_works":[{"title":"Probabilistic Reasoning in Intelligent Systems","type":"book","year":1988,"url":"https://shop.elsevier.com/books/probabilistic-reasoning-in-intelligent-systems/pearl/978-0-08-051489-5","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Judea Pearl","decade":"2010s","featured":false,"search_blob":"Probabilistic reasoning and causal inference | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Judea Pearl | artificial intelligence machine learning causality | UCLA | Moved probabilistic networks and causal reasoning into the core language of intelligent systems. | Probabilistic Reasoning in Intelligent Systems | 2011 | 2010s"}
{"id":"turing-2004-cerf-kahn","year":2004,"award_slug":"turing-award","person_names":["Vinton G. Cerf","Robert E. Kahn"],"person_slugs":["vinton-g-cerf","robert-e-kahn"],"title":"Internet protocol architecture","kind":"laureate","topics":["internet","networking","protocols"],"institutions":["MCI","DARPA"],"significance":"Recognized TCP/IP architecture as the backbone of the public internet and modern distributed applications.","related_works":[{"title":"A Protocol for Packet Network Intercommunication","type":"paper","year":1974,"url":"https://dl.acm.org/doi/10.1109/TCOM.1974.1092259","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Vinton G. Cerf, Robert E. Kahn","decade":"2000s","search_blob":"Internet protocol architecture | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Vinton G. Cerf Robert E. Kahn | internet networking protocols | MCI DARPA | Recognized TCP/IP architecture as the backbone of the public internet and modern distributed applications. | A Protocol for Packet Network Intercommunication | 2004 | 2000s"}
{"id":"turing-1998-gray","year":1998,"award_slug":"turing-award","person_names":["Jim Gray"],"person_slugs":["jim-gray"],"title":"Transaction processing and fault tolerance","kind":"laureate","topics":["databases","transaction processing","reliability"],"institutions":["Microsoft Research"],"significance":"Elevated transactions, recoverability, and dependable data systems into standard infrastructure design principles.","related_works":[{"title":"Transaction Processing: Concepts and Techniques","type":"book","year":1992,"url":"https://www.sciencedirect.com/book/9781558601901/transaction-processing","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Jim Gray","decade":"1990s","featured":false,"search_blob":"Transaction processing and fault tolerance | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Jim Gray | databases transaction processing reliability | Microsoft Research | Elevated transactions, recoverability, and dependable data systems into standard infrastructure design principles. | Transaction Processing: Concepts and Techniques | 1998 | 1990s"}
{"id":"turing-1996-pnueli","year":1996,"award_slug":"turing-award","person_names":["Amir Pnueli"],"person_slugs":["amir-pnueli"],"title":"Temporal logic in program and system verification","kind":"laureate","topics":["formal methods","verification","logic"],"institutions":["Weizmann Institute of Science"],"significance":"Connected temporal logic to the verification of reactive systems and modern model checking workflows.","related_works":[{"title":"The Temporal Logic of Programs","type":"paper","year":1977,"url":"https://dl.acm.org/doi/10.1109/SFCS.1977.32","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Amir Pnueli","decade":"1990s","featured":false,"search_blob":"Temporal logic in program and system verification | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Amir Pnueli | formal methods verification logic | Weizmann Institute of Science | Connected temporal logic to the verification of reactive systems and modern model checking workflows. | The Temporal Logic of Programs | 1996 | 1990s"}
{"id":"turing-1994-feigenbaum-reddy","year":1994,"award_slug":"turing-award","person_names":["Edward A. Feigenbaum","Raj Reddy"],"person_slugs":["edward-a-feigenbaum","raj-reddy"],"title":"Knowledge-based artificial intelligence","kind":"laureate","topics":["artificial intelligence","expert systems","knowledge representation"],"institutions":["Stanford University","Carnegie Mellon University"],"significance":"Marked the rise of large knowledge-based AI systems and expert-system reasoning as a defining computing frontier.","related_works":[{"title":"The Fifth Generation","type":"book","year":1983,"url":"https://archive.org/details/fifthgenerationa00feigrich","source_quality":"contextual"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Edward A. Feigenbaum, Raj Reddy","decade":"1990s","search_blob":"Knowledge-based artificial intelligence | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Edward A. Feigenbaum Raj Reddy | artificial intelligence expert systems knowledge representation | Stanford University Carnegie Mellon University | Marked the rise of large knowledge-based AI systems and expert-system reasoning as a defining computing frontier. | The Fifth Generation | 1994 | 1990s"}
{"id":"turing-1990-corbato","year":1990,"award_slug":"turing-award","person_names":["Fernando J. Corbató"],"person_slugs":["fernando-j-corbato"],"title":"Time-sharing systems and Multics","kind":"laureate","topics":["operating systems","time sharing","computer systems"],"institutions":["MIT"],"significance":"Recognized pioneering work that made large-scale multi-user operating systems practical and influential.","related_works":[{"title":"An Experimental Time-Sharing System","type":"paper","year":1962,"url":"https://dl.acm.org/doi/10.1145/1460833.1460841","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Fernando J. Corbató","decade":"1990s","featured":false,"search_blob":"Time-sharing systems and Multics | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Fernando J. Corbató | operating systems time sharing computer systems | MIT | Recognized pioneering work that made large-scale multi-user operating systems practical and influential. | An Experimental Time-Sharing System | 1990 | 1990s"}
{"id":"turing-1986-hopcroft-tarjan","year":1986,"award_slug":"turing-award","person_names":["John E. Hopcroft","Robert E. Tarjan"],"person_slugs":["john-e-hopcroft","robert-e-tarjan"],"title":"Efficient data structures and graph algorithms","kind":"laureate","topics":["algorithms","graph theory","data structures"],"institutions":["Cornell University","Princeton University"],"significance":"Brought asymptotically efficient graph and set algorithms into the standard toolkit of computer science.","related_works":[{"title":"Efficient Planarity Testing","type":"paper","year":1974,"url":"https://dl.acm.org/doi/10.1145/321850.321852","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"John E. Hopcroft, Robert E. Tarjan","decade":"1980s","featured":false,"search_blob":"Efficient data structures and graph algorithms | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | John E. Hopcroft Robert E. Tarjan | algorithms graph theory data structures | Cornell University Princeton University | Brought asymptotically efficient graph and set algorithms into the standard toolkit of computer science. | Efficient Planarity Testing | 1986 | 1980s"}
{"id":"turing-1983-ritchie-thompson","year":1983,"award_slug":"turing-award","person_names":["Dennis M. Ritchie","Ken Thompson"],"person_slugs":["dennis-m-ritchie","ken-thompson"],"title":"Unix and C as systems foundations","kind":"laureate","topics":["operating systems","programming languages","software tools"],"institutions":["Bell Labs"],"significance":"Honored the Unix operating system and C language lineage that shaped systems, networks, and developer culture.","related_works":[{"title":"The UNIX Time-Sharing System","type":"paper","year":1974,"url":"https://dl.acm.org/doi/10.1145/361011.361061","source_quality":"canonical"},{"title":"The C Programming Language","type":"book","year":1978,"url":"https://www.informit.com/store/c-programming-language-9780131103627","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Dennis M. Ritchie, Ken Thompson","decade":"1980s","search_blob":"Unix and C as systems foundations | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Dennis M. Ritchie Ken Thompson | operating systems programming languages software tools | Bell Labs | Honored the Unix operating system and C language lineage that shaped systems, networks, and developer culture. | The UNIX Time-Sharing System The C Programming Language | 1983 | 1980s"}
{"id":"turing-1978-codd","year":1978,"award_slug":"turing-award","person_names":["Edgar F. Codd"],"person_slugs":["edgar-f-codd"],"title":"Relational model for shared data banks","kind":"laureate","topics":["databases","data models","query languages"],"institutions":["IBM"],"significance":"Established the relational model that shaped SQL, query processing, and modern data management.","related_works":[{"title":"A Relational Model of Data for Large Shared Data Banks","type":"paper","year":1970,"url":"https://dl.acm.org/doi/10.1145/362384.362685","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Edgar F. Codd","decade":"1970s","search_blob":"Relational model for shared data banks | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Edgar F. Codd | databases data models query languages | IBM | Established the relational model that shaped SQL, query processing, and modern data management. | A Relational Model of Data for Large Shared Data Banks | 1978 | 1970s"}
{"id":"turing-1972-dijkstra","year":1972,"award_slug":"turing-award","person_names":["Edsger W. Dijkstra"],"person_slugs":["edsger-w-dijkstra"],"title":"Structured programming and algorithmic clarity","kind":"laureate","topics":["algorithms","programming methodology","operating systems"],"institutions":["Eindhoven University of Technology"],"significance":"Made rigor, correctness, and structured programming central to modern software engineering.","related_works":[{"title":"Go To Statement Considered Harmful","type":"article","year":1968,"url":"https://doi.org/10.1145/362929.362947","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Edsger W. Dijkstra","decade":"1970s","search_blob":"Structured programming and algorithmic clarity | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Edsger W. Dijkstra | algorithms programming methodology operating systems | Eindhoven University of Technology | Made rigor, correctness, and structured programming central to modern software engineering. | Go To Statement Considered Harmful | 1972 | 1970s"}
{"id":"turing-1968-hamming","year":1968,"award_slug":"turing-award","person_names":["Richard W. Hamming"],"person_slugs":["richard-w-hamming"],"title":"Reliable numerical and coding methods","kind":"laureate","topics":["information theory","coding theory","numerical methods"],"institutions":["Bell Labs"],"significance":"Highlighted foundational work on error-correcting codes and dependable numerical computing.","related_works":[{"title":"Error Detecting and Error Correcting Codes","type":"paper","year":1950,"url":"https://ieeexplore.ieee.org/document/6772729","source_quality":"canonical"}],"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Richard W. Hamming","decade":"1960s","featured":false,"search_blob":"Reliable numerical and coding methods | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Richard W. Hamming | information theory coding theory numerical methods | Bell Labs | Highlighted foundational work on error-correcting codes and dependable numerical computing. | Error Detecting and Error Correcting Codes | 1968 | 1960s"}
{"id":"turing-1966-perlis","year":1966,"award_slug":"turing-award","person_names":["Alan J. Perlis"],"person_slugs":["alan-j-perlis"],"title":"First Turing Award laureate","kind":"laureate","topics":["programming languages","compiler design","education"],"institutions":["Carnegie Mellon University"],"significance":"Recognized for advanced compiler construction techniques and early leadership in computer science education.","related_works":[{"title":"Epigrams on Programming","type":"article","year":1982,"url":"https://doi.org/10.1145/947955.1083808","source_quality":"canonical"}],"featured":true,"award_name":"Turing Award","award_category":"major_award","official_program_label":"Official awards page / index","official_program_url":"https://awards.acm.org/turing","event_source_label":null,"event_source_url":null,"source_scope":"program-level","citation_specificity":"not-year-specific","person_label":"Alan J. Perlis","decade":"1960s","search_blob":"First Turing Award laureate | ACM A.M. Turing Award | Turing Award | Often described as the highest distinction in computer science, honoring lasting technical contributions across the field. | Alan J. Perlis | programming languages compiler design education | Carnegie Mellon University | Recognized for advanced compiler construction techniques and early leadership in computer science education. | Epigrams on Programming | 1966 | 1960s"}