default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Cohn
Person information
- affiliation: Brandeis University, Waltham, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c6]Kevin Doherty
, José Marcano Belisario, Martin Cohn, Nikolaos Mastellos, Cecily Morrison, Josip Car, Gavin J. Doherty:
Engagement with Mental Health Screening on Mobile Devices: Results from an Antenatal Feasibility Study. CHI 2019: 186
1990 – 1999
- 1998
- [c5]Harald Helfgott, Martin Cohn:
Linear-Time Construction of Optimal Context Trees. Data Compression Conference 1998: 369-377 - 1997
- [c4]Harald Helfgott, Martin Cohn:
On Maximal Parsings. Data Compression Conference 1997: 291-299 - [c3]Martin Cohn, Harald Helfgott:
Asymmetry in Ziv/Lempel '78 parsing. SEQUENCES 1997: 320-328 - [e6]James A. Storer, Martin Cohn:
Proceedings of the 7th Data Compression Conference (DCC '97), Snowbird, Utah, USA, March 25-27, 1997. IEEE Computer Society 1997, ISBN 0-8186-7761-9 [contents] - 1996
- [c2]Martin Cohn, Roger Khazan:
Parsing with Prefix and Suffix Dictionaries. Data Compression Conference 1996: 180-189 - [e5]James A. Storer, Martin Cohn:
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31 - April 3, 1996. IEEE Computer Society 1996, ISBN 0-8186-7358-3 [contents] - 1995
- [j22]Martin Cohn:
on the Channel Capacity of Read/write Isolated Memory. Discret. Appl. Math. 56(1): 1-8 (1995) - [e4]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1995, Snowbird, Utah, USA, March 28-30, 1995. IEEE Computer Society 1995, ISBN 0-8186-7012-6 [contents] - 1994
- [e3]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1994, Snowbird, Utah, USA, March 29-31, 1994. IEEE Computer Society 1994, ISBN 0-8186-5637-9 [contents] - 1993
- [e2]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1993, Snowbird, Utah, USA, March 30 - April 1, 1993. IEEE Computer Society 1993, ISBN 0-8186-3392-1 [contents] - 1992
- [j21]Jianhua Lin, James A. Storer, Martin Cohn:
Optimal Pruning for Tree-Structured Vector Quantization. Inf. Process. Manag. 28(6): 723-734 (1992) - [e1]James A. Storer, Martin Cohn:
Proceedings of the IEEE Data Compression Conference, DCC 1992, Snowbird, Utah, USA, March 24-27, 1992. IEEE Computer Society 1992, ISBN 0-8186-2717-4 [contents] - 1991
- [c1]Jianhua Lin, James A. Storer, Martin Cohn:
On The Complexity of Optimal Tree Pruning for Source Coding. Data Compression Conference 1991: 63-72
1980 – 1989
- 1985
- [j20]Martin Cohn:
Counting Sequences with Large Local Distance. IEEE Trans. Computers 34(6): 562-565 (1985) - [j19]Abraham Lempel, Martin Cohn:
Design of universal test sequences for VLSI. IEEE Trans. Inf. Theory 31(1): 10-17 (1985) - 1982
- [j18]Abraham Lempel, Martin L. Cohn:
Maximal families of bent sequences. IEEE Trans. Inf. Theory 28(6): 865-868 (1982) - [j17]Abraham Lempel, Martin L. Cohn:
Look-ahead coding for input- restricted channels. IEEE Trans. Inf. Theory 28(6): 933-937 (1982) - 1981
- [j16]John P. Robinson, Martin Cohn:
Counting Sequences. IEEE Trans. Computers 30(1): 17-23 (1981)
1970 – 1979
- 1979
- [j15]Garold S. Tjaden, Martin Cohn:
Special Feature Some Considerations in the Design of Mainframe Processors with Microprocessor Technology. Computer 12(8): 68-74 (1979) - 1977
- [j14]Abraham Lempel, Martin Cohn, Willard L. Eastman:
A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inf. Theory 23(1): 38-42 (1977) - [j13]Martin Cohn, Abraham Lempel:
On fast M-sequence transforms (Corresp.). IEEE Trans. Inf. Theory 23(1): 135-137 (1977) - 1975
- [j12]Martin Cohn, Abraham Lempel:
Difference codes with desirable spectral properties (Corresp.). IEEE Trans. Inf. Theory 21(5): 593-596 (1975) - 1973
- [j11]Abraham Lempel, Shimon Even, Martin Cohn:
An algorithm for optimal prefix parsing of a noiseless and memoryless channel. IEEE Trans. Inf. Theory 19(2): 208-214 (1973) - 1972
- [j10]Martin Cohn, Abraham Lempel:
Cycle Decomposition by Disjoint Transpositions. J. Comb. Theory A 13(1): 83-89 (1972) - 1971
- [j9]Martin Cohn, A. James Lincoln:
Spectral Properties of Waveforms Generated by Smooth Sequences. IEEE Trans. Computers 20(3): 330-332 (1971) - 1970
- [j8]Martin Cohn:
Authors' Reply3. IEEE Trans. Computers 19(7): 654 (1970)
1960 – 1969
- 1969
- [j7]Martin Cohn, Shimon Even:
The Design of Shift Register Generators for Finite Sequences. IEEE Trans. Computers 18(7): 660-662 (1969) - [j6]Martin Cohn, Shimon Even:
A Gray Code Counter. IEEE Trans. Computers 18(7): 662-664 (1969) - 1965
- [j5]Martin Cohn, Shimon Even:
Identification and Minimization of Linear Machines. IEEE Trans. Electron. Comput. 14(3): 367-376 (1965) - 1964
- [j4]Martin Cohn:
Properties of Linear Machines. J. ACM 11(3): 296-301 (1964) - [j3]Martin Cohn:
A Theorem on Linear Automata. IEEE Trans. Electron. Comput. 13(1): 52-53 (1964) - 1963
- [j2]Martin Cohn:
Affine m-ary Gray Codes. Inf. Control. 6(1): 70-78 (1963) - 1962
- [j1]Martin Cohn:
Inconsistent Canonical Forms of Switching Functions. IRE Trans. Electron. Comput. 11(2): 284-285 (1962)
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 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
