Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bagchi, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Gossiping with multiple sends and receives
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Discrete Applied Mathematics
64
, 1996, pp. 105-116
Parallel information dissemination by packets
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
SIAM Journal on Computing
23
(2), 1994, April, pp. 355-372
Gossiping with multiple sends and receives
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Proceedings of the 8th International Parallel Processing Symposium, IPPS'94 (CancĂșn, Mexico, April 26-29, 1994)
, 1994, pp. 757-761
A general framework for minimax search in game trees
Subir Bhattacharya
,
A. Bagchi
Information Processing Letters
52
, 1994, pp. 295-301
A faster alternative to SSS* with extension to variable memory
Subir Bhattacharya
,
A. Bagchi
Information Processing Letters
47
(4), 1993, pp. 209-214
On minimum fault-tolerant networks
S. Ueno
,
A. Bagchi
,
S.L. Hakimi
,
E.F. Schmeichel
SIAM Journal on Discrete Mathematics
6
(4), 1993, November, pp. 565-574
Sequential information dissemniation by packets
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Networks
22
(4), 1992, pp. 317-333
On sorting in the presence of erroneous information
A. Bagchi
Information Processing Letters
43
, 1992, pp. 213-215
Parallel algorithms for information dissemination by packets
A. Bagchi
,
E.F. Schmeichel
,
S.L. Hakimi
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 274-281
Parallel algorithms for gossiping by mail
A. Bagchi
,
S.L. Hakimi
,
J. Mitchem
,
E. Schmeichel
Information Processing Letters
34
, 1990, pp. 197-202
Three approaches to heuristic search in networks
A. Bagchi
,
A. Mahanti
Journal of the ACM
32
(1), 1985, pp. 1-27
Asymptotic normality in the generalized Polya-Eggenberger urn model, with an application to computer data structures
A. Bagchi
,
A.K. Pal
SIAM Journal on Algebraic Discrete Methods
6
(3), 1985, July, pp. 394-405
Weighted heuristic search in networks
A. Bagchi
,
P.K. Srimani
Journal of Algorithms
6
(4), 1985, pp. 550-576
AND/OR graph heuristic search methods
A. Mahanti
,
A. Bagchi
Journal of the ACM
32
(1), 1985, pp. 28-51
On the mean weight balance factor of binary trees
A.K. Pal
,
A. Bagchi
Lecture Notes in Computer Science
181
, 1984, pp. 419-434
Admissible heuristic search in AND/OR graphs
A. Bagchi
,
A. Mahanti
Theoretical Computer Science
24
(2), 1983, pp. 207-219
Search algorithms under different kinds of heuristics - a comparative study
A. Bagchi
,
A. Mahanti
Journal of the ACM
30
(1), 1983, pp. 1-21
Heuristic search in a branch-and-bound framework
A. Bagchi
,
Pradip K. Srimani
Proceedings of the 2nd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1982 (Bangalore, India, December 13-15, 1981)
, 1982, pp. 338-362
Admissible heuristic search in AND/OR graphs
A. Bagchi
,
A. Mahanti
Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981)
, 1981, pp. 9-19
On v-optimal trees
A. Bagchi
,
J.K. Roy
SIAM Journal on Computing
8
(4), 1979, November, pp. 524-541
Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
Sam Savage
,
Peter Weiner
,
A. Bagchi
Journal of Computer and System Sciences
12
, 1976, pp. 25-35
Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
P. Weiner
,
S.L. Savage
,
A. Bagchi
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 207-213
Program size and economy of descriptions
A.R. Meyer
,
A. Bagchi
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 183-186