default search action
A. Bagchi
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1997
- [j10]Nikhil R. Pal, Sukumar Chakraborty, A. Bagchi:
RID3: An ID3-Like Algorithm for Real Data. Inf. Sci. 96(3&4): 271-290 (1997) - 1994
- [j9]T. V. Lakshman, A. Bagchi, K. Rastani:
A graph-coloring scheme for scheduling cell transmissions and its photonic implementation. IEEE Trans. Commun. 42(234): 2062-2070 (1994) - 1993
- [j8]K. V. Viswanathan, A. Bagchi:
Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Oper. Res. 41(4): 768-776 (1993) - 1992
- [j7]A. Bagchi:
On Sorting in the Presence of Erroneous Information. Inf. Process. Lett. 43(4): 213-215 (1992) - 1990
- [j6]D. Ivanchev, A. Bagchi:
Book reviews. ZOR Methods Model. Oper. Res. 34(4): 320-323 (1990) - 1985
- [j5]A. Bagchi, Pradip K. Srimani:
Weighted Heuristic Search in Networks. J. Algorithms 6(4): 550-576 (1985) - 1982
- [j4]A. Bagchi, Edward M. Reingold:
Aspects of insertion in random trees. Computing 29(1): 11-29 (1982) - 1979
- [j3]A. Bagchi, J. K. Roy:
On V-Optimal Trees. SIAM J. Comput. 8(4): 524-541 (1979) - 1976
- [j2]Sam L. 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) - 1975
- [j1]A. Bagchi:
Symposium on stochastic control. Autom. 11(2): 213-217 (1975)
Conference and Workshop Papers
- 1994
- [c7]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
- [c6]A. Gupta, A. Bagchi:
Learning Object Models in Visual Semantic Networks. ICTAI 1992: 204-211 - [c5]T. V. Lakshman, A. Bagchi, K. Rastani:
A Fast Parallel Scheduler for Resource Requests Implemented Using Optical Devices. IPPS 1992: 169-172 - 1988
- [c4]K. V. Viswanathan, A. Bagchi:
An Exact Best-First Search Procedure for the Constrained Rectangular Guillotine Knapsack Problem. AAAI 1988: 145-149 - 1984
- [c3]Asim K. Pal, A. Bagchi:
On the Mean Weight Balance Factor of Binary Trees. FSTTCS 1984: 419-434 - 1973
- [c2]Peter Weiner, Sam L. Savage, A. Bagchi:
Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient. STOC 1973: 207-213 - 1972
- [c1]Albert R. Meyer, A. Bagchi:
Program Size and Economy of Descriptions: Preliminary Report. STOC 1972: 183-186
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint