World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
53
Citations
8103
World Ranking
4926
National Ranking
2288

Overview

Deepak Kapur is affiliated with the University of New Mexico in the United States and works primarily in the field of Computer Science. Their research spans several subfields, with a strong focus on Computational Theory and Mathematics, Artificial Intelligence, and Computational Mechanics. Additional contributions touch on Computer Networks and Communications as well as Information Systems.

The scientist's recent publications illustrate a breadth of topics within theoretical computer science. Selected papers include:

  • An Algorithm for Computing a Minimal Comprehensive Gröbner Basis of a Parametric Polynomial System, 2020, arXiv (Cornell University)
  • Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties, 2023, Logical Methods in Computer Science
  • Uniform Interpolants in EUF: Algorithms using DAG-representations, 2022, Logical Methods in Computer Science
  • Interpolation Results for Arrays with Length and MaxDiff, 2023, ACM Transactions on Computational Logic
  • Deciding the Word Problem for Ground and Strongly Shallow Identities with respect to Extensional Symbols, 2022, Journal of Automated Reasoning

Kapur's research addresses diverse topics such as logic, programming, and type systems; formal methods in verification; polynomial and algebraic computation; semigroups and automata theory; advanced numerical analysis techniques; as well as logic, reasoning, and knowledge. These areas represent key thematic strands within their career.

  • Logic, programming, and type systems
  • Formal Methods in Verification
  • Polynomial and algebraic computation
  • Semigroups and automata theory
  • Advanced Numerical Analysis Techniques
  • Logic, Reasoning, and Knowledge
  • Numerical Methods and Algorithms

Frequent collaborators with Kapur include Silvio Ghilardi, Alessandro Gianola, Chiara Naso, Franz Baader, and Wayne Witzel. These collaborations indicate an active engagement with peers specializing in related theoretical and computational topics.

  • Silvio Ghilardi
  • Alessandro Gianola
  • Chiara Naso
  • Franz Baader
  • Wayne Witzel

The scientist often publishes in venues focusing on logic and formal methods including arXiv (Cornell University), Logical Methods in Computer Science, ACM Transactions on Computational Logic, Journal of Automated Reasoning, and Proceedings on Privacy Enhancing Technologies. These venues reflect the academic communities to which Kapur contributes.

  • arXiv (Cornell University)
  • Logical Methods in Computer Science
  • ACM Transactions on Computational Logic
  • Journal of Automated Reasoning
  • Proceedings on Privacy Enhancing Technologies

Overall, Deepak Kapur's scholarly work integrates advanced theoretical and computational approaches within computer science, contributing across several intersecting disciplines and collaborating with a range of experts in the field.

Best Publications

  • Solving Polynomial Systems Using a Branch and Prune Approach

    Pascal Van Hentenryck;David McAllester;Deepak Kapur

  • An overview of Rewrite Rule Laboratory (RRL)

    D. Kapur;H. Zhang

  • An equational approach to theorem proving in first-order predicate calculus

    Deepak Kapur;Paliath Narendran

  • Algebraic and geometric reasoning using Dixon resultants

    Deepak Kapur;Tushar Saxena;Lu Yang

  • Complexity of matching problems

    Dan Benanav;Deepak Kapur;Paliath Narendran

  • Proof by consistency

    Deepak Kapur;David R. Musser

  • Using Gröbner bases to reason about geometry problems

    Deepak Kapur

  • NP-completeness of the set unification and matching problems

    Deepak Kapur;Paliath Narendran

  • Geometric reasoning

    Deepak Kapur;Joseph L. Mundy

  • Generating all polynomial invariants in simple loops

    E. Rodríguez-Carbonell;D. Kapur

  • A Mechanizable Induction Principle for Equational Specifications

    Hantao Zhang;Deepak Kapur;Deepak Kapur;Mukkai S. Krishnamoorthy

  • On sufficient-completeness and related properties of term rewriting systems

    Deepak Kapur;Paliath Narendran;Hantao Zhang

  • Geometry theorem proving using Hilbert's Nullstellensatz

    Deepak Kapur

  • Automatically Generating Loop Invariants Using Quantifier Elimination

    Deepak Kapur

  • Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations

    Enric Rodríguez-Carbonell;Deepak Kapur

  • Automatic generation of polynomial invariants of bounded degree using abstract interpretation

    E. Rodríguez-Carbonell;D. Kapur

  • Complexity of unification problems with associative-commutative operators

    Deepak Kapur;Paliath Narendran

  • Interpolation for data structures

    Deepak Kapur;Rupak Majumdar;Calogero G. Zarba

  • A finite thue system with decidable word problem and without equivalent finite canonical system

    Deepak Kapur;Paliath Narendran

  • Shostak's Congruence Closure as Completion

    Deepak Kapur

  • A refutational approach to geometry theorem proving

    Deepak Kapur

Frequent Co-Authors

Joseph L. Mundy
Joseph L. Mundy Brown University
Manuel V. Hermenegildo
Manuel V. Hermenegildo Madrid Institute for Advanced Studies
Stephanie Forrest
Stephanie Forrest Arizona State University
Westley Weimer
Westley Weimer University of Michigan–Ann Arbor
Jürgen Giesl
Jürgen Giesl RWTH Aachen University
José Meseguer
José Meseguer University of Illinois at Urbana-Champaign
Catherine Meadows
Catherine Meadows United States Naval Research Laboratory
Christopher S. Lynch
Christopher S. Lynch University of California, Riverside
Daniel J. Rosenkrantz
Daniel J. Rosenkrantz University of Virginia

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

If you are considering a Computer Science degree in the USA, there are several related online programs and career pathways worth exploring. Many students find that combining computer science skills with expertise in other technical fields opens up additional job opportunities. For example, an environmental engineering bachelor's degree online prepares graduates to address technology-driven sustainability issues—a sector where programming and data skills are in high demand.

Similarly, pursuing an online mechanical engineering degree can lead to roles at the intersection of hardware, robotics, and software development. Those interested in scientific applications may also benefit from online physics degrees, which lay the foundation for careers in research, simulation, and technology-driven analysis.

For students focused on data and AI, enrolling in the cheapest data science degree programs can provide valuable skills in big data, analytics, and machine learning. Each of these pathways is available online, providing flexibility to tailor your education directly to your career goals in today’s technology landscape.

Best Scientists Citing Deepak Kapur

Trending Scientists