and Martin Cohn Computer Science Department, Brandeis U.  Home/Search
Context
Related
| brandeis.edu/~marty/dcc97.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brandeis.edu/~marty/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a sequence, we consider the maximum number of distinct phrases in any parsing; this definition of complexity is invariant under string reversal. We show that Lempel-Ziv parsings can vary under reversal by a factor on the order of log of sequence length. We give two interpretations of maximal parsing, show that they are not equivalent and that one lacks a plausible monotonicity property. 1 Introduction In this paper we consider two measures of complexity defined on finite sequences over... (Update)
Active bibliography (related documents): More All
0.1: On Maximal Parsings of Strings - Harald Helfgott And (Correct)
0.1: Asymmetry in Ziv/Lempel '78 Parsing - Martin Cohn And (Correct)
0.1: Asymptotic Behavior Of The Lempel-Ziv Parsing Scheme And.. - Jacquet, Szpankowski (1995) (Correct)
Similar documents based on text: More All
0.2: A Functional Equation Arising in the Analysis of Algorithms.. - Jacquet, al. (1994) (Correct)
0.2: Parsing with Suffix and Prefix Dictionaries - Cohn (1996) (Correct)
0.1: On Generalized Digital Search Trees With Applications To A.. - Szpankowski, Tang (1995) (Correct)
BibTeX entry: (Update)
@misc{ martin-maximal,
author = "And Martin",
title = "On Maximal Parsings of Strings Harald Helfgott",
url = "citeseer.ist.psu.edu/64498.html" }
Citations (may not include all citations):293 Compression of Individual Sequences Via Variable-Rate Coding - Ziv, Lempel - 1978
167 Error-Correcting Codes (context) - Peterson, Weldon - 1972
49 the Complexity of Finite Sequences (context) - Lempel, Ziv - 1976
41 The Art of Computer Programming Volume (context) - Knuth
11 The Lempel-Ziv Algorithm and Message Complexity (context) - Gilbert, Kadota - 1992
Documents on the same site (http://www.cs.brandeis.edu/~marty/): More
Parsing with Suffix and Prefix Dictionaries - Cohn (1996) (Correct)
On the Channel Capacity of Read/Write Isolated Memory - Cohn (1994) (Correct)
Ziv-Lempel Compressors with Deferred-Innovation - Martin Cohn (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC