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