Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KASAMI T")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 74

  • Page / 3
Export

Selection :

  • and

SOME UNDECIDABLE PROBLEMS FOR PETRI NETS.ARAKI T; KASAMI T.1976; SYST. COMPUTER CONTROLS; U.S.A.; DA. 1976 PARU 1977; VOL. 7; NO 1; PP. 20-28; BIBL. 14 REF.Article

SOME PROGRAM SCHEMAS OPERATING ON TREE DATA STRUCTURES.TOKURA N; KASAMI T.1974; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1974; PP. 81-89; BIBL. 11 REF.Article

DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMSSUGIYAMA Y; KASAMI T.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 1; PP. 18-26; BIBL. 3 REF.Article

SOME DECISION PROBLEMS RELATED TO THE REACHABILITY PROBLEM FOR PETRI NETS.ARAKI T; KASAMI T.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 85-104; BIBL. 14 REF.Article

SOME RESULTS ON THE MINIMUM WEIGHT OF PRIMITIVE BCH CODESKASAMI T; LIN S.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 6; PP. 824-825; BIBL. 6 REF.Serial Issue

AN 0(N) ALGORITHM FOR COMPUTING THE SET OF AVAILABLE EXPRESSIONS OF D-CHARTS.TANIGUCHI K; KASAMI T.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 361-364; BIBL. 10 REF.Article

DECIDABLE PROBLEMS ON THE STRONG CONNECTIVITY OF PETRI NET REACHABILITY SETS.ARAKI T; KASAMI T.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 1; PP. 99-119; BIBL. 19 REF.Article

A RESULT ON THE EQUIVALENCE PROBLEM FOR DETERMINISTIC PUSHDOWN AUTOMATA.TANIGUCHI K; KASAMI T.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 13; NO 1; PP. 38-50; BIBL. 5 REF.Article

BOUNDS ON THE ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORY LESS MULTIPLE-ACCESS CHANNELKASAMI T; LIN S.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 2; PP. 187-197; BIBL. 14 REF.Article

LINEAR BLOCK CODES FOR ERROR DETECTIONKASAMI T; KLOEVE T; SHULIN et al.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 131-136; BIBL. 10 REF.Article

MEMBERSHIP PROBLEM FOR EMBEDDED MULTIVALUED DEPENDENCIES UNDER SOME RESTRICTED CONDITIONSITO M; TANIGUCHI K; KASAMI T et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 175-193; BIBL. 16 REF.Article

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.TANIGUCHI K; KASAMI T; SUGIYAMA Y et al.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975; VOL. 6; NO 1; PP. 36-44; BIBL. 10 REF.Article

EXISTENCE OF GOOD DELTA -DECODABLE CODES FOR THE TWO-USER MULTIPLE-ACCESS ADDER CHANNELSHU LIN; KASAMI T; YAMAMURA S et al.1980; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1980; VOL. 24; NO 4; PP. 486-495; BIBL. 12 REF.Article

PUISSANCE DES CODES ADDITIFS CONCORDANTS CORRECTEURS D'ERREURS ET DE DEFAUTSKASAMI T; YAMAMURA S; KUZNETSOV AV et al.1978; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1978; VOL. 14; NO 2; PP. 3-10; BIBL. 8 REF.Article

AN ERROR CORRECTING SCHEME FOR DEFECTIVE MEMORYKUZNETSOV AV; KASAMI T; YAMAMURA S et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 6; PP. 712-718; BIBL. 12 REF.Article

ON THE WEIGHT ENUMERATION OF WEIGHTS LESS THAN 2.5 D OF REED-MULLER CODES.KASAMI T; TOKURA N; AZUMI S et al.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 30; NO 4; PP. 380-395; BIBL. 18 REF.Article

DESCRIPTION OF A FILE MANAGEMENT SYSTEM IN A HIGHER-LEVEL LANGUAGE.OKUI J; TOKURA N; KASAMI T et al.1976; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1976 PARU 1977; VOL. 7; NO 1; PP. 36-43; BIBL. 4 REF.Article

INFERENCE OF EMBEDDED MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESITO M; TANIGUCHI K; KASAMI T et al.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980 PUBL. 1982; VOL. 11; NO 5; PP. 1-8; BIBL. 10 REF.Article

FORMAL VERIFICATION OF A CLASS OF CONCURRENT PROGRAMSMORI M; TANIGUCHI K; KASAMI T et al.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 11-20; BIBL. 11 REF.Article

DECISION PROBLEMS FOR MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESHAGIHARA K; ITO M; TANIGUCHI K et al.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 247-264; BIBL. 10 REF.Article

ANALGEBRAIC SPECIFICATION OF HDLC PROCEDURESMORI M; HIGASHIMO T; SUGIYAMA Y et al.1981; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1981 PUBL. 1982; VOL. 12; NO 1; PP. 64-74; BIBL. 8 REF.Article

MEMBERSHIP PROBLEM FOR MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESHAGIHARA K; ITO M; TANIGUCHI K et al.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 6; PP. 62-70; BIBL. 10 REF.Article

Optimizing universal queries in relational databasesITO, M; KASAMI, T.Systems and computers in Japan. 1991, Vol 22, Num 3, pp 19-30, issn 0882-1666, 12 p.Article

GRATH THEORETIC APPROACHES TO THE CODE CONSTRUCTION FOR THE TWO-USER MULTIPLE-ACCESS BINARY ADDER CHANNELKASAMI T; SHU LIN; WEI VK et al.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 114-130; BIBL. 30 REF.Article

COMPLEXITIES OF DECISION PROBLEMS FOR EQUIVALENCE AND SIMPLIFICATION OF SAFE PETRI NETSMATSUURA T; SUGIYAMA Y; TANIGUCHI K et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 3; PP. 75-82; BIBL. 10 REF.Article

  • Page / 3