default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuzo Yajima
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j39]Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima:
Tree-shellability of Boolean functions. Theor. Comput. Sci. 262(1): 633-647 (2001)- 2000
- [j38]Yasuhiko Takenaga, Shuzo Yajima:
Hardness of identifying the minimum ordered binary decision diagram. Discret. Appl. Math. 107(1-3): 191-201 (2000)
1990 – 1999
- 1998
- [c38]Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima:
Optimizing OBDDs Is Still Intractable for Monotone Functions. MFCS 1998: 625-635 - 1997
- [j37]Masayuki Ito, Naofumi Takagi
, Shuzo Yajima:
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification. IEEE Trans. Computers 46(4): 495-498 (1997) - [j36]Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata:
O(n)-Depth Modular Exponentiation Circuit Algorithm. IEEE Trans. Computers 46(6): 701-704 (1997) - [j35]Kazuhisa Hosaka, Yasuhiko Takenaga, T. Kaneda, Shuzo Yajima:
Size of Ordered Binary Decision Diagrams Representing Threshold Functions. Theor. Comput. Sci. 180(1-2): 47-60 (1997) - [c37]Yasuhiko Takenaga, Mitsushi Nouzoe, Shuzo Yajima:
Size and Variable Ordering of OBDDs Representing Treshold Functions. COCOON 1997: 91-100 - [c36]Takashi Horiyama, Shuzo Yajima:
Exponential Lower Bounds on the Size of OBDDs Representing Integer Divistion. ISAAC 1997: 163-172 - 1996
- [j34]Masayuki Ito, Naofumi Takagi, Shuzo Yajima:
Square Rooting by Iterative Multiply-Additions. Inf. Process. Lett. 60(5): 267-269 (1996) - 1995
- [c35]Masayuki Ito, Naofumi Takagi, Shuzo Yajima:
Efficient Initial Approximation and Fast Converging Methods for Division and Square Root. IEEE Symposium on Computer Arithmetic 1995: 2-8 - [c34]Takafumi Hamano, Naofumi Takagi, Shuzo Yajima, Franco P. Preparata:
O(n)-depth circuit algorithm for modular exponentiation. IEEE Symposium on Computer Arithmetic 1995: 188-192 - [c33]Kiyoharu Hamaguchi, Akihito Morita, Shuzo Yajima:
Efficient construction of binary moment diagrams for verifying arithmetic circuits. ICCAD 1995: 78-82 - 1994
- [j33]Shoichi Hirose, Shuzo Yajima:
Circuit complexity of slice functions and homogeneous functions. Syst. Comput. Jpn. 25(6): 23-31 (1994) - [j32]Noriyuki Takahashi, Nagisa Ishiura, Shuzo Yajima:
Fault simulation for multiple faults by Boolean function manipulation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(4): 531-535 (1994) - [c32]Kazuhisa Hosaka, Yasuhiko Takenaga, Shuzo Yajima:
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions. ISAAC 1994: 584-592 - 1993
- [c31]Hiroyuki Ochi, Koichi Yasuoka, Shuzo Yajima:
Breadth-first manipulation of very large binary-decision diagrams. ICCAD 1993: 48-55 - [c30]Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima:
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. ISAAC 1993: 389-398 - 1992
- [j31]Naofumi Takagi, Shuzo Yajima:
Modular Multiplication Hardware Algorithms with a Redundant Representation and Their Application to RSA Cryptosystem. IEEE Trans. Computers 41(7): 887-891 (1992) - [j30]Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Infinity-Regular Temporal Logic and its Model Checking Problem. Theor. Comput. Sci. 103(2): 191-204 (1992) - [c29]Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Design Verification of a Microprocessor Using Branching Time Regular Temporal Logic. CAV 1992: 206-219 - [c28]Nagisa Ishiura, Shuzo Yajima:
Linear time fault simulation algorithm using a content addressable memory. EURO-DAC 1992: 442-445 - 1991
- [j29]Naofumi Takagi, Shuzo Yajima:
An on-line error-detectable high-speed array divider. Syst. Comput. Jpn. 22(1): 21-27 (1991) - [j28]Naofumi Takagi, Tohru Asada, Shuzo Yajima:
Redundant CORDIC Methods with a Constant Scale Factor for Sine and Cosine Computation. IEEE Trans. Computers 40(9): 989-995 (1991) - [c27]Hiromi Hiraishi, Kiyoharu Hamaguchi, Hiroyuki Ochi, Shuzo Yajima:
Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification. CAV 1991: 214-224 - [c26]Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Formal Verification of Speed-Dependent Asynchronous Cicuits Using Symbolic Model Checking of branching Time Regular Temporal Logic. CAV 1991: 410-420 - [c25]Hiroyuki Ochi, Nagisa Ishiura, Shuzo Yajima:
Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing. DAC 1991: 413-416 - [c24]Yutaka Deguchi, Nagisa Ishiura, Shuzo Yajima:
Probabilistic CTSS: Analysis of Timing Error Probability in Asynchronous Logic Circuits. DAC 1991: 650-655 - [c23]Nagisa Ishiura, Hiroshi Sawada, Shuzo Yajima:
Minimazation of Binary Decision Diagrams Based on Exchanges of Variables. ICCAD 1991: 472-475 - [c22]Noriyuki Takahashi, Nagisa Ishiura, Shuzo Yajima:
Fault Simulation for Multiple Faults Using Shared BDD Representation of Fault Sets. ICCAD 1991: 550-553 - 1990
- [j27]Nagisa Ishiura, Masayuki Ito, Shuzo Yajima:
Dynamic two-dimensional parallel simulation technique for high-speed fault simulation on a vector processor. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(8): 868-875 (1990) - [c21]Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity. CAV 1990: 253-262 - [c20]Nagisa Ishiura, Hiroto Yasuura, Shuzo Yajima:
NES: The Behavioral Model for the Formal Semantics of a Hardware Design Language UDL/I. DAC 1990: 8-13 - [c19]Shin-ichi Minato, Nagisa Ishiura, Shuzo Yajima:
Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation. DAC 1990: 52-57 - [c18]Nagisa Ishiura, Yutaka Deguchi, Shuzo Yajima:
Coded Time-Symbolic Simulation Using Shared Binary Decision Diagram. DAC 1990: 130-135 - [c17]Kiyoharu Hamaguchi, Hiromi Hiraishi, Shuzo Yajima:
Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity. CAV (DIMACS/AMS volume) 1990: 551-564
1980 – 1989
- 1989
- [c16]Nagisa Ishiura, Mizuki Takahashi, Shuzo Yajima:
Time-Symbolic Simulation for Accurate Timing Verification of Asynchronous Behavior of Logic Circuits. DAC 1989: 497-502 - 1988
- [j26]Shigeharu Teshima, Hiromi Hiraishi, Shuzo Yajima:
Algebraic Specification of Parallel Systems Based on Binary Relations between Events. Syst. Comput. Jpn. 19(10): 8-21 (1988) - [c15]Yasuo Okabe, Shuzo Yajima:
Parallel Computational Complexity of Logic Programs and Alternating Turing Machines. FGCS 1988: 356-363 - [c14]Naofumi Takagi, Shuzo Yajima:
An on-line error-detectable array divider with a redundant binary representation and a residue code. FTCS 1988: 174-179 - 1987
- [j25]Shinji Kimura, Shuzo Yajima:
Description and verification of input constraints and input-output specifications of logic circuits. Syst. Comput. Jpn. 18(2): 29-42 (1987) - [j24]Naofumi Takagi, Tohru Asada, Shuzo Yajima:
A hardware algorithm for computing sine and cosine using redundant binary representation. Syst. Comput. Jpn. 18(8): 1-9 (1987) - [j23]Hiroto Yasuura, Naofumi Takagi, Shuzo Yajima:
On high-speed parallel algorithms using redundant coding. Syst. Comput. Jpn. 18(12): 72-80 (1987) - [j22]Naofumi Takagi, Shuzo Yajima:
On-Line Error-Detectable High-Speed Multiplier Using Redundant Binary Representation and Three-Rail Logic. IEEE Trans. Computers 36(11): 1310-1317 (1987) - [j21]Nagisa Ishiura, Hiroto Yasuura, Shuzo Yajima:
High-Speed Logic Simulation on Vector Processors. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(3): 305-321 (1987) - 1986
- [j20]Naofumi Takagi, Shuzo Yajima:
A square root hardware algorithm using redundant binary representation. Syst. Comput. Jpn. 17(11): 30-41 (1986) - [j19]Naofumi Takagi, Shuzo Yajima:
Hardware algorithms for computing exponentials and logarithms using redundant binary representation. Syst. Comput. Jpn. 17(12): 11-22 (1986) - 1985
- [j18]Naofumi Takagi, Hiroto Yasuura, Shuzo Yajima:
High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree. IEEE Trans. Computers 34(9): 789-796 (1985) - 1984
- [c13]Hiroto Yasuura, Shuzo Yajima:
Hardware Algorithms for VLSI Systems. VLSI Engineering 1984: 105-129 - 1982
- [j17]Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima:
A Longest Common Subsequence Algorithm Suitable for Similar Text Strings. Acta Informatica 18: 171-179 (1982) - [j16]Hiroto Yasuura, Naofumi Takagi, Shuzo Yajima:
The Parallel Enumeration Sorting Scheme for VLSI. IEEE Trans. Computers 31(12): 1192-1201 (1982) - [c12]Takeshi Sakai, Yoshiyuki Tsuchida, Hiroto Yasuura, Yasushi Ooi, Yoshitsugu Ono, Hiroshi Kano, Shinji Kimura, Shuzo Yajima:
An Interactive Simulation System for structured logic design - ISS. DAC 1982: 747-754 - [c11]Shuzo Yajima, Hiroto Yasuura:
Hardware Algorithms and Logic Design Automation. An Overview and Progress Report. RIMS Symposium on Software Science and Engineering 1982: 147-164 - [c10]Yahiko Kambayashi, Masatoshi Yoshikawa, Shuzo Yajima:
Query Processing for Distributed Databases Using Generalized Semi-Joins. SIGMOD Conference 1982: 151-160 - 1981
- [j15]Shuzo Yajima, Jan L. Goodsell, Takao Ichida, Hiromi Hiraishi:
Data Compression of the Kanji Character Patterns Digitized on the Hexagonal Mesh. IEEE Trans. Pattern Anal. Mach. Intell. 3(2): 221-230 (1981) - [c9]Yahiko Kambayashi, Narao Nakatsu, Shuzo Yajima:
Data compression procedures utilizing the similarity of data. AFIPS National Computer Conference 1981: 555-562 - [c8]Yahiko Kambayashi, Takaki Hayashi, Shuzo Yajima:
Dynamic Clustering Procedures for Bibliographic Data. SIGIR 1981: 90-99
1970 – 1979
- 1979
- [j14]Katsumi Tanaka, Yahiko Kambayashi, Shuzo Yajima:
Organization of quasi-consecutive retrieval files. Inf. Syst. 4(3): 23-33 (1979) - [c7]Yahiko Kambayashi, Katsumi Tanaka, Shuzo Yajima:
Semantic aspects of data dependencies and their application to relational database design. COMPSAC 1979: 398-403 - [c6]Chung Le Viet, Yahiko Kambayashi, Katsumi Tanaka, Shuzo Yajima:
Use of abstracted characteristics of data in relational databases. COMPSAC 1979: 409-414 - [c5]Yahiko Kambayashi, Narao Nakatsu, Shuzo Yajima:
Hierarchical string pattern matching using dynamic pattern matching machines. COMPSAC 1979: 813-818 - [c4]Yahiko Kambayashi, Shuzo Yajima, Osamu Konishi, Takaki Hayashi:
New indices for bibliographic data and their applications. MARK 1979: 217-226 - 1978
- [j13]Yahiko Kambayashi, Takaki Hayashi, Y. Tanaka, Shuzo Yajima:
A Linear Storage Space Algorithm for a Reference Structure Index. Inf. Process. Lett. 7(2): 66-71 (1978) - [c3]Yahiko Kambayashi, Katsumi Tanaka, Shuzo Yajima:
Problems of Relational Database Design. Data Base Design Techniques I 1978: 172-218 - [c2]Katsumi Tanaka, Chung Le Viet, Yahiko Kambayashi, Shuzo Yajima:
A file organization suitable for relational database operations. Mathematical Studies of Information Processing 1978: 193-227 - 1977
- [j12]Shuzo Yajima, Yahiko Kambayashi, Susumu Yoshida, Kazuo Iwama:
Labolink: An Optically Linked Laboratory Computer Network. Computer 10(11): 52-59 (1977) - [c1]Yahiko Kambayashi, Katsumi Tanaka, Shuzo Yajima:
A Relational Data Language with Simplified Binary Relation Handling Capability. VLDB 1977: 338-350 - 1974
- [j11]Shuzo Yajima, Kosaku Inagaki:
Power Minimization Problems of Logic Networks. IEEE Trans. Computers 23(2): 153-165 (1974) - 1972
- [j10]Yahiko Kambayashi, Shuzo Yajima:
Finite Memory Machines Satisfying the Lower Bound of Memory. Inf. Control. 20(2): 150-157 (1972) - [j9]Yahiko Kambayashi, Shuzo Yajima:
Controllability of Seqential Machines. Inf. Control. 21(4): 306-328 (1972) - 1971
- [j8]Yahiko Kambayashi, Shuzo Yajima:
The Upper Bound of K in K-Lossless Sequential Machines. Inf. Control. 19(5): 432-438 (1971) - 1970
- [j7]Toshio Yasui, Shuzo Yajima:
Two-State Two-Symbol Probabilistic Automata. Inf. Control. 16(3): 203-224 (1970) - [j6]Yahiko Kambayashi, Shuzo Yajima, Isao Ohbayashi:
On Finite-Memory Sequential Machines. IEEE Trans. Computers 19(3): 254-258 (1970)
1960 – 1969
- 1969
- [j5]Toshio Yasui, Shuzo Yajima:
Some Algebraic Properties of Sets of Stochastic Matrices. Inf. Control. 14(4): 319-357 (1969) - 1968
- [j4]Shuzo Yajima, Toshihide Ibaraki:
A Theory of Completely Monotonic Functions and its Applications to Threshold Logic. IEEE Trans. Computers 17(3): 214-229 (1968) - [j3]Shuzo Yajima, Toshihide Ibaraki:
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic. IEEE Trans. Computers 17(4): 338-351 (1968) - [j2]Shuzo Yajima, Toshihide Ibaraki, I. Kawano:
On Autonomous Logic Nets of Threshold Elements. IEEE Trans. Computers 17(4): 385-391 (1968) - 1965
- [j1]Shuzo Yajima, Toshihide Ibaraki:
A Lower Bound of the Number of Threshold Functions. IEEE Trans. Electron. Comput. 14(6): 926-929 (1965)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
