A Method of Synthesis and Decomposition of Autonomous Linear Sequential Circuits - Tadashi Ae; Noriyoshi Yoshida (Inf. Control., 1973)

A fast selective traversal algorithm for binary search trees. - Tohru Kikuno; Noriyoshi Yoshida; Hiromi Kusumoto (COMPSAC, 1979)

NP-completeness of some type of p-center problem. - Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda (Discret. Appl. Math., 1980)

A linear algorithm for the domination number of a series-parallel graph. - Tohru Kikuno; Noriyoshi Yoshida; Yoshiaki Kakuda (Discret. Appl. Math., 1983)

A Semantic Approach to Usability in Relational Database Systems. - Kazuo Sugihara; Jun'ichi Miyao; Tohru Kikuno; Noriyoshi Yoshida (ICDE, 1984)

A Distributed Algorithm for Deadlock Detection and Resolution. - Kazuo Sugihara; Tohru Kikuno; Noriyoshi Yoshida; Masanobu Ogata (Symposium on Reliability in Distributed Software and Database Systems, 1984)

Feasibility problem for meeting timetable rearrangement. - Kazuo Sugihara; Tohru Kikuno; Noriyoshi Yoshida; Kazunori Arame (Syst. Comput. Jpn., 1985)

Design of hardware algorithms by recurrence relations. - Shin'ichi Wakabayashi; Tohru Kikuno; Noriyoshi Yoshida (Syst. Comput. Jpn., 1985)

Response time minimization for processing simple queries in star networks. - Jun'ichi Miyao; Tohru Kikuno; Noriyoshi Yoshida (Syst. Comput. Jpn., 1987)

A Heuristic Algorithm for Gate Assignment in One-Dimensional Array Approach. - Takashi Fujii; Hideya Horikawa; Tohru Kikuno; Noriyoshi Yoshida (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

Optimization of Multiple Queries in Relational Database Systems. - Jun'ichi Miyao; Kazuyuki Tominaga; Tohru Kikuno; Noriyoshi Yoshida (Syst. Comput. Jpn., 1988)

Visualized and modeless programming environment for form manipulation language. - Jun'ichi Miyao; Shin'ichi Wakabayashi; Noriyoshi Yoshida; Yasushi Ohtahara (VL, 1989)

A Meeting Scheduler for Office Automation. - Kazuo Sugihara; Tohru Kikuno; Noriyoshi Yoshida (IEEE Trans. Software Eng., 1989)

An optimal channel pin assignment with multiple intervals for building block layout. - Tetsushi Koide; Shin'ichi Wakabayashi; Noriyoshi Yoshida (EURO-DAC, 1992)

A new global routing algorithm for over-the-cell routing in standard cell layouts. - Tetsushi Koide; Shin'ichi Wakabayashi; Noriyoshi Yoshida (EURO-DAC, 1993)

Gate Array Placement Based on Mincut, Partitioning with Path Delay Constraints. - Shin'ichi Wakabayashi; Hiroshi Kusumoto; Hideki Mishima; Tetsushi Koide; Noriyoshi Yoshida (ISCAS, 1993)

On Three-Way Graph Partitioning. - Yoko Kamidoi; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ISCAS, 1994)

A Floorplanning Method with Topological Constraint Manipulation. - Tetsushi Koide; Yoshinori Katsura; Katsumi Yamatani; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ISCAS, 1994)

A Systolic Graph Partitioning Algorithm for VLSI Design. - Shin'ichi Wakabayashi; Kazunori Isomoto; Tetsushi Koide; Noriyoshi Yoshida (ISCAS, 1994)

A new system partitioning method under performance and physical constraints for multi-chip modules. - Yoshinori Katsura; Tetsushi Koide; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ASP-DAC, 1995)

A three-layer over-cell multi-channel routing method for a new cell model. - Masahiro Tsuchiya; Tetsushi Koide; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ASP-DAC, 1995)

An MCM Routing Algorithm Considering Crosstalk. - Tetsuya Miyoshi; Shin'ichi Wakabayashi; Tetsushi Koide; Noriyoshi Yoshida (ISCAS, 1995)

A Verification Algorithm for Logic Circuits with Internal Variables. - Toshihiro Nakaoa; Shin'ichi Wakabayashi; Tetsushi Koide; Noriyoshi Yoshida (ISCAS, 1995)

A three-layer over-the-cell multi-channel router for a new cell model. - Tetsushi Koide; Masahiro Tsuchiya; Shin'ichi Wakabayashi; Noriyoshi Yoshida (Integr., 1996)

Pin assignment with global routing for VLSI building block layout. - Tetsushi Koide; Shin'ichi Wakabayashi; Noriyoshi Yoshida (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

A timing-driven placement algorithm with the Elmore delay model for row-based VLSIs. - Tetsushi Koide; Shin'ichi Wakabayashi; Mitsuhiro Ono; Yutaka Nishimaru; Noriyoshi Yoshida (Integr., 1997)

Diagonal Examples for Design Space Exploration in an Educational Environment CITY-1. - Ryuichi Takahashi; Noriyoshi Yoshida (MSE, 1999)

A Generalized Execution Model for Programming on Reconfigurable Architectures and an Architecture Supporting the Model. - Kazuya Tanigawa; Tetsuo Hironaka; Akira Kojima; Noriyoshi Yoshida (FPL, 2002)

A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. - Yoko Kamidoi; Shin'ichi Wakabayashi; Noriyoshi Yoshida (Algorithmica, 2002)

Feature Extraction of Clusters Based on FlexDice. - Tomotake Nakamura; Yoko Kamidoi; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ICDE Workshops, 2005)

A Clustering Method Using an Irregular Size Cell Graph. - Tomotake Nakamura; Yoko Kamidoi; Shin'ichi Wakabayashi; Noriyoshi Yoshida (RIDE, 2005)

A Decision Method of Attribute Importance for Classification by Outlier Detection. - Tomotake Nakamura; Yoko Kamidoi; Shin'ichi Wakabayashi; Noriyoshi Yoshida (ICDE Workshops, 2006)

Scheduling support hardware for multiprocessor system and its evaluations. - Takahiro Sasaki; Tetsuo Hironaka; Naoki Nishimura; Noriyoshi Yoshida (Syst. Comput. Jpn., 2006)

A Deterministic Algorithm for Finding All Minimum k-Way Cuts. - Yoko Kamidoi; Noriyoshi Yoshida; Hiroshi Nagamochi (SIAM J. Comput., 2007)