#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1965

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Data Set Used

#### Key Phrases

#### Organism

Learn More

- Shin-ichi Minato, Nagisa Ishiura, Shuzo Yajima
- DAC
- 1990

The efficiency of Boolean function manipulation depends on the form of representation of Boolean functions. <italic>Binary Decision Diagrams (BDD's)</italic> are graph representations proposed by Akers and Bryant. BDD's have some properties which can be used to enable efficient Boolean function manipulation.
In this paper, we describe a technique of more… (More)

- Naofumi Takagi, Tohru Asada, Shuzo Yajima
- IEEE Trans. Computers
- 1991

- Naofumi Takagi, Hiroto Yasuura, Shuzo Yajima
- IEEE Trans. Computers
- 1985

- Nagisa Ishiura, Hiroshi Sawada, Shuzo Yajima
- ICCAD
- 1991

We ropose in this paper a new exact algorithm and gr aduay improvement methods of minimizing binary decision diagrams (BDD’s). In the exact minimization algorithm the o timum order is searched by the exchanges o! variabyes of BDD’s based on the framework of Friedman’s algorithm. The use of BDD representation of a given function and intermediate functions… (More)

- Hiroyuki Ochi, Koichi Yasuoka, Shuzo Yajima
- ICCAD
- 1993

P This paper presents an e cient method for manipulating very large Shared inary-Deciston Diagrams (SBDD’S) which am too large to be stored within main memory. In contrast that the conventional depth-first aigorithm causes random access of memory,, the proposed method is intended to cause sequential access of memory. The main idea o our method is leveli… (More)

- Kiyoharu Hamaguchi, Akihito Morita, Shuzo Yajima
- ICCAD
- 1995

BDD-based approaches cannot handle some arithmetic functions such as multiplication efficiently, while Binary Moment Diagrams proposed by Bryant and Chen provide compact representations for those functions. They reported a BMD-based polynomial-time algorithm for verifying multipliers. This approach requires high-level information such as specifications to… (More)

- Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
- ISAAC
- 1993

- Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima
- Acta Informatica
- 1982

Efficient algorithms for computing the longest common subsequence (LCS for short) are discussed. O(pn) algorithm and O(p(m-p) log n) algorithm [Hirschberg 1977] seem to be best among previously known algorithms, where p is the length of an LCS and m and n are the lengths of given two strings (m≦n). There are many applications where the expected length of an… (More)

- Naofumi Takagi, Shuzo Yajima
- IEEE Trans. Computers
- 1992

- Hiroyuki Ochi, Nagisa Ishiura, Shuzo Yajima
- DAC
- 1991

Boolean function manipulators based on Shared Binary Decision Diagrams (SBDD’S) =e utilized efficiently in various applications such as design verification. We propose a high-speed algorithm of manipulating SBDD’S, which can be used with a vector supercomputer effectively. This proposed algorithm is implement ed and evaluated on the vector supercomput er… (More)