Our dual objective is to pursue basic research on a broad range of theoretical topics and to impact real-world issues by applying our expertise to solving problems for IBM and its clients.

We do basic research in a number of areas of theoretical computer science, including approximation algorithms, combinatorics, complexity theory, computational geometry, distributed systems, learning theory, online algorithms, cryptography and quantum computing.

IBM researchers have access to an extensive array of challenging problems that motivate innovative solutions and, at the same time, constantly push the theoretical state-of-the-art with the development of new algorithms and new optimization techniques. We provide innovative, custom solutions to business and industrial problems that are at the boundaries of what can be solved today.

Please see the pages for the individual groups for possible job openings.

Almaden Research Center

Research Staff

• Miklos Ajtai: Complexity theory, cryptography, lattice-based algorithms.
• Ken Clarkson: Computational geometry, design and analysis of algorithms, optimization.
• Ronald Fagin: Logic, complexity theory, database principles, reasoning about knowledge, information retrieval.
• Vitaly Feldman: Learning theory, computational models of the brain, complexity theory.
• T. S. Jayram: Complexity theory, algorithms for massive data sets.
• Phokion Kolaitis: Logic in computer science, computational complexity, database theory.
  
• Nimrod Megiddo: Optimization, machine learning.
• Jan Vondrak: Approximation algorithms, matroids and submodular functions, truthful mechanism design.
• David Woodruff: Algorithms, complexity theory, cryptography.

Postdoctoral Fellows

• Moritz Hardt: Sensitive data analysis, algorithms, complexity and learning theory.
• Qin Zhang: Algorithms for massive, streaming, or distributed data; external memory algorithms.

Watson Research Center

Research Staff

• Satyen Kale: Optimization algorithms, machine learning.
• Viswanath Nagarajan: Combinatorial optimization, approximation algorithms.
• Krzysztof Onak: Sublinear-time algorithms, property testing, streaming, algorithms for massive data sets.
• Baruch Schieber: Optimization, approximation algorithms.

Postdoctoral Fellows

• Rishi Saket: Hardness of approximation.

IBM Research – India

Research Staff

• Venkat Chakaravarthy: Theory of computing, complexity theory.
• Vinayaka Pandit: Algorithms, combinatorial optimization, mathematical programming.
• Sambuddha Roy: Complexity theory, combinatorics, approximation algorithms.
• Yogish Sabharwal: High performance computing, computational geometry, approximation algorithms.

See also