The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Cohn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Cohn, Roger Khazan
    Parsing with Prefix and Suffix Dictionaries. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:180-189 [Conf]
  2. Harald Helfgott, Martin Cohn
    On Maximal Parsings. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:291-299 [Conf]
  3. Harald Helfgott, Martin Cohn
    Linear-Time Construction of Optimal Context Trees. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:369-377 [Conf]
  4. Jianhua Lin, James A. Storer, Martin Cohn
    On The Complexity of Optimal Tree Pruning for Source Coding. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:63-72 [Conf]
  5. Martin Cohn
    on the Channel Capacity of Read/write Isolated Memory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:1, pp:1-8 [Journal]
  6. Martin Cohn
    Affine m-ary Gray Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1963, v:6, n:1, pp:70-78 [Journal]
  7. Jianhua Lin, James A. Storer, Martin Cohn
    Optimal Pruning for Tree-Structured Vector Quantization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Manage., 1992, v:28, n:6, pp:723-734 [Journal]
  8. Martin Cohn
    Properties of Linear Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1964, v:11, n:3, pp:296-301 [Journal]
  9. Martin Cohn, Abraham Lempel
    Cycle Decomposition by Disjoint Transpositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:13, n:1, pp:83-89 [Journal]
  10. Martin Cohn
    Counting Sequences with Large Local Distance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:6, pp:562-565 [Journal]
  11. John P. Robinson, Martin Cohn
    Counting Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:1, pp:17-23 [Journal]
  12. Abraham Lempel, Martin Cohn
    Design of universal test sequences for VLSI. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:1, pp:10-17 [Journal]

Search in 0.003secs, Finished in 0.003secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002