World's Best Scientists 2026 revealed!

D-Index & Metrics

Engineering and Technology

D-Index
35
Citations
12458
World Ranking
8851
National Ranking
2458

Overview

Ashok K. Chandra was affiliated with IBM in the United States and contributed to the fields of Engineering and Business, Management and Accounting. Their research spanned multiple subfields including Media Technology, Aerospace Engineering, Strategy and Management, Management Information Systems, and Information Systems.

Their work was published across several venues, notably:

  • Orissa Journal of Commerce
  • SITECH Jurnal Sistem Informasi dan Teknologi
  • International Journal of Indian Culture and Business Management

Chandra's publications covered a variety of topics such as Telecommunications and Broadcasting Technologies, Satellite Communication Systems, Management and Optimization Techniques, Decision Support System Applications, and Multimedia Learning Systems.

Significant papers by the scientist included:

  • "Linking Transformational Leadership with Employee Engagement through Organizational Commitment and Organizational Culture" (2021, Orissa Journal of Commerce)
  • "Rancang Bangun Sistem Prediksi Penjualan Berbasis Web Dengan Metode Singe Moving Average" (2024, SITECH Jurnal Sistem Informasi dan Teknologi)
  • "Drivers of work engagement: analysing fundamental self-evaluations and psychological atmosphere in public and private banks in Chhattisgarh" (2025, International Journal of Indian Culture and Business Management)

The scientist frequently collaborated with several authors, including:

  • Vijaya Lakshmi Rakatu
  • Mahesh Kumar Soma
  • P S M Tripathi
  • Ambuj Kumar
  • K. Sridhara

Ashok K. Chandra's research integrated various interdisciplinary approaches, particularly linking technological aspects of engineering with managerial and organizational studies. Their body of work reflects engagement with both technical and human factors in organizational and communication systems.

Best Publications

  • Optimal implementation of conjunctive queries in relational data bases

    Ashok K. Chandra;Philip M. Merlin

  • A methodology for the real world

    Gregory J. Chaitin;Marc A. Auslander;Ashok K. Chandra;John Cocke

  • Alternation

    Unknown

  • Structure and complexity of relational queries

    Ashok K. Chandra;David Harel

  • The electrical resistance of a graph captures its commute and cover times

    Ashok K. Chandra;Prabhakar Raghavan;Walter L. Ruzzo;Roman Smolensky

  • Computable queries for relational data bases

    Ashok K. chandra;David Harel

  • The electrical resistance of a graph captures its commute and cover times

    A. K. Chandra;P. Raghavan;W. L. Ruzzo;R. Smolensky

  • Constant Depth Reducibility

    Ashok K. Chandra;Larry J. Stockmeyer;Uzi Vishkin

  • HORN CLAUSE QUERIES AND GENERALIZATIONS

    Ashok K. Chandra;David Harel

  • Computing connected components on parallel computers

    D. S. Hirschberg;A. K. Chandra;D. V. Sarwate

  • Multi-party protocols

    Ashok K. Chandra;Merrick L. Furst;Richard J. Lipton

  • A model for hierarchical memory

    A. Aggarwal;B. Alpern;A. Chandra;M. Snir

  • Communication complexity of PRAMs

    Alok Aggarwal;Ashok K. Chandra;Marc Snir

  • Application caching system and method

    Ashok Chandra;Neil Latarche;Jianchang Mao;Prabhakar Raghavan

  • Hierarchical memory with block transfer

    Alok Aggarwal;Ashok K. Chandra;Marc Snir

  • The Implication Problem for Functional and Inclusion Dependencies is Undecidable

    Ashok K. Chandra;Moshe Y. Vardi

  • Unbounded fan-in circuits and associative functions

    Ashok K. Chandra;Steven Fortune;Richard J. Lipton

  • On communication latency in PRAM computations

    A. Aggarwal;A. K. Chandra;M. Snir

  • Bounds for the String Editing Problem

    C. K. Wong;Ashok K. Chandra

  • Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation

    Ashok K. Chandra;C. K. Wong

  • Equivalence of free boolean graphs can be decided probabilistically in polynomial time

    Manuel Blum;Ashok K. Chandra;Mark N. Wegman

  • Provably Difficult Combinatorial Games

    Larry J. Stockmeyer;Ashok K. Chandra

Frequent Co-Authors

Alok Aggarwal
Alok Aggarwal IBM (United States)
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
David Harel
David Harel Weizmann Institute of Science
Marc Snir
Marc Snir University of Illinois at Urbana-Champaign
Larry J. Stockmeyer
Larry J. Stockmeyer IBM (United States)
Joseph Y. Halpern
Joseph Y. Halpern Cornell University
Walter L. Ruzzo
Walter L. Ruzzo University of Washington
Zohar Manna
Zohar Manna Stanford University
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park

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:

Best Scientists Citing Ashok K. Chandra