Yasuaki Nishitani

According to our database1, Yasuaki Nishitani authored at least 19 papers between 1981 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
Proceedings of the 53rd IEEE International Symposium on Multiple-Valued Logic, 2023

2018
Function Design for Minimum Multiple-Control Toffoli Circuits of Reversible Adder/Subtractor Blocks and Arithmetic Logic Units.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2016
New Two-Qubit Gate Library with Entanglement.
Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

2014
The firing squad synchronization problem with sub-generals.
Inf. Process. Lett., 2014

A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits.
IEICE Trans. Inf. Syst., 2014

2011
A Testable Realization for Decimal Multipliers.
Proceedings of the 41st IEEE International Symposium on Multiple-Valued Logic, 2011

2010
The Firing Squad Synchronization Problems for Number Patterns on a Seven-Segment Display and Segment Arrays.
IEICE Trans. Inf. Syst., 2010

2009
Exact Minimization of and-EXOR Expressions of Practical Benchmark Functions.
J. Circuits Syst. Comput., 2009

2006
Efficient Search Methods for Obtaining Exact Minimum AND-EXOR Expressions.
Proceedings of the Third IEEE International Workshop on Electronic Design, 2006

Simplification of Exclusive-or Sum-of-Products Expressions Through Function Transformation.
Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems 2006, 2006

2002
A Faster Algorithm of Minimizing AND-EXOR Expressions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

1999
Speedup of the n-Process Mutual Exclusion Algorithm.
Parallel Process. Lett., 1999

Speedup of Lockout-Free Mutual Exclusion Algorithms.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1996
A simplification algorithm of and-exor expressions guaranteeing minimality for some class of logic functions.
Syst. Comput. Jpn., 1996

A Probably Optimal Embedding of Hyper-Rings in Hypercubes.
Inf. Process. Lett., 1996

1995
Embeddings of Hyper-Rings in Hypercubes.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1992
Graph representation of logic functions to design two-level MOS networks.
Syst. Comput. Jpn., 1992

1982
On Universality of Concurrent Expressions with Synchronization Primitives.
Theor. Comput. Sci., 1982

1981
The Firing Squad Synchronization Problem for Graphs.
Theor. Comput. Sci., 1981


  Loading...