|
Search the dblp DataBase
P. S. Gopalakrishnan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
Computing Tree Functions on Mesh-Connected Computers. [Citation Graph (0, 0)][DBLP] ICPP, 1985, pp:703-710 [Conf]
- P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
An Efficient Connected Components Algorithm on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP] ICPP, 1985, pp:711-714 [Conf]
- P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
Parallel Approximate Algorithms for the 0-1 Knapsack Problem. [Citation Graph (0, 0)][DBLP] ICPP, 1986, pp:444-451 [Conf]
- Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan
A Parallel Algorithm for Dominators. [Citation Graph (0, 0)][DBLP] ICPP, 1986, pp:877-879 [Conf]
- L. R. Bahl, Peter V. de Souza, P. S. Gopalakrishnan, David Nahamoo, Michael Picheny
Context Dependent Modeling of Phones in Continuous Speech Using Decision Trees. [Citation Graph (0, 0)][DBLP] HLT, 1991, pp:- [Conf]
- P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal
Approximate Algorithms for the Knapsack Problem on Parallel Computers [Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:91, n:2, pp:155-171 [Journal]
- Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan
Computing Dominators in Parallel. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:4, pp:217-221 [Journal]
- P. S. Gopalakrishnan, Dimitri Kanevsky, Arthur Nádas, David Nahamoo
An inequality for rational functions with applications to some statistical estimation problems. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:1, pp:107-113 [Journal]
Search in 0.002secs, Finished in 0.002secs
|