.bp
.po 1i
.ps 9
.nr pp 9
.he '%''Vipin Kumar'
.fo '\*(td'''
.(lC
Vipin Kumar
Professor
Computer Science Department
4-192 EE/CSci Building
University of Minnesota
Minneapolis, MN 55455
Tel: 612-624-8023, Internet: kumar@cs.umn.edu, FAX: 612-625-0572
URL:http://www.cs.umn.edu/users/kumar/papers.html
.)l

.in 0
.sp 2
.pp
.sp
.in 0
.ne 10
.ft B
LIST OF  PUBLICATIONS:
.sp
A. BOOKS:
.ft
.sp
.nr J 0 1
.ip [\n+J]
Introduction to Parallel Computing: Design and Analysis of Algorithms
by Vipin Kumar, Ananth Grama, Anshul Gupta and George Karypis,
Benjamin-Cummings Publishing Company, November 1993.
.ip [\n+J]
Parallel Processing for Artificial Intelligence, Volume 1,
edited by Laveen Kanal, Vipin Kumar, Hiroaki Kitano and Christian B. Suttner,
North-Holland, June 1994.
.ip [\n+J]
Parallel Processing for Artificial Intelligence, Volume 2,
edited by Hiroaki Kitano, Vipin Kumar, and Christian B. Suttner,
North-Holland, July 1994.
.ip [\n+J]
Search in Artificial Intelligence,
edited by Laveen Kanal and Vipin Kumar,
Springer-Verlag, 1988.
.ip [\n+J]
Parallel Algorithms for Machine Intelligence and Vision
edited by V. Kumar, P.S. Gopalkrishnan, and L. Kanal,
Springer-Verlag, March 1990.
.in 0
.sp
.ne 8
.ft B
B. Refereed Journal Articles
.sp
.nr J 0 1
.ip [\n+J]
G. Karypis, E.H. Han, and V. Kumar,
Chameleon: A Hierarchical Clustering Algorithm Using Dynamic Modeling,
.ft B
IEEE Computer, Special Issue on Data Analysis and Mining, 
.ft
1999 (to appear).
Also appears as Technical Report TR-99-007,
Department of Computer Science, University of Minnesota, Minneapolis.
.ip [\n+J]
Scalable Parallel Data Mining for Association Rules,
E.H. Han and G. Karypis and V. Kumar,
.ft B
IEEE Transactions on Knowledge and Data Engineering,
.ft
(to appear).
.ip [\n+J]
George Karypis and Vipin Kumar,
Parallel Multilevel K-way Partitioning Scheme for Irregular Graphs,
.ft B
SIAM Review,
.ft
Volume 41, Number 2, 1999.
.ip [\n+J]
Ananth Grama and Vipin Kumar,
Parallel Search  Methods - State-of-the-Art,
.ft B
IEEE Transactions on Knowledge and Data Engineering
.ft
Volume 11, Number 1, 1999, pp 28-35.
.ip [\n+J]
A. Srivastava, E.H. Han, V. Kumar, and V. Singh,
Parallel Formulations of Decision-Tree Classification Algorithms,
.ft B
Data Mining and Knowledge Discovery: An International Journal,
.ft
(to appear) 1999.
.ip [\n+J]
George Karypis and Vipin Kumar,
A Fast and High Quality Multi-level Scheme for Partitioning Irregular Graphs.
.ft B
SIAM Journal on Scientific Computing
.ft
Volume 20, number 1, 1999.
Also available as Tech Report 95-035, department of computer science, University
of Minnesota, 1995.
.ip [\n+J]
D. Boley, M. Gini, R. Gross, E. Han, K. Hastings, G. Karypis, 
V. Kumar, B. Mobasher, and J. Moore,
Document Categorization and Query Generation on the World Wide Web Using WebACE,
.ft B
AI Review
.ft
accepted for publication, 1998.
.ip [\n+J]
D. Boley, M. Gini, R. Gross, E. Han, K. Hastings, G. Karypis, 
V. Kumar, B. Mobasher, and J. Moore,
Web Page Categorization and Feature Selection Using Association Rule and 
Principal Component Clustering,
.ft B
Decision Support System,
.ft
accepted for publication, 1998.
.ip [\n+J]
George Karypis, Rajat Aggarwal, Vipin Kumar, and Shashi Shekhar,
Multilevel Hypergraph Partitioning: Applications in VLSI Domain,
.ft B
IEEE Transactions on VLSI Systems,
.ft
Volume 7, Number 1, March 1999, pp 69-79.
.ip [\n+J]
George Karypis and Vipin Kumar,
A Parallel Algorithm for Multilevel Graph partitioning and Sparse Matrix Ordering,
.ft B
Journal of Parallel and Distributed Computing
.ft
Volume 48, Number 1, January 10, 1998, pp 71-95.
.ip [\n+J]
George Karypis and Vipin Kumar,
Multilevel K-way Partitioning Scheme for Irregular Graphs.
.ft B
Journal of Parallel and Distributed Computing
.ft
Volume 48, Number 1, January 10, 1998, pp 96-129.
.ip [\n+J]
Ananth Y. Grama, Vipin Kumar and Ahmed Sameh,
Scalable Parallel Formulations of the Barnes-Hut Method for n-Body Simulations,
.ft B
Parallel Computing,
.ft
Volume 24, Number 5-6, June 1998, pp797-822.
.ip [\n+J]
Kirk Schloegel, George Karypis and Vipin Kumar,
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes
.ft B
Journal of Parallel and Distributed Computing
.ft
Volume 47, Number 2, Dec 15, 1997, pp 109-124.
.ip [\n+J]
Ananth Grama, Vipin Kumar and Ahmed Sameh,
"Parallel Hierarchical Solvers and
Preconditioners for Boundary Element Methods",
.ft B
SIAM Journal on Scientific Computing
.ft
Accepted for publication, 1997.
.ip [\n+J] 
Anshul Gupta, George Karypis and Vipin Kumar,
A Highly Scalable Parallel Algorithm for Sparse Matrix Factorization,
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
Volume 8, Number 5, May, 1997.
A short version of this paper won the Outstanding Student Paper Award
from the Supercomputing 94 conference.
.ip [\n+J]
S. Shekhar, S. Ravada, V. Kumar, G. Turner, and D. Chubb, 
Declustering and Load Balancing methods for Parallelizing Geographical Information Systems,
.ft B
IEEE Transactions on Knowledge and Data Engineering
.ft
Volume 10, Number 4, pp 632-655, July 1998.
.ip [\n+J]
S. Shekhar, S. Ravada, V. Kumar, G. Turner, and D. Chubb, 
High Performance Geographic Information Systems:
Experiences with a Shared-Memory Multiprocessor,
.ft B
IEEE Computer,
.ft
Volume 29, Number 12, pp 42-49, December 1996.
.ip [\n+J]
Anshul Gupta, Vipin Kumar, and Ahmed Sameh,
Performance and Scalability of Preconditioned Conjugate Gradient
Methods on the CM5,
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
Volume 6, Number 5, pp. 455-469, May 1995.
.ip [\n+J] 
Ananth Y. Grama and Vipin Kumar,
A Survey of Parallel Search Algorithms for Discrete Optimization Problems,
.ft B
ORSA Journal of Computing
.ft
vol.7, no.4, pp.  365-85, 1995.
.ip [\n+J]
George Karypis and Vipin Kumar,
"Unstructured Tree Search on SIMD Parallel Computers",
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
Volume 5, Number 10, pp. 1057-1072, October 1994.
.ip [\n+J]
V. Kumar and A. Gupta,
"Analyzing the Scalability of Parallel Algorithms and Architectures: A Survey",
.ft B
Journal of Parallel and Distributed Computing
.ft
(special issue on scalability)
Volume 22, Number 3, September 1994, pp. 379-391.
Also available
as Tech Report TR 91-18, department of computer science, University
of Minnesota, 1991.
.ip [\n+J]
Vipin Kumar, Shashi Shekhar and Minesh Amin,
A Highly Parallel Formulation of Backpropagation on Hypercubes:
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
Volume 5, Number 10, pp. 1073-1091, October 1994.
.ip [\n+J]
V. Kumar, Ananth Y. Grama, and V.N. Rao,
"Scalable Load Balancing Techniques for Parallel Computers",
.ft B
Journal of Parallel and Distributed Computing
.ft
Volume 22, Number 1, pages 60-79, July 1994.
.ip [\n+J]
Ananth Grama, Anshul Gupta,  and Vipin Kumar,
"Isoefficiency Function: A Scalability Metric for Parallel Algor
ithms and Architectures",
.ft B
IEEE Parallel and Distributed Technology, Special
Issue on Parallel and Distributed Systems: From Theory to Practice,
.ft
August 1993, Volume 1, Number 3, pp 12-21.
.ip [\n+J]
A. Gupta and V. Kumar,
Performance Properties of Large Scale Parallel Systems,
.ft B
Journal of Parallel and Distributed Computing
.ft
Volume 19, Number 3, November 1993.
.ip [\n+J]
A. Gupta and V. Kumar,
"Scalability of FFT on Parallel Computers",
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
August 1993, Volume 4, Number 8, pp 922-932.
.ip [\n+J]
V. N. Rao and V. Kumar
On the Efficiency of Parallel Backtracking,
.ft B
IEEE Transactions on Parallel and Distributed Systems
.ft
4(4), pp. 427--437,  April 1993.
.ip [\n+J]
V. Kumar,
Algorithms for Constraint Satisfaction Problems,
.ft B
The AI Magazine
.ft 
Volume 13, Number 1, 32-44, 1992.
.ip [\n+J]
V. Singh, V. Kumar, G. Agha, and C. Tomlinson,
"Scalability of Parallel Sorting on Mesh Multicomputers",
.ft B
International Journal of Parallel Programming
.ft
Volume 20(2), April 1991.
.ip [\n+J]
V. Kumar and V. Singh,
Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem,
.ft B
Journal of Parallel and Distributed Computing
(special issue on massively parallel computation),
.ft
Vol 13, #2, 1991, 124-138.
.ip [\n+J]
S. Arvindam, V. Kumar, V.N. Rao and V. Singh,
Automatic Test Pattern Generation on Multiprocessors,
.ft B
Parallel Computing, Vol 17, 1991, 1323-1342.
.ip [\n+J]
Lin, Y.J. and Kumar, V.
AND-Parallel Execution of Logic Programs on a Shared Memory
Multiprocessor.  
.ft B
Journal of Logic Programming.
.ft
Volume 10, 1991, 155-178.
.ip [\n+J]
Kumar, V.
A General Bottom-up Procedure for Searching AND/OR Graphs.
.ft B
Information Science.
.ft
Volume 56 (pp. 39-57), 1991.
.ip [\n+J]
Rao, V.N. and Kumar, V.
Concurrent Access of Priority Queues.
.ft B
IEEE Transactions on Computers
.ft
Vol 37, Number 12, December 1988,  1657-1665.
.ip [\n+J]
Kumar, V. and Lin, Y.
A Data-Dependency Based Intelligent Backtracking Scheme for
Prolog.
.ft B
Journal of Logic Programming
.ft
Volume 5, Number 2, June 1988,  165-181.
.ip [\n+J]
Lin, Y. and Kumar, V.
An Execution Model for Exploiting AND-Parallelism in Logic Programs
.ft B
New Generation Computing
.ft
Volume 5, Number 4, 1988,  393-425.
.ip [\n+J]
Rao, V.N. and Kumar, V.
Parallel Depth-First Search on Multiprocessors Part I: Implementation
.ft B
International Journal of Parallel Programming
.ft
Volume 16, #6, 1987, 479-499.
.ip [\n+J]
Kumar, V. and Rao, V.N.
Parallel Depth-First Search on Multiprocessors Part II: Analysis
.ft B
International Journal of Parallel Programming
.ft
Volume 16, #6, 1987, 501-519.
.ip [\n+J]
Kumar, V. and Kanal, L.
Parallel Branch and Bound Formulations for And/Or Tree Search.
.ft B
IEEE Transactions on Pattern Analysis and Machine Intelligence,
.ft
Vol 6, No. 6, November 1984, 768-788.
.ip [\n+J]
Nau, D. S., Kumar, V. and Kanal, L.
General Branch and Bound and its Relation to A* and AO*.
.ft B
Artificial Intelligence,
.ft
Vol. 23, Number 1, (1984) 29-58.
.ip [\n+J]
Kumar, V. and Kanal, L.
A General Branch and Bound Formulation
for Understanding and Synthesizing
And/Or Tree Search Procedures.
.ft B
Artificial Intelligence,
.ft
Vol. 21 (March 1983) 179-198.
.ip [\n+J]
Huits, M. and Kumar, V. Comments on Distributive Partitioning
Algorithm.
.ft B
Information Processing Letters,
.ft
Vol. 8 (April 1979) 168-169.
.sp
.ne 5
.in 0
.ft B
C. Recent Technical Reports
.ft
.sp
.nr J 0 1
.ip [\n+J]
George Karypis and Vipin Kumar,
Multi-level Algorithms for Multi-Constraint Graph Partitioning.
Tech Report 98-, department of computer science, University
of Minnesota, 1998.
.ip [\n+J]
Mahesh Joshi, George Karypis, Vipin Kumar, and Anshul Gupta, "PSPASES: 
Scalable Parallel Direct Solver Library for Sparse Symmetric Positive
Definite Systems (Version 0.0beta)".
Tech Report 97-059, department of computer science, University
of Minnesota, 1997.
.ip [\n+J]
George Karypis, Kirk Schloegel, and Vipin Kumar, "ParMETIS: Parallel
Graph Partitioning and Sparse Matrix Ordering Library (Version 1.0)".
Tech Report 97-060, department of computer science, University
of Minnesota, 1997.
.ip [\n+J]
George Karypis and Vipin Kumar, "METIS: A Software Package for
Partitioning Unstructured Graphs, Partitioning Meshes, and Computing
Fill-Reducing Orderings of Sparse Matrices (Version 3.0.3)".
Tech Report 97-061, department of computer science, University
of Minnesota, 1997.

.sp 
.in 0
.ne 6
.ft B
D. Conference Papers
.sp
.nr J 0 1
.ip [\n+J]
William Leinberger, George Karypis, and Vipin Kumar,
Job Scheduling in the presence of Multiple Resource Requirements,
.ft B
Proceedings of Supercomputing '99
.ft
November 1999.
.ip [\n+J]
William Leinberger, George Karypis, Vipin kumar,
Multi-Capacity Bin Packing Algorithms with Applications 
to Job Scheduling under Multiple Constraints
.ft B
Proceedings of the International Conference on Parallel Processing '99
.ft
September, 1999.
.ip [\n+J]
Kirk Schloegel, George Karypis and Vipin Kumar,
A New Algorithm for Multi-objective Graph Partitioning
.ft B
Proceedings of Euro-Par'99
.ft
August 1999.
Also available as Technical Report TR 99-003,
Department of Computer Science and Engineering
University of Minnesota.
.ip [\n+J]
George Karypis and Vipin Kumar,
Multi-constraint Graph Partitioning
.ft B
Proceedings of Supercomputing '98
.ft
November 1998.
.ip [\n+J]
Kirk Schloegel, George Karypis and Vipin Kumar,
Dynamic Repartitioning of Adaptive Meshes
.ft B
Proceedings of Supercomputing '98
.ft
November 1998.
.ip [\n+J]
Kirk Schloegel and George Karypis and Vipin Kumar and Rupak Biswas and
Leonid Oliker,
A Performance Study of Diffusive vs. Remapped Load-Balancing Schemes.
.ft B
Proceedings of the 11th International Conference on Parallel and
Distributed Computing Systems (PDCS-98),
.ft
September 1998.
Technical Report TR 98-018 Department of Computer Science and Engineering
University of Minnesota.
.ip [\n+J]
A.Srivastava, E.Han, V.Kumar and V.Singh,
Parallel Formulations of Decision-Tree Classification Algorithms,
.ft B
Proceedings of the International Conference on Parallel Processing
.ft
August 1998.
.ip [\n+J]
Mahesh V. Joshi, George Karypis, and Vipin Kumar,
"ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large
Data Sets", 
.ft B
Proc. of 12th International Parallel Processing Symposium (IPPS98),
.ft
Orlando, March 1998. 
.ip [\n+J]
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar and Bamshad Mobasher,
Clustering Based On Association Rule Hypergraphs (1997),
.ft B
Workshop on Research Issues on Data Mining and Knowledge Discovery
.ft
1997. 
.ip [\n+J]
Jerome Moore, Eui-Hong (Sam) Han, Daniel Boley, Maria Gini, Robert Gross, 
Kyle Hastings, George Karypis, Vipin Kumar, and Bamshad Mobasher,
Web Page Categorization and Feature Selection Using Association Rule and 
Principal Component Clustering,
.ft B
Workshop on Information Technologies and Systems
.ft
1997.
.ip [\n+J]
Mahesh V. Joshi, George Karypis, and Vipin Kumar,
A High Performance Two Dimensional Scalable Parallel Algorithm for
Solving Sparse Triangular Systems,
.ft B
4th International Conference on High Performance Computing
.ft
December 1997.
.ip [\n+J]
Kirk Schloegel, George Karypis and Vipin Kumar,
Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion,
.ft B
Proceedings of Euro-Par'97
.ft
August 1997.
.ip [\n+J]
George Karypis and Vipin Kumar,
Parallel Threshold-Based ILUT Factorization,
.ft B
Proceedings of Supercomputing'97.
.ft
Extended version available as Tech Report 96-061, department of computer science, University
of Minnesota, 1996.
.ip [\n+J]
Multilevel Hypergraph Partitioning: Application in VLSI Domain,
G. Karypis and  R. Aggarwal and V. Kumar and S. Shekhar,
.ft B
Proceedings ACM/IEEE Design Automation Conference
.ft
June 97.
Extended version available as technical report TR 97R-006 from
Computer Science Department, University of Minnesota.
.ip [\n+J]
Scalable Parallel Data Mining for Association Rules,
E.H. Han and G. Karypis and V. Kumar,
.ft B
Proc. of 1997 ACM-SIGMOD International Conference on Management of Data,
.ft
May 1997.
.ip [\n+J]
Role of Message-Passing in Performance Oriented Parallel Programming,
V. Kumar, G. Karypis, and A. Grama,
.ft B
Proceedings of the Eight SIAM Conference  Conference on Parallel processing,
.ft
March 1997.
.ip [\n+J]
Anshul Gupta,  Fred Gustavson, Mahesh Joshi, George Karypis, Vipin Kumar,
Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems .
.ft B
Proceedings of the Eight SIAM Conference  Conference on Parallel processing,
.ft
March 1997.
Available as technical report TR 97-039 from
Computer Science Department, University of Minnesota.
.ip [\n+J]
George Karypis and Vipin Kumar,
Parallel Multi-level k-way Partitioning Scheme for Irregular Graphs,
.ft B
Proceedings of Supercomputing'96,
.ft
Pittsburgh, November 1996.
.ip [\n+J]
A. Grama, V. Kumar, and A. Sameh,
Parallel Hierarchical Solvers and Preconditioners for Boundary Element Methods,
.ft B
Proceedings of Supercomputing'96,
.ft
Pittsburgh, November 1996.
Selected as 
.ft B
Best Student paper Nominee
.ft
for Supercomputing 96.
.ip [\n+J]
R. Metzger, B. VanVoorst, L. Pires, R. Jha, W. Au, M. Amin, D. Castanon, V. Kumar,
The C3I Parallel Benchmark Suite - Introduction and Preliminary Results,
.ft B
Proceedings of Supercomputing'96,
.ft
Pittsburgh, November 1996. 
.ip [\n+J]
Ananth Grama, Vipin Kumar, Sanjay Ranka, and Vineet Singh,
A3: A Simple and Asymptotically Accurate Model for Parallel Computation,
.ft B
Proceedings of the Sixth Symposium on Frontiers of Massively Parallel Computing,
.ft
Annapolis, MD, October 1996.
.ip [\n+J]
Ananth Grama, Vipin Kumar and Ahmed Sameh,
"Parallel Iterative Solvers and
Preconditioners Using Approximate Hierarchical Methods", 
.ft B
proceedings of the Copper Mountain Conference on Iterative Methods,
.ft
April 1996, Copper Mountain, CO.
.ip [\n+J]
George Karypis and Vipin Kumar,
Parallel Multi-level Graph Partitioning.
.ft B
Proceedings of the International Parallel Processing Symposium,
.ft
April 1996.
.ip [\n+J]
Anshul Gupta and Vipin Kumar,
Parallel Algorithms for Forward and Back
Substitution in Direct Solution of Sparse Linear Systems,
.ft B
Proceedings of Supercomputing'95,  December 1995, San Diego.
.ft
.ip [\n+J]
Ananth Y. Grama, Vipin Kumar and Ahmed Sameh,
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods
.ft B
Proceedings of Supercomputing'95,  December 1995, San Diego.
.ft
.ip [\n+J]
George Karypis and Vipin Kumar,
Analysis of  Multi-level Graph Partitioning,
.ft B
Proceedings of Supercomputing'95,  December 1995, San Diego.
.ft
Also available as Tech Report 95-037, department of computer science, University
of Minnesota, 1995.
.ip [\n+J]
George Karypis and Vipin Kumar,
Multi-level Graph partitioning,
.ft B
Proceedings of 1995 International Conference on Parallel Processing.
.ft
.ip [\n+J]
S. Shekhar, S. Ravada, G. Turner, D. Chubb, and V. Kumar,
Load Balancing in High Performance GIS: Partitioning Polygonal Maps,
.ft B
Proc. Intl. Symp. on Large Spatial Databases,
.ft
Springer Verlag (Lecture Notes in Computer Science), (1995). 
.ip [\n+J]
George Karypis and Vipin Kumar,
A High Performance Sparse Cholesky Factorization Algorithm for Scalable
Parallel Computers,
.ft B
Proceedings of Frontiers '95 Conference,
.ft
February 1995.
Extended version available as
Tech Report 94-41 , department of computer science, University
of Minnesota, 1994.
.ip [\n+J]
Ananth Grama, Vipin Kumar and Ahmed Sameh, 
"On n-Body Simulations Using
Message Passing Parallel Computers", 
.ft B
Proceedings of the Seventh SIAM
Conference on Parallel Processing for Scientific Computing,
.ft
San Francisco, CA. 1995.
.ip [\n+J]
Anshul Gupta and Vipin Kumar,
A Scalable Parallel Algorithm for Sparse Matrix Factorization,
.ft B
Proceedings of Supercomputing'94
.ft
November 1994, Washington DC.
.ft B
Winner of the Outstanding Student Paper Award.
.ft
.ip [\n+J]
George Karypis, Anshul Gupta and Vipin Kumar,
A Highly Parallel Formulation of the Interior Point Algorithm for 
Linear programming,
.ft B
Proceedings of Supercomputing'94,  November 1994, Washington DC.
.ft
Also available as Tech Report 94-20 , department of computer science, University
of Minnesota, 1994.
.ip [\n+J]
Ananth Y. Grama, Vipin Kumar and Ahmed Sameh,
Scalable Parallel Formulations of the Barnes-Hut Algorithm,
.ft B
Proceedings of Supercomputing'94,  November 1994, Washington DC.
.ft
.ip [\n+J]
T. Nurkkala and V. Kumar,
A Parallel Parsing Algorithm for Natural Language using Tree Adjoining Grammar,
.ft B
Proceedings of the International Parallel Processing Symposium,
.ft
April 1994.
.ip [\n+J]
T. Nurkkala and V. Kumar,
The performance of a highly structured parallel algorithm on the KSR-1,
.ft B
Scalable High Performance Computing Conference,
.ft
May 1994, Knoxville.
.ip [\n+J]
D. Challou, M. Gini, and V. Kumar, 
"Fast 3D Motion Planning for Articulated Robots",
.ft B
1994 IEEE International Conference on Systems, Man, and 
Cybernetics.
.ft
.ip [\n+J]
A. Gupta and V. Kumar,
"On the scalability of Matrix Multiplication Algorithms on Parallel Computers",
.ft B
Proceedings of 1993 International Conference on Parallel Processing.
.ft
Extended version published as Tech Report TR 91-54, department of computer scien
ce, University
of Minnesota, 1991.
.ip [\n+J]
Anshul Gupta, Vipin Kumar, and Ahmed Sameh,
Performance and Scalability of Conjugate Gradient
Methods on Parallel Computers,
the Proceedings of 
.ft B
Sixth SIAM conference on Parallel
Processing for Scientific Computing, 1993.
.ft
Extended version available as
Tech Report 92-64, department of computer science, University
of Minnesota, 1992.
.ip [\n+J]
D. Challou, M. Gini, and V. Kumar,
"Toward Real-Time Motion Planning",
.ft B
Second Int'l Workshop on Parallel Processing for
Artificial Intelligence (PPAI-93),
.ft
Chambery, France, September 1993.
.ip [\n+J]
Challou, D. J., M. Gini, V. Kumar, 
``Parallel Search Algorithms for Robot Motion Planning,''
.ft B
Proceedings of the 1993 IEEE Conference on Robots
and Automation.
.ft
A longer version 
available as a Technical Report (TR 92-65) from
the University of Minnesota Department of Computer Science.
.ip [\n+J]
George Karypis and Vipin Kumar,
Efficient Parallel Implementations for Some Dynamic Programming Algorithms,
.ft B
Proceedings of the International Parallel Processing Symposium,
.ft
April 1993,
Extended version available as
Tech Report 92-59, department of computer science, University
of Minnesota, 1992.
.ip [\n+J]
Vipin Kumar, Shashi Shekhar and Minesh Amin,
A Highly Parallel Formulation of Backpropagation on Hypercubes:
A Summary of Results,
.ft B
1992 International Joint Conference on Neural Networks,
.ft
China, November 1992.
.ip [\n+J]
Ananth Y. Grama and Vipin Kumar,
"Scalability Analysis of Partitioning Strategies for Finite Element Graphs",
.ft B
Proceedings of Supercomputing'92,  November 1992, Minneapolis.
.ft
Extended version available as Tech Report 92-38, department of computer science, University 
of Minnesota, 1992. 
.ip [\n+J]
George Karypis and Vipin Kumar,
"Unstructured Tree Search on SIMD Parallel Computers",
.ft B
Proceedings of Supercomputing'92,  November 1992, Minneapolis.
.ft
Extended version available as 
Tech Report TR-92-21, department of computer science, University
of Minnesota, 1992.
.ip [\n+J]
Ananth Y. Grama, V. Kumar and V.N. Rao,
"Experimental Evaluation of Load Balancing Techniques for
the Hypercube",
.ft B
Proceedings of Parallel Computing 1991,
.ft
September 1991, London.
.ip [\n+J]
V. Kumar and A. Gupta,
"Analyzing the Scalability of Parallel Algorithms and Architectures: A Survey",
.ft B
Proceedings of the 1991 International Conference on Supercomputing,
.ft
June 1991, Germany.
A version of this paper appears 
as an invited paper in the Proc. of 29th Annual Allerton
Conference on Communication, Control and Computing,
Urbana,IL, October 1991.
Extended version available
as Tech Report TR 91-18, department of computer science, University
of Minnesota, 1991.
.ip [\n+J]
N. R. Vempaty,  V. Kumar, and R. Korf,
"Depth-First vs. Best-First Search",
.ft B
Proceedings of the
1991 National Conf. on Artificial Intelligence (AAAI-91),
.ft
pp 434-440, August 1991.
.ip [\n+J]
V.N. Rao and V. Kumar,
"Superlinear Speedup in Ordered Depth-First Search",
.ft B
Proceedings of 6th Distributed Memory Computing Conference (DMCC6),
.ft
May 1991.
.ip [\n+J]
V. Singh, V. Kumar, G. Agha, and C. Tomlinson,
"Scalability of Parallel Sorting on Mesh Multicomputers",
.ft B
Proceedings of the Fifth International Parallel Processing Symposium,
.ft
April 1991.
.ip [\n+J]
A. Gupta and V. Kumar,
"On the Scalability of FFT on Parallel Computers".
.ft B
Proceedings of Frontiers 90 Conference on Massively Parallel Computation. 
.ft
October 1990.
.ip [\n+J]
S. Arvindam, V. Kumar and V.N. Rao,
"Efficient Parallel Algorithms for Search Problems:
Applications in VLSI CAD".
.ft B
Proceedings of Frontiers 90 Conference on Massively Parallel Computation.  
.ft 
October 1990.
.ip [\n+J]
Kumar, V. and V. Singh,
Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem.
.ft B
Proceedings of 1990 International Conference on Parallel Processing.
.ft
August 1990.
.ip [\n+J]
S. Arvindam, V. Kumar, V.N. Rao and V. Singh,
Automatic Test Pattern Generation on Multiprocessors,
.ft B
Proceedings of the International Conference on Knowledge-Based Computer Systems
.ft
December 1989.
.ip [\n+J]
S. Arvindam, V. Kumar and V.N. Rao,
Floorplan Optimization on Multiprocessors,
.ft B
Proceedings of ICCD-89 (International Conference on Computer Design).
.ft
October 1989.
.ip [\n+J]
Kumar, V. and Rao, V.,
Load Balancing in Message Passing Multiprocessors,
.ft B
Proceedings of HCCA4
(Fourth Conf. on Hypercubes Concurrent Computers and Applications),
.ft
March 1989.
.ip [\n+J]
Lin, Y.J. and Kumar, V.
Performance of AND-Parallel Execution of Logic Programs
on a Shared-Memory Multiprocessor.
.ft B
Proceedings of the
International Conference on Fifth Generation Computer Systems,
.ft
Tokyo, November 1988.
.ip [\n+J]
Rao, V.N. and Kumar, V.
Superlinear Speedup in Parallel Search.
.ft B
Proceedings of
Foundations of Software Technology and Theoretical Computer Science
.ft
December 1988, New Delhi.
.ip [\n+J]
Kumar, V., Rao, V.N. and Ramesh, K.
Parallel Best-First Search of State-Space Graphs: A Summary
of Results.
.ft B 
Proceedings of the
1988 National Conf. on Artificial Intelligence (AAAI-88) 
.ft 
August 1988.
.ip [\n+J]
Kumar, V., Rao, V.N. and Ramesh, K.
Parallel Depth-First Search of the Ring Architecture.
Proceedings of the
.ft B
1988 International Parallel Processing Conference,
.ft
August 1988.
.ip [\n+J]
Rao, V.N. and Kumar, V.
Concurrent Insertions and Deletions in a Priority Queue.
Proceedings of the
.ft B
1988 International Parallel Processing Conference,
.ft
August 1988.
.ip [\n+J]
Lin, Y.J. and Kumar, V.
AND-Parallel Execution of Logic Programs on a Shared Memory
Multiprocessor: A Summary of Results.
.ft B
Proceedings of 1988 International Conference on Logic Programming
.ft
August 1988.
.ip [\n+J]
Kumar, V. and Y. Lin,
An Intelligent Backtracking Scheme for Prolog.
.ft B
Proceedings of the
1987 International Symposium on Logic programming,
.ft
September 1987, San Francisco.
.ip [\n+J]
Rao, V.N., Kumar, V. and Ramesh, K.
A Parallel implementation of the IDA* algorithm.
.ft B
the proceedings of National Conf. on Artificial Intelligence (AAAI-87),
.ft
July 1987, Seattle, Washington.
.ip [\n+J]
Kumar, V. and Lin, Yow-Jian 
A Framework for Intelligent Backtracking in Logic Programs.
Proceedings of the
.ft B
Sixth Conference on Foundations of Software Technology
and Theoretical Computer Science
.ft
Delhi, December 1986,
Springer-Verlag lecture notes #241.
.ip [\n+J]
Lin, Y. Kumar, V. and Leung, C.
An Intelligent Backtracking Algorithm for Parallel Execution
of Logic Programs,
.ft B
Proceedings of the Third International Conference on Logic Programming
.ft
London, July 1986.
.ip [\n+J]
Lin, Yow-Jian, and Kumar, V.
A Parallel Execution Scheme for Exploiting AND-parallelism
of Logic Programs,
.ft B
Proceedings of the 1986 conference on Parallel Processing,
.ft
August 1986.
.ip [\n+J]
Kumar, V., Nau, D. and Kanal, L.
A Generalization of the AO* Algorithm,
Proceedings of the
.ft B
IEEE Computer Society's
Ninth International Computer Software & Applications Conference
(COMPSAC-85),
.ft
October, 1985, Chicago, Illinois.
.ip [\n+J]
Kumar, V.
A General Bottom-up Procedure for Searching AND/OR Graphs,
proceedings of
.ft B
1984 National Conference on Artificial Intelligence (AAAI-84),
.ft
August 1984, Austin, Texas.
.ip [\n+J]
Kumar, V. and Kanal, L.
New Insights Into the Relationships Among Branch & Bound,
Dynamic Programming and Heuristic Search Procedures,
the proceedings of the
.ft B
1983 IEEE International Conference on Systems, Man, and Cybernetics,
.ft
December 1983, India.
.br
Also presented in the
.ft B
IEEE International Symposium on Information Theory,
.ft
September 1983, Canada.
.ip [\n+J]
Kumar, V. and Kanal, L.
The Composite Decision Process: A Unifying Formulation
For Heuristic Search, Dynamic Programming, and Branch & Bound Procedures,
Proc. of the
.ft B
National Conference on Artificial Intelligence (AAAI-83),
.ft
Washington, D.C., August 1983.
.ip [\n+J]
Nau, D., Kumar, V. and Kanal, L.
A Paradigm for A.I. Search Algorithms.
Proc. of the
.ft B
National conference on Artificial Intelligence
(AAAI-82),
.ft
Pittsburgh,
August 1982.
.ip [\n+J]
Kumar, V. and Kanal, L.
Branch and Bound Formulations for
Sequential and Parallel And/Or Tree Search.
Proc. of the
.ft B
1982 International Conference on Pattern Recognition and
Image Processing,
.ft
Munich, October 1982.
.ip [\n+J]
Kanal, L. and Kumar, V.
Parallel Implementations of a Structural Analysis Algorithm.
.ft B
Proc. IEEE Computer Society Conf. Pattern Recognition and Image Processing,
.ft
Dallas, August 1981, 452-458.
.ip [\n+J]
Kanal, L. and Kumar, V.
A Branch and Bound Formulation for Sequential and Parallel Game
Tree Searching.
.ft B
Proc. Seventh International Joint Conference on Artificial Intelligence
(IJCAI-81),
.ft
Vancouver, August 1981, 569-571.
.sp 
.in 0
.ne 6
.ft B
E. Book Chapters
.sp
.nr J 0 1
.ip [\n+J]
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar and Bamshad Mobasher,
Hypergraph-basd Clustering in High Dimensional Data Sets:
A Summary of Results,
.ft B
Bulletin of the Technical Committee on Data Engineering,
Volume 21, Number 1, March 1998.
.ip [\n+J]
M. Gini, D. Challou, D. Boley, V. Kumar, C. Olsen,
``Parallel Search Algorithms for Robot Motion Planning,''
.ft B
Practical Motion Planning in Robotics
.ft
Edited by K. Gupta and A. del Pobil,
John Wiley and Sons, Ltd. 1998.
.ip [\n+J]
Ananth Grama, Vipin Kumar and Ahmed Sameh,
Parallel Hierarchical Solvers and Preconditioners for
Boundary Element Methods,
.ft B
Computational Electromagnetics and Its Applications
.ft
Edited by Thomas G. Campbell, R. A. Nicolaides, and Manuel D. Salas,
Kluwer Academic Publisher, 1997,
Volume 5 in ICASE/LaRC Interdisciplinary Series in Science and Engineering.
.ip [\n+J]
Anshul Gupta, George Karypis and Vipin Kumar,
Scalable Parallel Algorithm for Sparse Linear Systems,
.ft B
Parallel Computing in Optimization
.ft
Edited by A. Migdalas, P. M. Pardalos, and S. Storoy,
Kluwer Academic Publisher, 1997.
.ip [\n+J]
Vipin Kumar, Ananth Grama Anshul Gupta, and George Karypis
Scalable Parallel Algorithm for Unstructured Problems
.ft B
Parallel Algorithms for Irregular Problems: State of the Art.
.ft
Edited by A. Ferreira and J. Rolim
Kluwer Academic Publisher, 1995.
.ip [\n+J]
D. Challou, M. Gini, and V. Kumar,
Toward Real-Time Motion Planning,
.ft B
Parallel Processing for Artificial Intelligence Volume 2
.ft
H. Kitano, V. Kumar, and C.B. Suttner (eds),
Elsevier Science Publ, pp 163-175, 1994.
.ip [\n+J]
``Parallel Processing of Discrete Optimization Problems''
by Grama Y. Ananth, Vipin Kumar and Panos Pardalos 
in
.ft B
Encyclopedia of Microcomputers,
.ft
John Wiley & Sons, 1993.
.ip [\n+J]
Kumar, V. and Kanal, L.
The CDP: A Unifying Formulation
For Heuristic Search, Dynamic Programming, and Branch & Bound Procedures,
.ft B
Search in Artificial Intelligence,
.ft
edited by L. Kanal and V. Kumar,
Springer Verlag, 1988, pp. 1-27.
.ip [\n+J]
Kumar, V., Nau, D. S. and Kanal, L.
A General Branch-and-Bound Procedure for AND/OR Graph and Game Tree Search.
.ft B
Search in Artificial Intelligence,
.ft
edited by L. Kanal and V. Kumar,
Springer Verlag, 1988, 91-130.
.ip [\n+J]
``Branch-and-Bound Search''
in
.ft B
Encyclopedia of Artificial Intelligence (second edition)
.ft
John Wiley & Sons, 1992, pp 1468-1472.
An earlier version appeared in
Encyclopedia of Artificial Intelligence
.ft
John Wiley & Sons, 1987.
.ip [\n+J]
``Depth-First Search''
in
.ft B 
Encyclopedia of Artificial Intelligence  (second edition)
.ft 
John Wiley & Sons, 1992, pp 1473-1473.
An earlier version appeared in
Encyclopedia of Artificial Intelligence
.ft
John Wiley & Sons, 1987
.ip [\n+J]
``Thoughts on Parallel Processing'' in
.ft B
Byte
.ft
(special issue on Multiprocessing),
May 1985, Vol. 10, No. 5.