A FAST TEST FOR UNIQUE DECIPHERABILITY BASED ON SUFFIX TREESRODEH M.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 4; PP. 648-651; BIBL. 6 REF.Article

FINDING THE MEDIAN DISTRIBUTIVELYRODEH M.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 162-166; BIBL. 6 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

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

ECONOMICAL ENCODING OF COMMAS BETWEEN STRINGS.EVEN S; RODEH M.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 4; PP. 315-317; BIBL. 3 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

AN 0(N LOG N) UNIDIRECTIONAL DISTRIBUTED ALGORITHM FOR EXTREMA FINDING IN A CIRCLEDOLEV D; KLAWE M; RODEH M et al.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 3; PP. 245-260; BIBL. 7 REF.Article

DISTRIBUTED TERMINATION WITH INTERVAL ASSERTIONSFRANCEZ N; RODEH M; SINTZOFF M et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 280-291; BIBL. 10 REF.Conference Paper

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

LINEAR ALGORITHM FOR DATA COMPRESSION VIA STRING MATCHINGRODEH M; PRATT VR; EVEN S et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 16-24; BIBL. 12 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

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

On the complexity of scheduling problems for parallel/pipelined machinesBERNSTEIN, D; RODEH, M; GERTNER, I et al.IEEE transactions on computers. 1989, Vol 38, Num 9, pp 1308-1313, issn 0018-9340Article

A logic-based approach to program flow analysisSAGIV, M; FRANCEZ, N; RODEH, M et al.Acta informatica. 1998, Vol 35, Num 6, pp 457-504, issn 0001-5903Article

Virtual Cache Line : A new technique to improve cache exploitation for recursive data structuresRUBIN, S; BERNSTEIN, D; RODEH, M et al.Lecture notes in computer science. 1999, pp 259-273, issn 0302-9743, isbn 3-540-65717-7Conference Paper

Mathematical analysis of statistical sampling for estimating computer cache performanceBERNSTEIN, D; GAL, S; RODEH, M et al.Communications in statistics. Stochastic models. 1996, Vol 12, Num 1, pp 67-75, issn 0882-0287Article

Scheduling arithmetic and load operations in parallel with no spillingBERNSTEIN, D; JAFFE, J. M; RODEH, M et al.SIAM journal on computing (Print). 1989, Vol 18, Num 6, pp 1098-1127, issn 0097-5397Article

FLAME ― an efficient access method for optical disksURI SHANI, U; RODEH, M; WECKER, A. J et al.RIAO 88: (Recherche d'Information Assistée par Ordinateur). Conference. 1988, pp 227-236Conference Paper

Indexing and dictionary matching with one errorAMIR, A; KESELMAN, D; LANDAN, G. M et al.Lecture notes in computer science. 1999, pp 181-192, issn 0302-9743, isbn 3-540-66279-0Conference Paper