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

A. Bagchi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2005
17EES. I. Aihara, A. Bagchi: Parameter Estimation of Parabolic Type Factor Model and Empirical Study of US Treasury Bonds. System Modelling and Optimization 2005: 207-217
1997
16 Nikhil R. Pal, Sukumar Chakraborty, A. Bagchi: RID3: An ID3-Like Algorithm for Real Data. Inf. Sci. 96(3&4): 271-290 (1997)
1994
15 A. Bagchi, K. A. Clements, P. W. Davis, F. H. Maurais: A Comparison of Algorithms for Least Absolute Value State Estimation in Electoric Power Networks. ISCAS 1994: 53-56
1992
14 A. Gupta, A. Bagchi: Learning Object Models in Visual Semantic Networks. ICTAI 1992: 204-211
13 T. V. Lakshman, A. Bagchi, K. Rastani: A Fast Parallel Scheduler for Resource Requests Implemented Using Optical Devices. IPPS 1992: 169-172
12 A. Bagchi: On Sorting in the Presence of Erroneous Information. Inf. Process. Lett. 43(4): 213-215 (1992)
1988
11 K. V. Viswanathan, A. Bagchi: An Exact Best-First Search Procedure for the Constrained Rectangular Guillotine Knapsack Problem. AAAI 1988: 145-149
1985
10EEA. Bagchi, A. Mahanti: Three Approaches to Heuristic Search in Networks J. ACM 32(1): 1-27 (1985)
9EEA. Mahanti, A. Bagchi: AND/OR Graph Heuristic Search Methods J. ACM 32(1): 28-51 (1985)
8 A. Bagchi, Pradip K. Srimani: Weighted Heuristic Search in Networks. J. Algorithms 6(4): 550-576 (1985)
1984
7 Asim K. Pal, A. Bagchi: On the Mean Weight Balance Factor of Binary Trees. FSTTCS 1984: 419-434
1983
6EEA. Bagchi, A. Mahanti: Search Algorithms Under Different Kinds of Heuristics-A Comparative Study J. ACM 30(1): 1-21 (1983)
5 A. Bagchi, A. Mahanti: Admissible Heuristic Search in And/Or Graphs. Theor. Comput. Sci. 24: 207-219 (1983)
1979
4 A. Bagchi, J. K. Roy: On V-Optimal Trees. SIAM J. Comput. 8(4): 524-541 (1979)
1976
3 Sam Savage, Peter Weiner, A. Bagchi: Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient. J. Comput. Syst. Sci. 12(1): 25-35 (1976)
1973
2 Peter Weiner, S. L. Savage, A. Bagchi: Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient STOC 1973: 207-213
1972
1 Albert R. Meyer, A. Bagchi: Program Size and Economy of Descriptions: Preliminary Report STOC 1972: 183-186

Coauthor Index

1S. I. Aihara [17]
2Sukumar Chakraborty [16]
3K. A. Clements [15]
4P. W. Davis [15]
5A. Gupta [14]
6T. V. Lakshman [13]
7A. Mahanti [5] [6] [9] [10]
8F. H. Maurais [15]
9Albert R. Meyer [1]
10Asim K. Pal [7]
11Nikhil R. Pal [16]
12K. Rastani [13]
13J. K. Roy [4]
14S. L. Savage [2]
15Sam Savage [3]
16Pradip K. Srimani [8]
17K. V. Viswanathan [11]
18Peter Weiner [2] [3]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)