The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Carlos R. P. Hartmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pramod K. Varshney, Carlos R. P. Hartmann, Jamie M. de Faria Jr.
    Application of Information Theory to Sequential Fault Diagnosis. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:2, pp:164-170 [Journal]
  2. Warren H. Debany Jr., Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra
    Comparison of Random Test Vector Generation Strategies. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:244-247 [Conf]
  3. Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
    Towards Optimal Parallel Radix Sorting. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:193-197 [Conf]
  4. D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
    A Concurrent Testing Strategy for PLAs. [Citation Graph (0, 0)][DBLP]
    ITC, 1986, pp:705-709 [Conf]
  5. Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
    Parallel Integer Sorting Using Small Operations [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:1, pp:79-92 [Journal]
  6. Carlos R. P. Hartmann, K. K. Tzeng
    Generalizations of the BCH Bound [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:20, n:5, pp:489-498 [Journal]
  7. Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
    PRAMs with Variable Word-Size. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:4, pp:217-222 [Journal]
  8. Ramachandran Vaidyanathan, Carlos R. P. Hartmann, Pramod K. Varshney
    Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:1, pp:31-36 [Journal]
  9. Sumit DasGupta, Carlos R. P. Hartmann, Luther D. Rudolph
    Dual-Mode Logic for Function-Independent Fault Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1980, v:29, n:11, pp:1025-1029 [Journal]
  10. John Knaizuk Jr., Carlos R. P. Hartmann
    An Algorithm for Testing Random Access Memories. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:4, pp:414-416 [Journal]
  11. John Knaizuk Jr., Carlos R. P. Hartmann
    An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:11, pp:1141-1144 [Journal]
  12. D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
    A Note on t-EC/d-UED Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:5, pp:660-663 [Journal]
  13. D. L. Tao, Carlos R. P. Hartmann, Parag K. Lala
    A General Technique for Designing Totally Self-Checking Checker for 1-out-of-N Code with Minimum Gate Delay. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:7, pp:881-886 [Journal]
  14. Pramod K. Varshney, Carlos R. P. Hartmann
    Sequential Fault Diagnosis of Modular Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:2, pp:194-197 [Journal]
  15. K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen
    Decoding by local optimization. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:740-0 [Journal]
  16. Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann
    Iteratively maximum likelihood decodable spherical codes and a method for their construction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:480-485 [Journal]
  17. Yunghsiang S. Han, Carlos R. P. Hartmann
    The zero-guards algorithm for general minimum-distance decoding problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1655-1658 [Journal]
  18. Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen
    Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1514-1523 [Journal]
  19. Yunghsiang S. Han, Carlos R. P. Hartmann, Kishan G. Mehrotra
    Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1233-1246 [Journal]
  20. Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra, Carl L. Gerberich
    Application of information theory to the construction of efficient decision trees. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:4, pp:565-577 [Journal]
  21. Lev B. Levitin, Carlos R. P. Hartmann
    A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:378-384 [Journal]
  22. Ching-Cheng Shih, Christopher R. Wulff, Carlos R. P. Hartmann, Chilukuri K. Mohan
    Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3023-3038 [Journal]
  23. N. N. Tendolkar, Carlos R. P. Hartmann
    Generalization of chase algorithms for soft decision decoding of binary linear codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:714-721 [Journal]
  24. D. L. Tao, Carlos R. P. Hartmann
    A Novel Concurrent Error Detection Scheme for FFT Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:2, pp:198-221 [Journal]
  25. D. L. Tao, Carlos R. P. Hartmann, Yunghsing S. (Sam) Han
    New Encoding/Decoding Methods for Designing Fault-Tolerant Matrix Operations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:9, pp:931-938 [Journal]
  26. Po-Ning Chen, Yunghsiang S. Han, Carlos R. P. Hartmann, Hong-Bin Wu
    Analysis of Sequential Decoding Complexity Using the Berry-Esseen Inequality [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  27. A new algorithm-based fault tolerance technique for computing matrix operations. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002