Noriyoshi Yoshida

According to our database1, Noriyoshi Yoshida authored at least 34 papers between 1973 and 2007.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
A Deterministic Algorithm for Finding All Minimum k-Way Cuts.
SIAM J. Comput., 2007

2006
Scheduling support hardware for multiprocessor system and its evaluations.
Syst. Comput. Jpn., 2006

A Decision Method of Attribute Importance for Classification by Outlier Detection.
Proceedings of the 22nd International Conference on Data Engineering Workshops, 2006

2005
A Clustering Method Using an Irregular Size Cell Graph.
Proceedings of the 15th International Workshop on Research Issues in Data Engineering (RIDE-SDMA 2005), 2005

Feature Extraction of Clusters Based on FlexDice.
Proceedings of the 21st International Conference on Data Engineering Workshops, 2005

2002
A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem.
Algorithmica, 2002

A Generalized Execution Model for Programming on Reconfigurable Architectures and an Architecture Supporting the Model.
Proceedings of the Field-Programmable Logic and Applications, 2002

1999
Diagonal Examples for Design Space Exploration in an Educational Environment CITY-1.
Proceedings of the IEEE International Conference on Microelectronic Systems Education, 1999

1997
A timing-driven placement algorithm with the Elmore delay model for row-based VLSIs.
Integr., 1997

1996
Pin assignment with global routing for VLSI building block layout.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

A three-layer over-the-cell multi-channel router for a new cell model.
Integr., 1996

1995
A Verification Algorithm for Logic Circuits with Internal Variables.
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

An MCM Routing Algorithm Considering Crosstalk.
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

A three-layer over-cell multi-channel routing method for a new cell model.
Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

A new system partitioning method under performance and physical constraints for multi-chip modules.
Proceedings of the 1995 Conference on Asia Pacific Design Automation, Makuhari, Massa, Chiba, Japan, August 29, 1995

1994
A Systolic Graph Partitioning Algorithm for VLSI Design.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

A Floorplanning Method with Topological Constraint Manipulation.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

On Three-Way Graph Partitioning.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

1993
Gate Array Placement Based on Mincut, Partitioning with Path Delay Constraints.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

A new global routing algorithm for over-the-cell routing in standard cell layouts.
Proceedings of the European Design Automation Conference 1993, 1993

1992
An optimal channel pin assignment with multiple intervals for building block layout.
Proceedings of the conference on European design automation, 1992

1989
A Meeting Scheduler for Office Automation.
IEEE Trans. Software Eng., 1989

Visualized and modeless programming environment for form manipulation language.
Proceedings of the IEEE Workshop on Visual Languages, 1989

1988
Optimization of Multiple Queries in Relational Database Systems.
Syst. Comput. Jpn., 1988

1987
A Heuristic Algorithm for Gate Assignment in One-Dimensional Array Approach.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

Response time minimization for processing simple queries in star networks.
Syst. Comput. Jpn., 1987

1985
Design of hardware algorithms by recurrence relations.
Syst. Comput. Jpn., 1985

Feasibility problem for meeting timetable rearrangement.
Syst. Comput. Jpn., 1985

1984
A Distributed Algorithm for Deadlock Detection and Resolution.
Proceedings of the Fourth Symposium on Reliability in Distributed Software and Database Systems, 1984

A Semantic Approach to Usability in Relational Database Systems.
Proceedings of the First International Conference on Data Engineering, 1984

1983
A linear algorithm for the domination number of a series-parallel graph.
Discret. Appl. Math., 1983

1980
NP-completeness of some type of p-center problem.
Discret. Appl. Math., 1980

1979
A fast selective traversal algorithm for binary search trees.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1973
A Method of Synthesis and Decomposition of Autonomous Linear Sequential Circuits
Inf. Control., November, 1973


  Loading...