dblp.uni-trier.dewww.uni-trier.de

Deepak Kapur Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
143EEStephan Falke, Deepak Kapur: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs. CADE 2009: 277-293
142EEMark Marron, Deepak Kapur, Manuel V. Hermenegildo: Identification of logically related heap regions. ISMM 2009: 89-98
141EEStephan Falke, Deepak Kapur: Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures. Electr. Notes Theor. Comput. Sci. 237: 75-90 (2009)
140EEArthur D. Chtcherba, Deepak Kapur, Manfred Minimair: Cayley-Dixon projection operator for multi-univariate composed polynomials. J. Symb. Comput. 44(8): 972-999 (2009)
2008
139 Deepak Kapur: Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers Springer 2008
138EEMark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic: Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. CC 2008: 245-259
137EEMark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo: Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. LCPC 2008: 94-108
136EEMark Marron, Mario Méndez-Lojo, Manuel V. Hermenegildo, Darko Stefanovic, Deepak Kapur: Sharing analysis of arrays, collections, and recursive structures. PASTE 2008: 43-49
135EEStephan Falke, Deepak Kapur: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures. RTA 2008: 94-109
2007
134EEStephan Falke, Deepak Kapur: Dependency Pairs for Rewriting with Non-free Constructors. CADE 2007: 426-442
133EEMark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur: Heap analysis in the presence of collection libraries. PASTE 2007: 31-36
132EEEnric Rodríguez-Carbonell, Deepak Kapur: Generating all polynomial invariants in simple loops. J. Symb. Comput. 42(4): 443-476 (2007)
131EEEnric Rodríguez-Carbonell, Deepak Kapur: Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Sci. Comput. Program. 64(1): 54-75 (2007)
2006
130EEArthur D. Chtcherba, Deepak Kapur: Conditions for determinantal formula for resultant of a polynomial system. ISSAC 2006: 55-62
129EEMark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo: A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. LCPC 2006: 345-363
128EEStephan Falke, Deepak Kapur: Inductive Decidability Using Implicit Induction. LPAR 2006: 45-59
127EEDeepak Kapur, Rupak Majumdar, Calogero G. Zarba: Interpolation for data structures. SIGSOFT FSE 2006: 105-116
126EEJürgen Giesl, Deepak Kapur: Third Special Issue on Techniques for Automated Termination Proofs. J. Autom. Reasoning 37(3): 153-154 (2006)
125EEHoon Hong, Deepak Kapur, Peter Paule, Franz Winkler: Bruno Buchberger - A life devoted to symbolic computation. J. Symb. Comput. 41(3-4): 255-258 (2006)
124EEDeepak Kapur: Preface on the contributed papers. J. Symb. Comput. 41(3-4): 259-260 (2006)
2005
123EEArthur D. Chtcherba, Deepak Kapur, Manfred Minimair: Cayley-Dixon Resultant Matrices of Multi-univariate Composed Polynomials. CASC 2005: 125-137
122EEDeepak Kapur: Automatically Generating Loop Invariants Using Quantifier Elimination. Deduction and Applications 2005
121EEDeepak Kapur, Paliath Narendran, Lida Wang: A Unification Algorithm for Analysis of Protocols with Blinded Signatures. Mechanizing Mathematical Reasoning 2005: 433-451
120EEJürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(2): 103-104 (2005)
119EEJürgen Giesl, Deepak Kapur: Preface. J. Autom. Reasoning 34(4): 323 (2005)
2004
118EEEnric Rodríguez-Carbonell, Deepak Kapur: Program Verification Using Automatic Generation of Invariants. ICTAC 2004: 325-340
117EEEnric Rodríguez-Carbonell, Deepak Kapur: Automatic generation of polynomial loop. ISSAC 2004: 266-273
116EEArthur D. Chtcherba, Deepak Kapur: Support hull: relating the cayley-dixon resultant constructions to the support of a polynomial system. ISSAC 2004: 95-102
115EEEnric Rodríguez-Carbonell, Deepak Kapur: An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. SAS 2004: 280-295
114EEDeepak Kapur: Preface. J. Autom. Reasoning 32(1): 1-2 (2004)
113EEDeepak Kapur: Preface. J. Autom. Reasoning 32(3): 185-186 (2004)
112EEDeepak Kapur, Laurent Vigneron: Preface. J. Autom. Reasoning 33(3-4): 219-220 (2004)
111EEArthur D. Chtcherba, Deepak Kapur: Constructing Sylvester-type resultant matrices using the Dixon formulation. J. Symb. Comput. 38(1): 777-814 (2004)
110EEArthur D. Chtcherba, Deepak Kapur: Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation. J. Symb. Comput. 38(2): 915-958 (2004)
2003
109EEDeepak Kapur, Mahadevan Subramaniam: Automatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report. ASIAN 2003: 125-145
108EEJürgen Giesl, Deepak Kapur: Deciding Inductive Validity of Equations. CADE 2003: 17-31
107EEJohn Cochran, Deepak Kapur, Darko Stefanovic: Model Checking Reconfigurable Processor Configurations for Safety Properties. FPL 2003: 996-999
106EEDeepak Kapur, Paliath Narendran, Lida Wang: An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation. RTA 2003: 165-179
105EEDeepak Kapur, Nikita A. Sakhanenko: Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions. TPHOLs 2003: 136-154
104EEDeepak Kapur: Announcement. J. Autom. Reasoning 31(2): 105-105 (2003)
103EEArthur D. Chtcherba, Deepak Kapur: Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. J. Symb. Comput. 36(3-4): 289-315 (2003)
2002
102EEDeepak Kapur: A Rewrite Rule Based Framework for Combining Decision Procedures. FroCos 2002: 87-102
101EEArthur D. Chtcherba, Deepak Kapur: On the efficiency and optimality of Dixon-based resultant methods. ISSAC 2002: 29-36
2001
100 Adriaan de Groot, Jozef Hooman, Fabrice Kordon, Emmanuel Paviot-Adet, Isabelle Vernier-Mounier, Michel Lemoine, Gervais Gaudiére, Victor L. Winter, Deepak Kapur: A Survey: Applying Formal Methods to a Software Intensive System. HASE 2001: 55-64
99EEJürgen Giesl, Deepak Kapur: Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484
98EEJürgen Giesl, Deepak Kapur: Dependency Pairs for Equational Rewriting. RTA 2001: 93-108
97 Deepak Kapur: Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic. Symbolic Algebraic Methods and Verification Methods 2001: 129-144
96EEDeepak Kapur, Victor L. Winter, Raymond Berg: Designing a Controller for a Multi-Train Multi-Track System. Electr. Notes Theor. Comput. Sci. 50(1): (2001)
2000
95EEDeepak Kapur, Mahadevan Subramaniam: Extending Decision Procedures with Induction Schemes. CADE 2000: 324-345
94EEArthur D. Chtcherba, Deepak Kapur: Conditions for exact resultants using the Dixon formulation. ISSAC 2000: 62-70
93EEDeepak Kapur, Mahadevan Subramaniam: Using an induction prover for verifying arithmetic circuits. STTT 3(1): 32-65 (2000)
1998
92EEDeepak Kapur, Mahadevan Subramaniam: Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover. ASIAN 1998: 22-42
91EESreenivasa Viswanadha, Deepak Kapur: IBDL: A Language for Interface Behavior Specification and Testing. COOTS 1998: 235-248
90EEDeepak Kapur, G. Sivakumar: Proving Associative-Communicative Termination Using RPO-Compatible Orderings. FTP (LNCS Selection) 1998: 39-61
89EEJonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur: Geometric, Algebraic, and Thermophysical Techniques for Object Recognition in IR Imagery. Computer Vision and Image Understanding 72(1): 84-97 (1998)
88 Deepak Kapur, Mahadevan Subramaniam: Mechanical Verification of Adder Circuits using Rewrite Rule Laboratory. Formal Methods in System Design 13(2): 127-158 (1998)
87 M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Transformational Methodology for Proving Termination of Logic Programs. J. Log. Program. 34(1): 1-41 (1998)
1997
86EEDeepak Kapur, Mahadevan Subramaniam: Mechanizing Verification of Arithmetic Circuits: SRT Division. FSTTCS 1997: 103-122
85 Deepak Kapur, R. K. Shyamasundar: Synthesizing Controllers for Hybrid Systems. HART 1997: 361-375
84 Deepak Kapur, Tushar Saxena: Extraneous Factors in the Dixon Resultant Formulation. ISSAC 1997: 141-148
83EEDeepak Kapur, G. Sivakumar: A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems. RTA 1997: 142-156
82EEDeepak Kapur: Shostak's Congruence Closure as Completion. RTA 1997: 23-37
81EEDeepak Kapur: Rewriting, Decision Procedures and Lemma Speculation for Automated Hardware Verification. TPHOLs 1997: 171-182
80 M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. New Generation Comput. 15(3): 293-338 (1997)
1996
79 Jonathan D. Michel, Nagaraj Nandhakumar, Tushar Saxena, Deepak Kapur: Using Elimination Methods to Compute Thermophysical Algebraic Invariants from Infrared Imagery. AAAI/IAAI, Vol. 2 1996: 1110-1115
78 Deepak Kapur, Mahadevan Subramaniam: Automating Induction over Mutually Recursive Functions. AMAST 1996: 117-131
77 Deepak Kapur: Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets. Automated Deduction in Geometry 1996: 1-36
76EEDeepak Kapur, Mahadevan Subramaniam: Lemma Discovery in Automated Induction. CADE 1996: 538-552
75EEDeepak Kapur, Mahadevan Subramaniam: Mechanically Verifying a Family of Multiplier Circuits. CAV 1996: 135-146
74EEMark T. Vandevoorde, Deepak Kapur: Parallel User Interfaces for Parallel Applications. HPDC 1996: 161-
73EELeopoldo E. Bertossi, Javier Pinto, Pablo Sáez, Deepak Kapur, Mahadevan Subramaniam: Automating Proofs of Integrity Constraints in Situation Calculus. ISMIS 1996: 212-222
72EEDeepak Kapur: Rewrite-Based Automated Reasoning: Challenges Ahead. RTA 1996: 1-2
71EEMark T. Vandevoorde, Deepak Kapur: Distributed Larch Prover (DLP): An Experiment in Parallelizing a Rewrite-Rule Based Prover. RTA 1996: 420-423
70EEDeepak Kapur, Tushar Saxena: Sparsity Considerations in Dixon Resultants. STOC 1996: 184-191
69 Deepak Kapur, Mahadevan Subramaniam: New Uses of Linear Arithmetic in Automated Theorem Proving by Induction. J. Autom. Reasoning 16(1-2): 39-78 (1996)
1995
68 Deepak Kapur, Mahadevan Subramaniam: Automated Reasoning About Parallel Algorithms Using Powerlists. AMAST 1995: 416-430
67EEDeepak Kapur, G. Sivakumar: Maximal Extensions os Simplification Orderings. FSTTCS 1995: 225-239
66EEDeepak Kapur, Tushar Saxena: Comparison of Various Multivariate Resultant Formulations. ISSAC 1995: 187-194
65 Deepak Kapur, G. Sivakumar, Hantao Zhang: A Path Ordering for Proving Termination of AC Rewrite Systems. J. Autom. Reasoning 14(2): 293-316 (1995)
1994
64EEDeepak Kapur, Mahadevan Subramaniam: Using Linear Arithmetic Procedure for Generating Induction Schemes. FSTTCS 1994: 438-449
63EEDeepak Kapur, Tushar Saxena, Lu Yang: Algebraic and Geometric Reasoning Using Dixon Resultants. ISSAC 1994: 99-107
62EEDeepak Kapur: An Automated Tool for Analyzing Completeness of Equational Specifications. ISSTA 1994: 28-43
61 Deepak Kapur, Xumin Nie, David R. Musser: An Overview of the Tecton Proof System. Theor. Comput. Sci. 133(2): 307-339 (1994)
1993
60 M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. ICLP 1993: 720-736
1992
59 Deepak Kapur: Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings Springer 1992
58 R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur: Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK 1992: 3-20
57 Deepak Kapur, David R. Musser, Xumin Nie: The Tecton Proof System. Formal Methods in Databases and Software Engineering 1992: 54-79
56 Deepak Kapur, Paliath Narendran: Double-exponential Complexity of Computing a Complete Set of AC-Unifiers LICS 1992: 11-21
55 Deepak Kapur, Paliath Narendran: Complexity of Unification Problems with Associative-Commutative Operators. J. Autom. Reasoning 9(2): 261-288 (1992)
1991
54EEM. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: A Transformational Methodology for Proving Termination of Logic Programs. CSL 1991: 213-226
53 Deepak Kapur, Hantao Zhang: A Case Study of the Completion Procedure: Proving Ring Commutativity Problems. Computational Logic - Essays in Honor of Alan Robinson 1991: 360-394
52EERaj Agarwal, David R. Musser, Deepak Kapur, Xumin Nie: The Tecton Proof System. RTA 1991: 442-444
51 Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Inf. 28(4): 311-350 (1991)
50 Deepak Kapur, Paliath Narendran, Hantao Zhang: Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11(1/2): 81-111 (1991)
49 Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman: Semi-Unification. Theor. Comput. Sci. 81(2): 169-187 (1991)
1990
48EEDeepak Kapur, G. Sivakumar, Hantao Zhang: A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS 1990: 133-148
47EEDeepak Kapur, H. K. Wan: Refutational Proofs of Geometry Theorems via Characteristic Set Computation. ISSAC 1990: 277-284
46 Deepak Kapur, Paliath Narendran, Friedrich Otto: On Ground-Confluence of Term Rewriting Systems Inf. Comput. 86(1): 14-31 (1990)
45 Chilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur: Inference Rules and Proof Procedures for Inequations. J. Log. Program. 9(1): 75-104 (1990)
44 Hantao Zhang, Deepak Kapur: Unnecessary Inferences in Associative-Commutative Completion Procedures. Mathematical Systems Theory 23(3): 175-206 (1990)
1989
43EEHantao Zhang, Deepak Kapur: Consider Only General Superpositions in Completion Procedures. RTA 1989: 513-527
42EEDeepak Kapur, Hantao Zhang: An Overview of Rewrite Rule Laboratory (RRL). RTA 1989: 559-563
1988
41EEHantao Zhang, Deepak Kapur: First-Order Theorem Proving Using Conditional Rewrite Rules. CADE 1988: 1-20
40EEHantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy: A Mechanizable Induction Principle for Equational Specifications. CADE 1988: 162-181
39EEDeepak Kapur, Hantao Zhang: RRL: A Rewrite Rule Laboratory. CADE 1988: 768-769
38EEDavid Cyrluk, Richard M. Harris, Deepak Kapur: GEOMETER: A Theorem Prover for Algebraic Geometry. CADE 1988: 770-771
37EEDeepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman: Semi-Unification. FSTTCS 1988: 435-454
36 Deepak Kapur, Joseph L. Mundy: Geometric Reasoning and Artificial Intelligence: Introduction to the Special Volume. Artif. Intell. 37(1-3): 1-11 (1988)
35 Deepak Kapur, Joseph L. Mundy: Wu's Method and its Application to Perspective Viewing. Artif. Intell. 37(1-3): 15-36 (1988)
34 Michele Barry, David Cyrluk, Deepak Kapur, Joseph L. Mundy, Van-Duc Nguyen: A Multi-Level Geometric Reasoning System for Vision. Artif. Intell. 37(1-3): 291-332 (1988)
33 Deepak Kapur: A Refutational Approach to Geometry Theorem Proving. Artif. Intell. 37(1-3): 61-93 (1988)
32 Deepak Kapur, Hantao Zhang: Proving Equivalence of Different Axiomatizations of Free Groups. J. Autom. Reasoning 4(3): 331-352 (1988)
31 Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark E. Stickel, Michael Tepp, Hantao Zhang: Opening the AC-Unification Race. J. Autom. Reasoning 4(4): 465-474 (1988)
30 Deepak Kapur, David R. Musser, Paliath Narendran: Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure. J. Symb. Comput. 6(1): 19-36 (1988)
29 Abdelilah Kandri-Rody, Deepak Kapur: Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain. J. Symb. Comput. 6(1): 37-57 (1988)
28 Deepak Kapur, Mandayam K. Srivas: Computability and Implementability Issues in Abstract Data Types. Sci. Comput. Program. 10(1): 33-63 (1988)
1987
27EEChilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur: Reasoning in Systems of Equations and Inequations. FSTTCS 1987: 305-325
26 Deepak Kapur, Paliath Narendran, Hantao Zhang: On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Inf. 24(4): 395-415 (1987)
25 Deepak Kapur, David R. Musser: Proof by Consistency. Artif. Intell. 31(2): 125-157 (1987)
24 Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. J. Symb. Comput. 3(1/2): 203-216 (1987)
1986
23EEDeepak Kapur, Paliath Narendran: NP-Completeness of the Set Unification and Matching Problems. CADE 1986: 489-495
22EEDeepak Kapur, G. Sivakumar, Hantao Zhang: RRL: A Rewrite Rule Laboratory. CADE 1986: 691-692
21EEDeepak Kapur, Paliath Narendran, Hantao Zhang: Proof by Induction Using Test Sets. CADE 1986: 99-117
20EEDeepak Kapur, Paliath Narendran, Hantao Zhang: Complexity of Sufficient-Completeness. FSTTCS 1986: 426-442
19 Deepak Kapur, David R. Musser: Inductive Reasoning with Incomplete Specifications (Preliminary Report) LICS 1986: 367-377
18 Deepak Kapur: Using Gröbner Bases to Reason About Geometry Problems. J. Symb. Comput. 2(4): 399-408 (1986)
1985
17 Deepak Kapur, Paliath Narendran: An Equational Approach to Theorem Proving in First-Order Predicate Calculus. IJCAI 1985: 1146-1153
16EEAbdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran: An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. RTA 1985: 345-364
15EEDan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. RTA 1985: 417-429
14EEDeepak Kapur, Paliath Narendran, G. Sivakumar: A Path Ordering for Proving Termination of Term Rewriting Systems. TAPSOFT, Vol.1 1985: 173-187
13EEDeepak Kapur, Mandayam K. Srivas: A Rewrite Rule Based Approach for Synthesizing Abstract Data Types. TAPSOFT, Vol.1 1985: 188-207
12 Deepak Kapur, Mukkai S. Krishnamoorthy: Worst-Case Choice for the Stable Marriage Problem. Inf. Process. Lett. 21(1): 27-30 (1985)
11 Deepak Kapur, Paliath Narendran: The Knuth-Bendix Completion Procedure and Thue Systems. SIAM J. Comput. 14(4): 1052-1072 (1985)
10 Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran: An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems. Theor. Comput. Sci. 35: 109-114 (1985)
9 Deepak Kapur, Paliath Narendran: A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System. Theor. Comput. Sci. 35: 337-344 (1985)
8 Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton: The Church-Rosser Property and Special Thue Systems. Theor. Comput. Sci. 39: 123-133 (1985)
1984
7EEDeepak Kapur, Balakrishnan Krishnamurthy: A Natural Proof System Based on rewriting Techniques. CADE 1984: 53-64
6 Abdelilah Kandri-Rody, Deepak Kapur: Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings. EUROSAM 1984: 195-206
1983
5 John V. Guttag, Deepak Kapur, David R. Musser: On Proving Uniform Termination and Restricted Termination of Rewriting Systems. SIAM J. Comput. 12(1): 189-214 (1983)
1982
4 David R. Musser, Deepak Kapur: Rewrite Rule Theory and Abstract Data Type Analysis. EUROCAM 1982: 77-90
3EEJohn V. Guttag, Deepak Kapur, David R. Musser: Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems. ICALP 1982: 300-312
1981
2EEDeepak Kapur, David R. Musser, Alexander A. Stepanov: Tecton: A Language for Manipulating Generic Objects. Program Specification 1981: 402-414
1980
1 Deepak Kapur, Mandayam K. Srivas: Expressiveness of the Operation Set of a Data Abstraction. POPL 1980: 139-153

Coauthor Index

1Raj Agarwal [52]
2Michele Barry [34]
3Dan Benanav [15] [24]
4Raymond Berg [96]
5Leopoldo E. Bertossi [73]
6Hans-Jürgen Bürckert [31]
7Arthur D. Chtcherba [94] [101] [103] [110] [111] [116] [123] [130] [140]
8John Cochran [107]
9David Cyrluk [34] [38]
10Stephan Falke [128] [134] [135] [141] [143]
11Gervais Gaudiére [100]
12Jürgen Giesl [98] [99] [108] [119] [120] [126]
13Adriaan de Groot [100]
14John V. Guttag [3] [5]
15Richard M. Harris [38]
16Manuel V. Hermenegildo [129] [133] [136] [137] [138] [142]
17Alexander Herold [31]
18Hoon Hong [125]
19Jozef Hooman [100]
20Abdelilah Kandri-Rody [6] [16] [29]
21Fabrice Kordon [100]
22Mukkai S. Krishnamoorthy [8] [10] [12] [40]
23Balakrishnan Krishnamurthy [7]
24Michel Lemoine [100]
25Rupak Majumdar [127]
26Mark Marron [129] [133] [136] [137] [138] [142]
27Robert McNaughton [8] [10]
28Mario Méndez-Lojo [136]
29Jonathan D. Michel [79] [89]
30Manfred Minimair [123] [140]
31Chilukuri K. Mohan [27] [45]
32Joseph L. Mundy [34] [35] [36]
33David R. Musser [2] [3] [4] [5] [19] [25] [30] [37] [49] [52] [57] [61]
34Nagaraj Nandhakumar [79] [89]
35Paliath Narendran [8] [9] [10] [11] [14] [15] [16] [17] [20] [21] [23] [24] [26] [30] [37] [46] [49] [50] [51] [55] [56] [106] [121]
36Van-Duc Nguyen [34]
37Xumin Nie [52] [57] [61]
38Friedrich Otto [46]
39Peter Paule [125]
40Emmanuel Paviot-Adet [100]
41Javier Pinto [73]
42M. R. K. Krishna Rao [54] [58] [60] [80] [87]
43Enric Rodríguez-Carbonell [115] [117] [118] [131] [132]
44Daniel J. Rosenkrantz [51]
45Pablo Sáez [73]
46Nikita A. Sakhanenko [105]
47Tushar Saxena [63] [66] [70] [79] [84] [89]
48R. K. Shyamasundar [54] [58] [60] [80] [85] [87]
49Jörg H. Siekmann [31]
50G. Sivakumar [14] [22] [48] [65] [67] [83] [90]
51Mandayam K. Srivas [1] [13] [27] [28] [45]
52Darko Stefanovic [107] [129] [133] [136] [137] [138]
53Alexander A. Stepanov [2]
54Mark E. Stickel [31]
55Jonathan Stillman [37] [49]
56Mahadevan Subramaniam [64] [68] [69] [73] [75] [76] [78] [86] [88] [92] [93] [95] [109]
57Michael Tepp [31]
58Mark T. Vandevoorde [71] [74]
59Isabelle Vernier-Mounier [100]
60Laurent Vigneron [112]
61Sreenivasa Viswanadha [91]
62H. K. Wan [47]
63Lida Wang [106] [121]
64Franz Winkler [125]
65Victor L. Winter [96] [100]
66Lu Yang [63]
67Calogero G. Zarba [127]
68Hantao Zhang [20] [21] [22] [26] [31] [32] [39] [40] [41] [42] [43] [44] [48] [50] [51] [53] [65]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)