SYMMETRY BREAKING IN DISTRIBUTIVE NETWORKSITAI A; RODEH M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 150-158; BIBL. 14 REF.Conference Paper

STRUCTURE OF A 3-ACETONYLIDENEINDOLIN-2-ONE DIMERITAI A; IITAKA Y.1978; ACTA CRYSTALLOGR., B; DNK; DA. 1978; VOL. 34; NO 12; PP. 3775-3777; BIBL. 6 REF.Article

STRUCTURE AND CHEMISTRY OF SOME OPHIOBOLIN D DERIVATIVESITAI A; NOZOE S.1980; CHEM. PHARM. BULL.; JPN; DA. 1980; VOL. 28; NO 4; PP. 1043-1050; BIBL. 7 REF.Article

FINDING A MINIMUM CIRCUIT IN A GRAPHITAI A; RODEH M.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 413-423; BIBL. 10 REF.Article

HAMILTON PATHS IN GRID GRAPHSITAI A; PAPADIMITRIOU CH; SZWARCFITER JL et al.1982; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 676-686; BIBL. 10 REF.Article

CRYSTALLOGRAPHIC STUDIES OF AN ANTHRAQUINONE DERIVATIVE OBTAINED FROM KIDAMYCINFURUKAWA M; ITAI A; IITAKA Y et al.1973; TETRAHEDRON LETTERS; G.B.; DA. 1973; NO 13; PP. 1065-1068; BIBL. 4 REF.Serial Issue

THE COMPLEXITY OF FINDING MAXIMUM DISJOINT PATHS WITH LENGTH CONTRAINTSITAI A; PERL Y; SHILOACH Y et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 277-286; BIBL. 9 REF.Article

INTERPOLATION SEARCH. A LOG LOGN SEARCHPERL Y; ITAI A; AVNI H et al.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 7; PP. 550-553; BIBL. 8 REF.Article

SOME MATCHING PROBLEMS FOR BIPARTITE GRAPHSITAI A; RODEH M; TANIMOTO SL et al.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 4; PP. 517-525; BIBL. 21 REF.Article

A SPARSE TABLE IMPLEMENTATION OF PRIORITY QUEUESITAI A; KONHEIM AG; RODEH M et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 417-431; BIBL. 15 REF.Conference Paper

ON THE COMPLEXITY OF TIMETABLE AND MULTICOMMODITY FLOW PROBLEMS.EVEN S; ITAI A; SHAMIR A et al.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 691-703; BIBL. 10 REF.Article

How to pack treesGIL, J; ITAI, A.Journal of algorithms (Print). 1999, Vol 32, Num 2, pp 108-132, issn 0196-6774Article

Des méthodes informatiques pour la conception des médicamentsTOMIOKA, N; ITAI, A.Yukagaku. 1989, Vol 38, Num 5, pp 378-384, issn 0513-398XArticle

TRICHOLIDIC ACID, A NEW TRITERPENE LACTONIC ACID FROM TRICHOLOMA SPECIESNOZOE S; TAKAHASHI A; KUSANO G et al.1982; CHEMISTRY LETTERS; ISSN 0366-7022; JPN; DA. 1982; NO 10; PP. 1679-1680; BIBL. 4 REF.Article

SYNTHETIC STUDIES ON MARASMANE AND ISOMARASMANE DERIVATIVESMORISAKI N; FURUKAWA J; NOZOE S et al.1980; CHEM. PHARM. BULL.; JPN; DA. 1980; VOL. 28; NO 2; PP. 500-507; BIBL. 20 REF.Article

The number of buffers required for sequential processing of a disk fileITAI, A; RAZ, Y.Communications of the ACM. 1988, Vol 31, Num 11, pp 1338-1342, issn 0001-0782Article

A fast and simple randomized parallel algorithm for maximal matchingISRAELI, A; ITAI, A.Information processing letters. 1986, Vol 22, Num 2, pp 77-80, issn 0020-0190Article

Scheduling transmissions in a networkITAI, A; RODEH, M.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 409-429, issn 0196-6774Article

A NOVEL PSEUDOTWISTANE, PULCHELLON FROM GAILLARDIA PULCHELLA.INAYAMA S; KAWAMATA T; OHKURA T et al.1975; CHEM. PHARM. BULL.; JAP.; DA. 1975; VOL. 23; NO 11; PP. 2998-3007; BIBL. 15 REF.Article

The multi-tree approach to reliability in distributed networksITAI, A; RODEH, M.Information and computation (Print). 1988, Vol 79, Num 1, pp 43-59, issn 0890-5401Article

A golden ratio control policy for a multiple-access channelITAI, A; ROSBERG, Z.IEEE transactions on automatic control. 1984, Vol 29, Num 8, pp 712-718, issn 0018-9286Article

HOST-GUEST COMPLEX FORMATION BETWEEN A WATER-SOLUBLE POLYPARACYCLOPHANE AND A HYDROPHOBIC GUEST MOLECULEODASHIMA K; ITAI A; IITAKA Y et al.1980; J. AMER. CHEM. SOC.; USA; DA. 1980; VOL. 102; NO 7; PP. 2504-2505; BIBL. 21 REF.Article

Adaptive source routing in high-speed networksITAI, A; SHACHNAI, H.Journal of algorithms (Print). 1996, Vol 20, Num 2, pp 218-243, issn 0196-6774Article

Page / 4