#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2006

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shirou Maruyama, Yasuo Tabei, Hiroshi Sakamoto, Kunihiko Sadakane
- SPIRE
- 2013

- Shirou Maruyama, Masayuki Takeda, Masaya Nakahara, Hiroshi Sakamoto
- 2011 First International Conference on Data…
- 2011

Grammar-based compression is a well-studied technique for constructing a small context-free grammar (CFG) uniquely deriving a given text. In this paper, we present an online algorithm for lightweight grammar-based compression. Our algorithm is based on the LCA algorithm [Sakamoto et al. 2004]which guarantees nearly optimum compression ratio and space. LCA,… (More)

- Shirou Maruyama, Masaya Nakahara, Naoya Kishiue, Hiroshi Sakamoto
- SPIRE
- 2011

- Hiroshi Sakamoto, Shirou Maruyama, Takuya Kida, Shinichi Shimozono
- IEICE Transactions
- 2008

A space-efficient approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. For the input length n and an optimum CFG size g, the algorithm consumes only O(g log g) space and O(n log∗n) time to achieve O((log∗n) logn) approximation ratio to… (More)

- Shirou Maruyama, Yasuo Tabei
- 2014 Data Compression Conference
- 2014

We present novel variants of fully online LCA (FOLCA), a fully online grammar compression that builds a straight line program (SLP) and directly encodes it into a succinct representation in an online manner. FOLCA enables a direct encoding of an SLP into a succinct representation that is asymptotically equivalent to an information theoretic lower bound for… (More)

- Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda
- IEICE Transactions
- 2008

- Shirou Maruyama, Hiromitsu Miyagawa, Hiroshi Sakamoto
- ISAAC
- 2006

We consider the problem of restructuring compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string T produced by any grammar-based compression algorithm, to representations produced by several specific compression algorithms including LZ77, LZ78, run length encoding, and some… (More)

- Masaya Nakahara, Shirou Maruyama, Tetsuji Kuboyama, Hiroshi Sakamoto
- IEICE Transactions
- 2011

- Naoya Kishiue, Masaya Nakahara, Shirou Maruyama, Hiroshi Sakamoto
- ArXiv
- 2010

A searchable data structure for the edit-sensitive parsing (ESP) is proposed. Given a string S, its ESP tree is equivalent to a context-free grammar G generating just S, which is represented by a DAG. Using the succinct data structures for trees and permutations, G is decomposed to two LOUDS bit strings and single array in (1+ε)n log n+ 4n+o(n) bits for any… (More)

- ‹
- 1
- ›