FINITE AUTOMATA HAVING COST FUNCTIONS: NONDETERMINISTIC MODELS.IBARAKI T.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 1; PP. 40-69; BIBL. 12 REF.Article

MINIMAL REPRESENTATIONS OF SOME CLASSES OF DYNAMIC PROGRAMMING.IBARAKI T.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 4; PP. 289-328; BIBL. 16 REF.Article

RECOGNITION CAPACITY OF FINITE AUTOMATA HAVING COST FUNCTIONS (SEQUENTIAL DECISION PROCESSES).IBARAKI T.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975 PARU 1976; VOL. 6; NO 5; PP. 32-40; BIBL. 13 REF.Article

ALGORITHMS FOR OBTAINING SHORTEST PATHS VISITING SPECIFIED NODES.IBARAKI T.1973; S.I.A.M. REV.; U.S.A.; DA. 1973; VOL. 15; NO 2; PP. 309-317; BIBL. 13 REF.Article

BRANCH-AND-BOUND PROCEDURE AND STATE-SPACE REPRESENTATION OF COMBINATORIAL OPTIMIZATION PROBLEMS.IBARAKI T.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 1; PP. 1-27; BIBL. 1 P.Article

INTEGER PROGRAMMING FORMULATION OF COMBINATORIAL OPTIMIZATION PROBLEMS.IBARAKI T.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 1; PP. 39-52; BIBL. 25 REF.Article

THEORETICAL COMPARISONS OF SEARCH STRATEGIES IN BRANCH-AND-BOUND ALGORITHMS.IBARAKI T.1976; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 315-344; BIBL. 19 REF.Article

COMMENTS ON "MONOTONE FUNCTIONS IN SEQUENTIAL CIRCUITS".IBARAKI T.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 9; PP. 989-990; BIBL. 3 REF.Article

REPRESENTATION THEOREMS FOR EQUIVALENT OPTIMIZATION PROBLEMSIBARAKI T.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 5; PP. 397-435; BIBL. 1 P.Serial Issue

ON BALUT'S ALGORITHM AND NP-DOMPLETENESS FOR A CHANCE-CONSTRAINED SCHEDULING PROBLEMKISE H; IBARAKI T.1983; MANAGEMENT SCIENCE; ISSN 0025-1909; FRA; DA. 1983; VOL. 29; NO 3; PP. 384-388; BIBL. 3 REF.Article

ON-LINE COMPUTATION OF TRANSITIVE CLOSURES OF GRAPHSIBARAKI T; KATOH N.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 95-97; BIBL. 9 REF.Article

ALCOHOLYSIS EQUILIBRIA OF TRIETHYLALKOXYSILANES CATALYZED BY IODINE OR IODINE MONOBROMIDEITO K; IBARAKI T.1982; BULL. CHEM. SOC. JPN.; ISSN 0009-2673; JPN; DA. 1982; VOL. 55; NO 9; PP. 2973-2975; BIBL. 15 REF.Article

THE DISPROPORTIONATION OF DIMETHYLDIALKOXYSILANES CATALYZED BY IODINE MONOBROMIDEIBARAKI T; ITO K.1981; BULL. CHEM. SOC. JPN.; ISSN 0009-2673; JPN; DA. 1981; VOL. 54; NO 10; PP. 3235-3236; BIBL. 14 REF.Article

SUFFICIENT CONDITIONS FOR GRAPHS TO HAVE THRESHOLD NUMBER 2IBARAKI T; PELED UN.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 241-268; BIBL. 6 REF.Conference Paper

A POLYNOMIAL TIME ALGORITHM FOR A CHANCE-CONSTRAINED SINGLE MACHINE SCHEDULING PROBLEMKATOH N; IBARAKI T.1983; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1983; VOL. 2; NO 2; PP. 62-65; BIBL. 7 REF.Article

FAIL-SAFE REALIZATION OF SEQUENTIAL MACHINESTAKAOKA T; IBARAKI T.1973; INFORM. AND CONTROL; U.S.A.; DA. 1973; VOL. 22; NO 1; PP. 31-55; BIBL. 11 REF.Serial Issue

N-FAIL-SAFE SEQUENTIAL MACHINESTAKAOKA T; IBARAKI T.1972; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1972; VOL. 21; NO 11; PP. 1189-1196; BIBL. 12 REF.Serial Issue

THRESHOLD NUMBERS AND THRESHOLD COMPLETIONSHAMMER PL; IBARAKI T; PELED U et al.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 103-106; BIBL. 5 REF.Article

A POLYNOMIAL TIME ALGORITHM FOR THE RESOURCE ALLOCATION PROBLEM WITH A CONVEX OBJECTIVE FUNCTIONKATOH N; IBARAKI T; MINE H et al.1979; J. OPERAT. RES. SOC.; GBR; DA. 1979; VOL. 30; NO 5; PP. 449-455; BIBL. 27 REF.Article

RECOGNITION CAPACITY OF FINITE AUTOMATA HAVING ADDITIVE COST FUNCTIONSMURO S; IBARAKI T; HASEGAWA T et al.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 4; PP. 73-81; BIBL. 19 REF.Article

CROSSED-BEAM CHEMILUMINESCENCE STUDIES FOR O AND H+NO SYSTEMSIBARAKI T; KODERA K; KUSUNOKI I et al.1975; J. PHYS. CHEM.; U.S.A.; DA. 1975; VOL. 79; NO 2; PP. 95-101; BIBL. 23 REF.Article

A SOLVABLE CASE OF THE ONE-MACHINE SCHEDULING PROBLEM WITH READY AND DUE TIMES.KISE H; IBARAKI T; MINE H et al.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 121-126; BIBL. 7 REF.Article

MINIMAL TEST SET FOR DIAGNOSING A TREE SYSTEMIBARAKI T; KAMEDA T; TOIDA S et al.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 215-240; BIBL. 11 REF.Conference Paper

THRESHOLD SEQUENCESHAMMER PL; IBARAKI T; SIMEONE B et al.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 39-49; BIBL. 19 REF.Article

AN ALGORITHM FOR THE K BEST SOLUTIONS OF THE RESOURCE ALLOCATION PROBLEMKATOH N; IBARAKI T; MINE H et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 752-764; BIBL. 27 REF.Article