World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
62
Citations
16441
World Ranking
2885
National Ranking
1418

Research.com Recognitions

  • 2017 - ACM Fellow For contributions to algorithmic coding theory, pseudorandomness, and the complexity of approximate optimization
  • 2005 - Fellow of Alfred P. Sloan Foundation

Overview

Venkatesan Guruswami is affiliated with the University of California, Berkeley in the United States. Their research spans across various subfields of computer science, including computational theory and mathematics, computer networks and communications, artificial intelligence, molecular biology, and electrical and electronic engineering.

Their work covers multiple main topics such as coding theory and cryptography, complexity and algorithms in graphs, advanced data storage technologies, advanced graph theory research, DNA and biological computing, advanced biosensing and bioanalysis techniques, and error correcting code techniques.

Several recent papers highlight their contributions to the field:

  • Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound, 2021, IEEE Transactions on Information Theory
  • Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields, 2020, IEEE Transactions on Information Theory
  • Fair Correlation Clustering in General Graphs, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

They have frequently published in the following venues:

  • arXiv (Cornell University)
  • IEEE Transactions on Information Theory
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • SIAM Journal on Discrete Mathematics

Notable frequent co-authors include Sai Sandeep, Ray Li, Pravesh K. Kothari, Peter Manohar, and Jonathan Mosheiff.

Venkatesan Guruswami has been recognized as an ACM Fellow in 2017 for contributions to algorithmic coding theory, pseudorandomness, and the complexity of approximate optimization. They were also named a Fellow of the Alfred P. Sloan Foundation in 2005.

Best Publications

  • Improved decoding of Reed-Solomon and algebraic-geometry codes

    V. Guruswami;M. Sudan

  • Improved decoding of Reed-Solomon and algebraic-geometric codes.

    Venkatesan Guruswami;Madhu Sudan

  • Clustering with qualitative information

    Moses Charikar;Venkatesan Guruswami;Anthony Wirth

  • Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes

    Venkatesan Guruswami;Christopher Umans;Salil Vadhan

  • Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

    Venkatesan Guruswami;Sanjeev Khanna;Rajmohan Rajaraman;Bruce Shepherd

  • CopyCatch: stopping group attacks by spotting lockstep behavior in social networks

    Alex Beutel;Wanhong Xu;Venkatesan Guruswami;Christopher Palow

  • On profit-maximizing envy-free pricing

    Venkatesan Guruswami;Jason D. Hartline;Anna R. Karlin;David Kempe

  • List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition

    Venkatesan Guruswami

  • List Decoding of Error-Correcting Codes

    Venkatesan Guruswami;Madhu Sudan

  • Hardness of Learning Halfspaces with Noise

    Venkatesan Guruswami;Prasad Raghavendra

  • Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

    V. Guruswami;A. Rudra

  • Multiclass learning, boosting, and error-correcting codes

    Venkatesan Guruswami;Amit Sahai

  • A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

    Irit Dinur;Venkatesan Guruswami;Subhash Khot;Oded Regev

  • Repairing Reed-Solomon Codes

    Venkatesan Guruswami;Mary Wootters

  • Correlation Clustering with a Fixed Number of Clusters

    Ioannis Giotis;Venkatesan Guruswami

  • Efficient Low-Redundancy Codes for Correcting Multiple Deletions

    Joshua Brakensiek;Venkatesan Guruswami;Samuel Zbarsky

  • Superlinear Lower Bounds for Multipass Graph Processing

    Venkatesan Guruswami;Krzysztof Onak

  • Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

    Venkatesan Guruswami;Ali Kemal Sinop

  • Expander-based constructions of efficiently decodable codes

    V. Guruswami;P. Indyk

  • Optimal column-based low-rank matrix reconstruction

    Venkatesan Guruswami;Ali Kemal Sinop

  • 2006 IEEE International Symposium on Information Theory

    J. A. O'Sullivan;J. B. Anderson;A. Barg;A. Ashikhmin

Frequent Co-Authors

Madhu Sudan
Madhu Sudan Harvard University
Atri Rudra
Atri Rudra University at Buffalo, State University of New York
Prasad Raghavendra
Prasad Raghavendra University of California, Berkeley
Johan Håstad
Johan Håstad Royal Institute of Technology
Moses Charikar
Moses Charikar Stanford University
Sanjeev Khanna
Sanjeev Khanna University of Pennsylvania
Irit Dinur
Irit Dinur Weizmann Institute of Science
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Subhash Khot
Subhash Khot Courant Institute of Mathematical Sciences

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options can help you tailor your educational journey in Computer Science or related fields. Many students look for the cheapest online masters degree programs to gain advanced skills without taking on significant debt. Affordable options can make graduate studies more accessible and improve your competitiveness in the tech job market.

For those interested in leadership roles, pursuing a doctorate organizational leadership online offers avenues to move into executive or managerial positions across industries. Similarly, educators seeking higher credentials can consider an edd in educational leadership to lead curriculum innovation and institutional change.

If you’re just starting your higher education journey or need a fast path to employment, check out easy associate degrees available online. These programs typically offer quick entry into the workforce and can be stepping stones toward further studies in Computer Science. Choosing the right online degree ensures you meet your career goals in a flexible and cost-effective way.

Best Scientists Citing Venkatesan Guruswami

Trending Scientists

Recently Published Articles