| 2011 | ||
|---|---|---|
| 64 | Jacob Ziv: An Axiomatic Approach to the Notion of Similarity of Individual Sequences and Their Classification. CCP 2011: 3-7 | |
| 63 | Jacob Ziv: An Axiomatic Approach to the notion of Similarity of individual Sequences and their Classification CoRR abs/1102.5482: (2011) | |
| 2009 | ||
| 62 | Jacob Ziv: On the optimality of universal classifiers for finite-length individual test sequences CoRR abs/0909.4233: (2009) | |
| 61 | Jacob Ziv: The universal LZ77 compression algorithm is essentially optimal for individual finite-length N-blocks. IEEE Transactions on Information Theory 55(5): 1941-1944 (2009) | |
| 2008 | ||
| 60 | Jacob Ziv: On Finite Memory Universal Data Compression and Classification of Individual Sequences. IEEE Transactions on Information Theory 54(4): 1626-1636 (2008) | |
| 2007 | ||
| 59 | Jacob Ziv: Classification With Finite Memory Revisited. IEEE Transactions on Information Theory 53(12): 4413-4421 (2007) | |
| 58 | Ilan Sutskover, Shlomo Shamai, Jacob Ziv: Constrained Information Combining: Theory and Applications for LDPC Coded Systems. IEEE Transactions on Information Theory 53(5): 1617-1643 (2007) | |
| 57 | Jacob Ziv, Neri Merhav: On Context-Tree Prediction of Individual Sequences. IEEE Transactions on Information Theory 53(5): 1860-1866 (2007) | |
| 2006 | ||
| 56 | Jacob Ziv: On Finite Memory Universal Data Compression and Classification of Individual Sequences CoRR abs/cs/0612019: (2006) | |
| 55 | Neri Merhav, Jacob Ziv: On the Wyner-Ziv problem for individual sequences. IEEE Transactions on Information Theory 52(3): 867-873 (2006) | |
| 2005 | ||
| 54 | Neri Merhav, Jacob Ziv: On the Wyner-Ziv problem for individual sequences CoRR abs/cs/0505010: (2005) | |
| 53 | Jacob Ziv, Neri Merhav: On context-tree prediction of individual sequences CoRR abs/cs/0508127: (2005) | |
| 52 | Ilan Sutskover, Shlomo Shamai, Jacob Ziv: Extremes of information combining. IEEE Transactions on Information Theory 51(4): 1313-1325 (2005) | |
| 2004 | ||
| 51 | Jacob Ziv: Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data". IEEE Transactions on Information Theory 50(8): 1851-1852 (2004) | |
| 2002 | ||
| 50 | Henry J. Landau, James E. Mazo, Shlomo Shamai, Jacob Ziv: Shannon theory: Perspective, trends, and applications special issue dedicated to Aaron D. Wyner. IEEE Transactions on Information Theory 48(6): 1237-1242 (2002) | |
| 49 | Jacob Ziv: An efficient universal prediction algorithm for unknown sources with limited training data. IEEE Transactions on Information Theory 48(6): 1690-1693 (2002) | |
| 2001 | ||
| 48 | Jacob Ziv: A universal prediction lemma and applications to universal data compression and prediction. IEEE Transactions on Information Theory 47(4): 1528-1532 (2001) | |
| 2000 | ||
| 47 | Z. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv: On the temporal HZY compression scheme. SODA 2000: 185-186 | |
| 1999 | ||
| 46 | Amos Lapidoth, Jacob Ziv: On the decoding of convolutional codes on an unknown channel. IEEE Transactions on Information Theory 45(7): 2321-2332 (1999) | |
| 1998 | ||
| 45 | Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv: Augmenting Suffix Trees, with Applications. ESA 1998: 67-78 | |
| 44 | Yehuda Hershkovits, Jacob Ziv: On Sliding-Window Universal Data Compression with Limited Memory. IEEE Transactions on Information Theory 44(1): 66-78 (1998) | |
| 43 | Amos Lapidoth, Jacob Ziv: On the Universality of the LZ-Based Decoding Algorithm. IEEE Transactions on Information Theory 44(5): 1746-1755 (1998) | |
| 42 | Aaron D. Wyner, Jacob Ziv, A. J. Wyner: On the Role of Pattern Matching in Information Theory. IEEE Transactions on Information Theory 44(6): 2045-2056 (1998) | |
| 1997 | ||
| 41 | Neri Merhav, Jacob Ziv: On the amount of statistical side information required for lossy data compression. IEEE Transactions on Information Theory 43(4): 1112-1121 (1997) | |
| 40 | Yehuda Hershkovits, Jacob Ziv: On fixed-database universal data compression with limited memory. IEEE Transactions on Information Theory 43(6): 1966-1976 (1997) | |
| 1996 | ||
| 39 | Aaron D. Wyner, Jacob Ziv: Classification with finite memory. IEEE Transactions on Information Theory 42(2): 337-347 (1996) | |
| 38 | J. Stein, Jacob Ziv, Neri Merhav: Universal delay estimation for discrete channels. IEEE Transactions on Information Theory 42(6): 2085-2093 (1996) | |
| 1995 | ||
| 37 | Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv: On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. SODA 1995: 48-57 | |
| 36 | Dafna Sheinwald, Abraham Lempel, Jacob Ziv: On Encoding and Decoding with Two-Way Head Machines Inf. Comput. 116(1): 128-133 (1995) | |
| 1993 | ||
| 35 | Jacob Ziv: Correction to 'Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources' (Jul 90 861-863). IEEE Transactions on Information Theory 39(1): 312- (1993) | |
| 34 | Jacob Ziv, Neri Merhav: A measure of relative entropy between individual sequences with application to universal classification. IEEE Transactions on Information Theory 39(4): 1270-1279 (1993) | |
| 1992 | ||
| 33 | Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv: On the Coding Delay of a General Coder. Data Compression Conference 1992: 102-111 | |
| 32 | Jacob Ziv, Neri Merhav: Estimating the number of states of a finite-state source. IEEE Transactions on Information Theory 38(1): 61-65 (1992) | |
| 31 | Eli Plotnik, Marcelo J. Weinberger, Jacob Ziv: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm. IEEE Transactions on Information Theory 38(1): 66-72 (1992) | |
| 30 | Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel: On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. IEEE Transactions on Information Theory 38(2): 380-385 (1992) | |
| 29 | Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv: A sequential algorithm for the universal coding of finite memory sources. IEEE Transactions on Information Theory 38(3): 1002-1014 (1992) | |
| 28 | Ofer Zeitouni, Jacob Ziv, Neri Merhav: When is the generalized likelihood ratio test optimal? IEEE Transactions on Information Theory 38(5): 1597-1602 (1992) | |
| 1991 | ||
| 27 | Aaron D. Wyner, Jacob Ziv: Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm. Data Compression Conference 1991: 202-207 | |
| 26 | Dafna Sheinwald, Abraham Lempel, Jacob Ziv: On Compression with Two-Way Head Machines. Data Compression Conference 1991: 218-227 | |
| 25 | Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel: On the Optimal Asymptotic Performance of Universal Ordering and Discrimination of Individual Sequences. Data Compression Conference 1991: 239-246 | |
| 24 | Aaron D. Wyner, Jacob Ziv: Fixed data base version of the Lempel-Ziv data compression algorithm. IEEE Transactions on Information Theory 37(3): 878-880 (1991) | |
| 23 | Neri Merhav, Jacob Ziv: A Bayesian approach for classification of Markov sources. IEEE Transactions on Information Theory 37(4): 1067-1071 (1991) | |
| 1990 | ||
| 22 | Jacob Ziv: Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987). IEEE Transactions on Information Theory 36(3): 706- (1990) | |
| 21 | Jacob Ziv: Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources. IEEE Transactions on Information Theory 36(4): 861-863 (1990) | |
| 20 | Neri Merhav, Jacob Ziv: On universally efficient estimation of the first order autoregressive parameter and universal data compression. IEEE Transactions on Information Theory 36(6): 1245-1254 (1990) | |
| 1989 | ||
| 19 | Neri Merhav, Jacob Ziv: Estimating with partial statistics the parameters of ergodic finite Markov sources. IEEE Transactions on Information Theory 35(2): 326-333 (1989) | |
| 18 | Neri Merhav, Michael Gutman, Jacob Ziv: On the estimation of the order of a Markov chain and universal data compression. IEEE Transactions on Information Theory 35(5): 1014-1019 (1989) | |
| 17 | Aaron D. Wyner, Jacob Ziv: Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Transactions on Information Theory 35(6): 1250-1258 (1989) | |
| 1988 | ||
| 16 | Jacob Ziv: On classification with empirically observed statistics and universal data compression. IEEE Transactions on Information Theory 34(2): 278-286 (1988) | |
| 15 | Lawrence H. Ozarow, Aaron D. Wyner, Jacob Ziv: Achievable rates for a constrained Gaussian channel. IEEE Transactions on Information Theory 34(3): 365-370 (1988) | |
| 1986 | ||
| 14 | Abraham Lempel, Jacob Ziv: Compression of two-dimensional data. IEEE Transactions on Information Theory 32(1): 2-8 (1986) | |
| 1985 | ||
| 13 | Jacob Ziv: On universal quantization. IEEE Transactions on Information Theory 31(3): 344-347 (1985) | |
| 12 | Jacob Ziv: Universal decoding for finite-state channels. IEEE Transactions on Information Theory 31(4): 453-460 (1985) | |
| 1984 | ||
| 11 | Jacob Ziv: Fixed-rate encoding of individual sequences with side information. IEEE Transactions on Information Theory 30(2): 348-352 (1984) | |
| 1982 | ||
| 10 | Abraham Lempel, Gadiel Seroussi, Jacob Ziv: On the power of straight- line computations in finite fields. IEEE Transactions on Information Theory 28(6): 875-879 (1982) | |
| 1980 | ||
| 9 | Jacob Ziv: Distortion-rate theory for individual sequences. IEEE Transactions on Information Theory 26(2): 137-143 (1980) | |
| 1978 | ||
| 8 | Jacob Ziv: Coding Theorems for Individual Sequences. IEEE Transactions on Information Theory 24(4): 405-412 (1978) | |
| 7 | Jacob Ziv, Abraham Lempel: Compression of Individual Sequences via Variable-Rate Coding. IEEE Transactions on Information Theory 24(5): 530-536 (1978) | |
| 1977 | ||
| 6 | Jacob Ziv, Abraham Lempel: A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23(3): 337-343 (1977) | |
| 1976 | ||
| 5 | Aaron D. Wyner, Jacob Ziv: The rate-distortion function for source coding with side information at the decoder. IEEE Transactions on Information Theory 22(1): 1-10 (1976) | |
| 4 | Abraham Lempel, Jacob Ziv: On the Complexity of Finite Sequences. IEEE Transactions on Information Theory 22(1): 75-81 (1976) | |
| 1970 | ||
| 3 | Jack K. Wolf, Aaron D. Wyner, Jacob Ziv: The Channel Capacity of the Postal Channel Information and Control 16(2): 167-172 (1970) | |
| 1969 | ||
| 2 | Jacob Ziv: The Capacity of the General Time-Discrete Channel with Finite Alphabet Information and Control 14(3): 233-251 (1969) | |
| 1968 | ||
| 1 | Jacob Ziv: Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.) Information and Control 12(3): 173-192 (1968) | |
| 1 | Z. Cohen | [47] |
| 2 | Martin Farach-Colton (Martin Farach) | [37] |
| 3 | Michael Gutman | [18] |
| 4 | Yehuda Hershkovits | [40] [44] |
| 5 | Henry J. Landau | [50] |
| 6 | Amos Lapidoth | [43] [46] |
| 7 | Abraham Lempel | [4] [6] [7] [10] [14] [25] [26] [29] [30] [33] [36] |
| 8 | Yossi Matias | [45] [47] |
| 9 | James E. Mazo | [50] |
| 10 | Neri Merhav | [18] [19] [20] [23] [28] [32] [34] [38] [41] [53] [54] [55] [57] |
| 11 | S. Muthukrishnan (S. Muthu Muthukrishnan) | [45] [47] |
| 12 | Michiel O. Noordewier | [37] |
| 13 | Lawrence H. Ozarow | [15] |
| 14 | Eli Plotnik | [31] |
| 15 | Süleyman Cenk Sahinalp | [45] [47] |
| 16 | Serap A. Savari | [37] |
| 17 | Gadiel Seroussi | [10] |
| 18 | Shlomo Shamai (Shlomo Shamai (Shitz)) | [50] [52] [58] |
| 19 | Dafna Sheinwald | [26] [36] |
| 20 | Larry A. Shepp (Laurence A. Shepp) | [37] |
| 21 | J. Stein | [38] |
| 22 | Ilan Sutskover | [52] [58] |
| 23 | Marcelo J. Weinberger | [25] [29] [30] [31] [33] |
| 24 | Jack K. Wolf | [3] |
| 25 | A. J. Wyner | [42] |
| 26 | Aaron D. Wyner | [3] [5] [15] [17] [24] [27] [37] [39] [42] |
| 27 | Ofer Zeitouni | [28] |
Colors in the list of coauthors
Last update Sat May 26 02:31:23 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page