Deepak Kapur

Q: What Schools Are Affiliated With Deepak Kapur

Deepak Kapur is affiliated with the following schools: Massachusetts Institute of Technology, University of New Mexico

Deepak Kapur's AcademicInfluence.com Rankings

Deepak Kapur

Computer Science

#1730

World Rank

#1793

Historical Rank

Database

#4638

World Rank

#4818

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Deepak Kapur Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Deepak Kapur is a Distinguished Professor in the Department of Computer Science at the University of New Mexico. Biography Kapur was born in a lower-middle-class family based in Amritsar, where his father, Nawal Kishore Kapur, was a cloth broker; his mother, Bimla Vati, was a housewife.

(See a Problem?)

Deepak Kapur's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Solving Polynomial Systems Using a Branch and Prune Approach (1997) (329)
An Overview of Rewrite Rule Laboratory (RRL) (1989) (205)
Algebraic and geometric reasoning using Dixon resultants (1994) (171)
Geometric reasoning (1989) (150)
Proof by Consistency (1987) (149)
NP-Completeness of the Set Unification and Matching Problems (1986) (141)
Using Gröbner Bases to Reason About Geometry Problems (1986) (138)
An equational approach to theorem proving in first-order predicate calculus (1985) (137)
Complexity of Matching Problems (1985) (132)
A Mechanizable Induction Principle for Equational Specifications (1988) (129)
Generating all polynomial invariants in simple loops (2007) (127)
Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations (2004) (113)
Automatic generation of polynomial invariants of bounded degree using abstract interpretation (2007) (100)
Geometry theorem proving using Hilbert's Nullstellensatz (1986) (99)
Symbolic and Numerical Computation for Artificial Intelligence (1997) (99)
Interpolation for data structures (2006) (96)
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra (1989) (95)
Automatically Generating Loop Invariants Using Quantifier Elimination (2005) (93)
Shostak's Congruence Closure as Completion (1997) (93)
RRL: A Rewrite Rule Laboratory (1986) (93)
Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain (1988) (86)
A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System (1985) (85)
Using dynamic analysis to discover polynomial and array invariants (2012) (81)
A new algorithm for computing comprehensive Gröbner systems (2010) (81)
Comparison of various multivariate resultant formulations (1995) (77)
A Refutational Approach to Geometry Theorem Proving (1988) (76)
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants (2004) (74)
First-Order Theorem Proving Using Conditional Rewrite Rules (1988) (71)
Proof by Induction Using Test Sets (1986) (68)
Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure (1988) (67)
Idle Port Scanning and Non-interference Analysis of Network Protocol Stacks Using Model Checking (2010) (63)
Elimination methods: an introduction (1992) (60)
On Proving Uniform Termination and Restricted Termination of Rewriting Systems (1983) (60)
Reduction, superposition and induction: automated reasoning in an equational logic (1988) (57)
Wu's Method and its Application to Perspective Viewing (1988) (56)
Double-exponential complexity of computing a complete set of AC-unifiers (1992) (55)
On sufficient-completeness and related properties of term rewriting systems (1987) (54)
Automating Inductionless Induction Using Test Sets (1991) (54)
Termination Analysis of C Programs Using Compiler Intermediate Languages (2011) (52)
A Transformational Methodology for Proving Termination of Logic Programs (1991) (52)
The Knuth-Bendix Completion Procedure and Thue Systems (1985) (51)
On Ground-Confluence of Term Rewriting Systems (1990) (51)
Program Verification Using Automatic Generation of Invariants (2004) (50)
TOWARDS A THEORY FOR ABSTRACT DATA TYPES (1980) (49)
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation (2003) (47)
Dependency Pairs for Equational Rewriting (2001) (46)
A Path Ordering for Proving Termination of Term Rewriting Systems (1985) (46)
Complexity of unification problems with associative-commutative operators (1992) (46)
An Approach for Solving Systems of Parametric Polynomial Equations (1993) (46)
A Quantifier-Elimination Based Heuristic for Automatically Generating Inductive Assertions for Programs (2006) (45)
Lemma Discovery in Automated Induction (1996) (44)
Termination Analysis of Imperative Programs Using Bitvector Arithmetic (2012) (42)
Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings (1984) (40)
A New Method for Proving Termination of AC-Rewrite Systems (1990) (40)
Deciding Inductive Validity of Equations (2003) (39)
Sufficient-completeness, ground-reducibility and their complexity (1991) (38)
Tecton: A Framework for Specifying and Verifying Generic System Components (1992) (38)
Matching, unification and complexity (1987) (36)
Sharing analysis of arrays, collections, and recursive structures (2008) (36)
An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system (2013) (36)
Extraneous factors in the Dixon resultant formulation (1997) (35)
An Overview of the Tecton Proof System (1994) (35)
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (2008) (34)
Tecton: A Language for Manipulating Generic Objects (1981) (33)
Mechanically Verifying a Family of Multiplier Circuits (1996) (33)
Using dynamic analysis to generate disjunctive invariants (2014) (33)
DIG: A Dynamic Invariant Generator for Polynomial and Array Invariants (2014) (32)
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (2009) (32)
Semi-Unification (1988) (31)
Computing invariants using elimination methods (1995) (31)
An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (1985) (30)
Using an induction prover for verifying arithmetic circuits (2000) (30)
Sparsity considerations in Dixon resultants (1996) (29)
Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets (1996) (28)
Heap analysis in the presence of collection libraries (2007) (27)
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (1997) (26)
An efficient method for computing comprehensive Gröbner bases (2013) (26)
Decidable Classes of Inductive Theorems (2001) (25)
Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory (1998) (25)
Rewriting Induction + Linear Arithmetic = Decision Procedure (2012) (25)
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (2008) (25)
Inductive Reasoning with Incomplete Specifications (Preliminary Report) (1986) (24)
Automating Induction over Mutually Recursive Functions (1996) (24)
Refutational proofs of geometry theorems via characteristic set computation (1990) (24)
Extending Decision Procedures with Induction Schemes (2000) (24)
Quantifier Elimination for Conjunctions of Linear Constraints via a Convex Hull Algorithm (2013) (24)
New uses of linear arithmetic in automated theorem proving by induction (1995) (23)
A Reduction Approach to Decision Procedures (2005) (23)
An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems (1985) (22)
Hierarchical Combination (2013) (22)
Automating Proofs of Integrity Constraints in Situation Calculus (1996) (21)
Conditions for exact resultants using the Dixon formulation (2000) (21)
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation (2003) (20)
A new sylvester-type resultant method based on the dixon-bezout formulation (2003) (20)
A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example (2012) (20)
Protocol analysis in Maude-NPA using unification modulo homomorphic encryption (2011) (20)
Constructors can be Partial too (1997) (20)
Expressiveness of the operation set of a data abstraction (1980) (19)
Automated Reasoning About Parallel Algorithms Using Powerlists (1995) (19)
Identification of logically related heap regions (2009) (19)
Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions (2012) (19)
A Case Study of the Completion Procedure: Proving Ring Commutativity Problems (1991) (19)
Mechanizing Verification of Arithmetic Circuits: SRT Division (1997) (19)
Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models (2008) (19)
An automated tool for analyzing completeness of equational specifications (1994) (18)
Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (2013) (18)
A Rewrite Rule Based Framework for Combining Decision Procedures (2002) (18)
Inductive Decidability Using Implicit Induction (2006) (17)
A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework (2006) (17)
Synthesizing Controllers for Hybrid Systems (1997) (17)
Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume (1988) (17)
Nonlinear Polynomials, Interpolants and Invariant Generation for System Analysis (2017) (17)
Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (2013) (16)
Opening the AC-unification race (1988) (16)
Rewriting Concepts in the Study of Termination of Logic Programs (1992) (16)
Sufficient-completeness, ground-reducibility and their complexity (1992) (16)
Rewrite Rule Theory and Abstract Data Type Analysis (1982) (16)
Constructing Sylvester-type resultant matrices using the Dixon formulation (2004) (15)
Geometric interpretation of joint conic invariants (1992) (15)
Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation (2017) (15)
Specifications of Majster's traversable stack and Veloso's traversable stack (1979) (15)
An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors (2009) (14)
Fitting affine invariant conics to curves (1992) (14)
Sparsity considerations in the dixon resultant formulation (1996) (14)
Transformational Methodology for Proving Termination of Logic Programs (1998) (13)
Conditional Congruence Closure over Uninterpreted and Interpreted Symbols (2019) (13)
Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions (2003) (13)
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF (2016) (13)
On the Solutions of a Set of Polynomial Equations (2013) (13)
Consider Only General Superpositions in Completion Procedures (1989) (13)
Proving Associative-Communicative Termination Using RPO-Compatible Orderings (1998) (12)
Computability and Implementability Issues in Abstract Data Types (1988) (11)
A Rewrite Rule Based Approach for Synthesizing Abstract Data Types (1985) (11)
Operators and algebraic structures (1981) (11)
Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation (2004) (11)
Modeling generic polyhedral objects with constraints (1991) (11)
Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously (2011) (10)
A Multi-Level Geometric Reasoning System for Vision (1988) (10)
Reasoning about three dimensional space (1985) (10)
Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover (1996) (10)
On the efficiency and optimality of Dixon-based resultant methods (2002) (10)
Comparison of various multivariate resultants (1995) (10)
A survey: applying formal methods to a software intensive system (2001) (9)
The Tecton Proof System (1991) (9)
Induction and Decision Procedures (2004) (9)
Automatically Generating Loop Invariants Using Quantifier Elimination † -Preliminary Report- (2004) (9)
An Abstract Domain to Infer Octagonal Constraints with Absolute Value (2014) (9)
Three Cuts for Accelerated Interval Propagation (1995) (9)
Unification and Matching in Hierarchical Combinations of Syntactic Theories (2015) (9)
An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD (2018) (9)
Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification (1997) (9)
Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials (2005) (8)
Unification over Distributive Exponentiation (Sub)Theories (2011) (8)
Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures (2009) (8)
Complexity of Sufficient-Completeness (1986) (8)
Worst-Case Choice for the Stable Marriage Problem (1985) (8)
A Unification Algorithm for Analysis of Protocols with Blinded Signatures (2002) (8)
Computing Uniform Interpolants for EUF via (conditional) DAG-based Compact Representations (2020) (7)
On the construction of a domain language for a class of reactive systems (1999) (7)
Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (2013) (7)
GeoMeter: a system for modeling and algebraic manipulation (1989) (7)
Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS (2020) (7)
Automatic Generation of Polynomial Loop Invariants for Imperative Programs ? (6)
Conditions for determinantal formula for resultant of a polynomial system (2006) (6)
A refinement-based approach to deriving train controllers (2001) (6)
A Complete Analysis of Resultants and Extraneous Factors for Unmixed Bivariate Polynomial Systems using the Dixon formulation ∗ (2001) (6)
Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report (2003) (6)
Using Elimination Methods to Compute Thermophysical Algebraic Invariants from Infrared Imagery (1996) (5)
Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols (2020) (5)
Modeling the heap: a practical approach (2008) (5)
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm (2017) (5)
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures (2009) (5)
NIL: Learning Nonlinear Interpolants (2019) (5)
Acm Symposium on Theory of Computing (stoc 96) Sparsity Considerations in Dixon Resultants (1996) (5)
Reasoning about nonlinear inequality constraints: a multi-level approach (1989) (5)
Proving termination of GHC programs (1993) (4)
Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover (1998) (4)
Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, July 19-22, 2014 (2014) (4)
On the relationship between the Dixon-based resultant construction and the supports of polynomial systems (2003) (4)
Cayley-Dixon projection operator for multi-univariate composed polynomials (2009) (4)
Interpolation and Amalgamation for Arrays with MaxDiff (2021) (4)
On Asymmetric Unification and the Combination Problem in Disjoint Theories (2014) (4)
When Is a Formula a Loop Invariant? (2015) (4)
Automated deduction, CADE-11 : 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992 : proceedings (1992) (4)
A path ordering for proving termination of AC rewrite systems (1995) (4)
An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm (2015) (4)
Designing a Controller for a Multi-Train Multi-Track System (2001) (4)
Coverset Induction with Partiality and Subsorts: A Powerlist Case Study (2010) (4)
Dependency Pairs for Rewriting with Non-free Constructors (2007) (4)
Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic (2001) (4)
Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (1982) (4)
Resultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation ∗ (2002) (4)
Uniform Interpolants in EUF: Algorithms using DAG-representations (2020) (4)
Maximal Extensions os Simplification Orderings (1995) (3)
Proving equivalence of different axiomatizations of free groups (1988) (3)
Inference Rules and Proof Procedures for Inequations (1990) (3)
Distance Metrics for Comparing Shapes in the Plane (2013) (3)
Automated Reasoning (2014) (3)
Bruno Buchberger - A life devoted to symbolic computation (2006) (3)
Synthesizing Switching Controllers for Hybrid Systems by Continuous Invariant Generation (2013) (3)
An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System (2020) (3)
Program Analysis Using Quantifier-Elimination Heuristics - (Extended Abstract) (2012) (3)
Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery (1998) (3)
Unnecessary inferences in associative-commutative completion procedures (1990) (3)
Reasoning in Systems of Equations and Inequations (1987) (2)
AXDInterpolator: A Tool for Computing Interpolants for Arrays with MaxDiff (2021) (2)
Predicting Failures of Inductive Proof Attempts (2006) (2)
A Natural Proof System Based on rewriting Techniques (1984) (2)
Dependable Software Engineering: Theories, Tools, and Applications (2016) (2)
Parallel user interfaces for parallel applications (1996) (2)
Using Linear Arithmetic Procedure for Generating Induction Schemes (1994) (2)
A New Algorithm for Computing Comprehensive (2010) (2)
GEOMETER: A Theorem Prover for Algebraic Geometry (1988) (2)
Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials ‡ (2005) (2)
Elimination Techniques for Program Analysis (2013) (2)
Formal Specifcation and Refinement of a Safe Train Control Function (2004) (2)
Preface - Special Issue of Selected Extended Papers of IJCAR 2014 (2017) (2)
A Modular Associative Commutative (AC) Congruence Closure Algorithm (2021) (2)
Unified Memory Analysis (2006) (2)
Unification modulo a partial theory of exponentiation (2010) (1)
23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan (2012) (1)
Algorithmic Elimination Methods (2009) (1)
Predicting Failures of and Repairing Inductive Proof Attempts (2007) (1)
The Generalized Rabinowitsch Trick (2015) (1)
Implicit Induction Methods and Decision Procedures ? ( Extended Version ) (2006) (1)
Model Checking Reconfigurable Processor Configurations for Safety Properties (2003) (1)
Algorithms for computing greatest common divisors of parametric multivariate polynomials (2021) (1)
Interpolation synthesis for quadratic polynomial inequalities and combination with \textit{EUF} (2016) (1)
A Workshop on the Integration of Numerical and Symbolic Computing Methods Held in Saratoga Springs, New York on July 9-11, 1990 (1991) (1)
Static Heap Analysis for Automatic Parallelization (2007) (1)
Towards Dynamic Partitioning of States of a Reactive System : Train Controller Case Study (2005) (1)
The Church-Rosser Property and Special Thue Systems (1985) (1)
An Algorithm for Converting a Degree Grobner Basis to a Lexicographic Grobner Basis (1995) (1)
Special issue on First-Order Theorem Proving of the Journal of Automated Reasoning (2004) (1)
Chapter 7 Applications of Invariant Theory in Computer Vision (2013) (1)
An Algorithm for Converting a Degree Grr Obner Basis to a Lexicographic Grr Obner Basis Rough Draft (1994) (1)
IBDL: A Language for Interface Behavior Specification and Testing (1998) (1)
Hierarchical Combination of Matching Algorithms (2014) (1)
A refinement-based approach to developing software controllers for reactive systems (1999) (1)
Multivariate Resultants in Bernstein Basis (2008) (1)
Comprehensive Reachability Refutation and Witnesses Generation via Language and Tooling Co-Design (2021) (1)
Third Special Issue on Techniques for Automated Termination Proofs (2006) (1)
RRL: theorem proving environment based on rewriting techniques (1985) (1)
Shape Analysis with Reference Set Relations (2010) (1)
Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version) (2020) (1)
Computations in Residue Class Rings of (Parametric) Polynomial Ideals (2013) (1)
Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system (2004) (1)
Using Symbolic Summation and Polynomial Algebra for Imperative Program Verification in Theorema 1 (2006) (1)
On invariant checking (2013) (1)
Hierarchical Combination of Matching (2014) (0)
Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols (2022) (0)
Automation of Proof by Mathematical Induction (Dagstuhl Seminar 9530) (2021) (0)
Hierarchical Combination of Unication Algorithms (Extended Abstract) (2013) (0)
Preface (2005) (0)
Preface (2012) (0)
Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008) (0)
Maximal Extensions of Simplification Orderings (0)
Chapter 14 Symbolic / Numeric Techniques in Modeling and Simulation (2013) (0)
Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction (1992) (0)
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark (2017) (0)
Algorithms for Testing Membership in Univariate Quadratic Modules over the Reals (2022) (0)
Verifying Quantum Phase Estimation (QPE) using Prove-It (2023) (0)
Deduction and Infinite-state Model Checking (Dagstuhl Seminar 03171) (2021) (0)
Induction, Invariants, and Abstraction (2010) (0)
ADL/C++ -- A Specification Language for C++ and its Implementation (1997) (0)
Chapter 6 2 D and 3 D Object Recognition and Positioning with Algebraic Invariants and Covariants (2013) (0)
Preface (2006) (0)
Towards Dynamic Partitioning of Reactive System Behavior: A Train Controller Case Study (2005) (0)
8 Constructors Can Be Partial, Too (1997) (0)
General Interpolation and Strong Amalgamation for Contiguous Arrays (2022) (0)
A brief introduction to Wen-Tsun Wu's academic career (2012) (0)
Elsevier Semi-unification* (2008) (0)
Combinatorial Pattern Matching (1993) (0)
Rewrite-Based Automated Reasoning: Challenges Ahead (1996) (0)
11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016, September 27-29, 2016, Berlin, Germany (2016) (0)
Preface (2004) (0)
Preface on the contributed papers (2006) (0)
Announcement (2004) (0)
r Chapter 12 Symbolic and Parallel Adaptive Methods for Partial Differential Equations (2013) (0)
Integration of Symbolic and Numerical Methods and Their Applications in Artificial Intelligence. (1995) (0)
Chapter 15 Symbolic and Numeric Computation : the Example of IRENA (2013) (0)
Interpolation Results for Arrays with Length and MaxDiff (2023) (0)
Hierarchical Combination of Unification Algorithms (2013) (0)
Harald Ganzinger's Legacy: Contributions to Logics and Programming (2013) (0)
Deduction (Dagstuhl Seminar 01101) (2021) (0)
Preface (2004) (0)
r Chapter 10 Symbolic Methods for the Simulation of Planar Mechanical Systems in Design (2013) (0)
On invariant checking (2013) (0)
Editorial (2018) (0)
Conditional Congruence Closure over Uninterpreted and Interpreted Symbols (2019) (0)
A Mathematical Framework for Combinatorial / Structural Analysis of Linear Dynamical Systems by Means of Matroids (2013) (0)
Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (2021) (0)
Conditions for Additional Roots from Maximal-Rank Minors of Macaulay Matrices (2009) (0)
Proving Termination of Imperative Programs via Term Rewriting ⋆ (2008) (0)
Preface@@@Second Special Issue on Techniques for Automated Termination Proofs (2005) (0)
24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands (2013) (0)
Shape Analysis with Reference Set Dominance (2008) (0)
Complexity of Associative-commutative Unification Check and Related Problems * (1997) (0)
Mathematical Modeling , Symbolic and Numerical Systems / (2013) (0)
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm (2017) (0)
Preface (2004) (0)

This paper list is powered by the following services:

Other Resources About Deepak Kapur

What Schools Are Affiliated With Deepak Kapur?

Deepak Kapur is affiliated with the following schools: