ON THE POWER OF PROBABILISTIC CHOICE IN SYNCHRONOUS PARALLEL COMPUTATIONSREIF JH.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 442-450; BIBL. 3 P.Conference Paper

MINIMUM S-T CUT OF A PLANAR UNDIRECTED NETWORK IN O(N LOG²(N)) TIMEREIF JH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 56-67; BIBL. 13 REF.Conference Paper

CODE MOTIONREIF JH.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 375-395; BIBL. 24 REF.Article

COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONREIF JH.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 421-427; BIBL. 12 REF.Conference Paper

SYMBOLIC PROGRAM ANALYSIS IN ALMOST-LINEAR TIMEREIF JH; TARJAN RE.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 81-93; BIBL. 13 REF.Article

RANDOM MATROIDSREIF JH; SPIRAKIS PG.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 385-397; BIBL. 20 REF.Conference Paper

SYMBOLIC EVALUATION AND THE GLOBAL VALUE GRAPH.REIF JH; LEWIS HR.1977; IN: ACM SYMP. PRINC. PROGRAM. LANG. 4; LOS ANGELES; 1977; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1977; PP. 104-118; BIBL. 1 P.Conference Paper

THE PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAMSHALPERN JY; REIF JH.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 322-334; BIBL. 19 REF.Conference Paper

A DYNAMIC LOGIC OF MULTIPROCESSING WITH INCOMPLETE INFORMATIONREIF JH; PETERSON GL.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 193-202; BIBL. 22 REF.Conference Paper