World's Best Scientists 2026 revealed!
Jayant R. Kalagnanam

Jayant R. Kalagnanam

D-Index & Metrics

Computer Science

D-Index
39
Citations
14142
World Ranking
9498
National Ranking
4024

Overview

Jayant R. Kalagnanam is affiliated with IBM in the United States and has contributed extensively to research in computer science. Their work spans several specialized subfields including artificial intelligence, signal processing, management science and operations research, computer networks and communications, and control and systems engineering.

The scientist's research covers a number of key topics such as time series analysis and forecasting, anomaly detection techniques and applications, data stream mining techniques, neural networks and applications, machine learning and data classification, Gaussian processes and Bayesian inference, and fault detection and control systems.

Their publication record includes work in notable venues with multiple contributions to arXiv (Cornell University), where eleven papers have been published. Other significant publication venues include the Proceedings of the AAAI Conference on Artificial Intelligence (five publications), the 2021 IEEE International Conference on Big Data (two publications), the Journal of Global Optimization, and Computational Optimization and Applications.

Selected recent papers authored or coauthored by Jayant R. Kalagnanam include:

  • A Time Series is Worth 64 Words: Long-term Forecasting with Transformers, 2022, arXiv (Cornell University)
  • Optimal decision trees for categorical data via integer programming, 2021, Journal of Global Optimization
  • Finite-sum smooth optimization with SARAH, 2022, Computational Optimization and Applications
  • A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees, 2020, arXiv (Cornell University)

The scientist has collaborated frequently with several researchers, including Dzung T. Phan, Lam M. Nguyen, Vijay Ekambaram, Dhaval Patel, and Kyongmin Yeo. These collaborations reflect ongoing partnerships resulting in multiple joint publications.

Best Publications

  • QoS-aware middleware for Web services composition

    Liangzhao Zeng;B. Benatallah;A.H.H. Ngu;M. Dumas

  • Foundations for smarter cities

    C. Harrison;B. Eckman;R. Hamilton;P. Hartswick

  • Quality driven web services composition

    Liangzhao Zeng;Boualem Benatallah;Marlon Dumas;Jayant Kalagnanam

  • An efficient sampling technique for off-line quality control

    Jayant R. Kalagnanam;Urmila M. Diwekar

  • Achieving budget-balance with Vickrey-based payment schemes in exchanges

    David C. Parkes;Jayant Kalagnanam;Marta Eso

  • Efficient sampling technique for optimization under uncertainty

    Urmila M. Diwekar;Jayant R. Kalagnanam

  • Configurable offers and winner determination in multi-attribute auctions

    Martin Bichler;Jayant Kalagnanam

  • Improved bounds for computing Kemeny rankings

    Vincent Conitzer;Andrew Davenport;Jayant Kalagnanam

  • Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

    M. Dawande;J. Kalagnanam;P. Keskinocak;F.S. Salman

  • System and method for using virtual wish lists for assisting shopping over computer networks

    Juhnyoung Lee;Jayant R. Kalagnanam;Andrew J. Davenport;Ho Soo Lee

  • TSMixer: Lightweight MLP-Mixer Model for Multivariate Time Series Forecasting

    Unknown

  • Applications of flexible pricing in business-to-business electronic commerce

    M. Bichler;J. Kalagnanam;K. Katircioglu;A. J. King

  • Auctions, Bidding and Exchange Design

    Jayant Kalagnanam;David C. Parkes

  • Electronic shopping assistant and method of use

    Jayant R. Kalagnanam;Ying Tat Leung;Andrew J. Davenport;Juhnyoung Lee

  • A computational study of the Kemeny rule for preference aggregation

    Andrew Davenport;Jayant Kalagnanam

  • Some Efficient Optimization Methods for Solving the Security-Constrained Optimal Power Flow Problem

    Dzung Phan;Jayant Kalagnanam

  • Phase identification in smart grids

    V. Arya;D. Seetharam;S. Kalyanaraman;K. Dontas

  • The Surplus Inventory Matching Problem in the Process Industry

    Jayant R. Kalagnanam;Milind W. Dawande;Mark Trumbo;Ho Soo Lee

  • Industrial Procurement Auctions

    M. Bichler;J. Kalagnanam

  • Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand

    Jayant R. Kalagnanam;Andrew J. Davenport;Ho S. Lee

  • A comparison of decision alaysis and expert rules for sequential diagnosis

    Jayant Kalagnanam;Max Henrion

Frequent Co-Authors

Martin Bichler
Martin Bichler Technical University of Munich
Juhnyoung Lee
Juhnyoung Lee Seegene Inc.
David C. Parkes
David C. Parkes Harvard University
Urmila M. Diwekar
Urmila M. Diwekar University of Illinois at Chicago
Katya Scheinberg
Katya Scheinberg Cornell University
Arun Hampapur
Arun Hampapur Bloom Value
Marten van Dijk
Marten van Dijk University of Connecticut
H. Christopher Frey
H. Christopher Frey North Carolina State University
Shivkumar Kalyanaraman
Shivkumar Kalyanaraman Microsoft (India)

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 degrees in Computer Science unlocks a variety of flexible education and career options. For those eager to start working quickly, consider the fastest online degree programs—these can help you enter the tech workforce sooner, often in less than two years.

If you’re interested in future-focused areas, an artificial intelligence degree online offers hands-on experience with technologies shaping tomorrow’s industries. This pathway can lead to roles in machine learning, robotics, and data analysis.

Deciding what to study can be overwhelming, but exploring the best degrees for career advancement can help you make an informed choice. Computer Science consistently ranks highly due to strong job growth and earning potential.

Interested in advancing your credentials without a heavy workload? You can also look into easy masters programs that offer career boosts while being manageable for busy professionals.

Online study in these areas can be affordable, efficient, and aligned with high-demand jobs, making it easier than ever to build a rewarding tech career in the USA.

Best Scientists Citing Jayant R. Kalagnanam

Trending Scientists