FINDING THE VERTEX CONNECTIVITY OF GRAPHSGALIL Z.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 197-199; BIBL. 6 REF.Article

ON RESOLUTION WITH CLAUSES OF BOUNDED SIZE.GALIL Z.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 3; PP. 444-459; BIBL. 8 REF.Article

AN ALMOST LINEAR-TIME ALGORITHM FOR COMPUTING A DEPENDENCY BASIS IN A RELATIONAL DATABASEGALIL Z.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 1; PP. 96-102; BIBL. 9 REF.Article

ON THE THEORETICAL EFFICIENCY OF VARIOUS NETWORK FLOW ALGORITHMSGALIL Z.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 14; NO 1; PP. 103-111; BIBL. 14 REF.Article

PALINDROME RECOGNITION IN REAL TIME BY A MULTITAPE TURING MACHINE.GALIL Z.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 2; PP. 140-157; BIBL. 17 REF.Article

ON THE COMPLEXITY OF REGULAR RESOLUTION AND THE DAVIS-PUTNAM PROCEDURE.GALIL Z.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 1; PP. 23-46; BIBL. 14 REF.Article

AN ALMOST LINEAR TIME ALGORITHM FOR COMPUTING A DEPENDENCY BASIS IN A RELATIONAL DATA BASEGALIL Z.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 246-256; BIBL. 8 REF.Conference Paper

SOME OPEN PROBLEMS IN THE THEORY OF COMPUTATION AS QUESTIONS ABOUT TWO-WAY DETERMINISTIC PUSHDOWN AUTOMATON LANGUAGES.GALIL Z.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 3; PP. 211-228; BIBL. 1 P.Article

FUNCTIONAL SCHEMAS WITH NESTED PREDICATES.GALIL Z.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 4; PP. 349-368; BIBL. 8 REF.Article

Efficient algorithms for finding maximum matching in graphsGALIL, Z.ACM computing surveys. 1986, Vol 18, Num 1, pp 23-38, issn 0360-0300Article

NP COMPLETENESS OF FINDING THE CHROMATIC INDEX OF REGULAR GRAPHSLEVEN D; GALIL Z.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 35-44; BIBL. 5 REF.Article

AN EFFICIENT GENERAL PURPOSE PARALLEL COMPUTERGALIL Z; PAUL WJ.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 247-262; BIBL. 33 REF.Conference Paper

FOOLING A TWO-WAY AUTOMATON OR ONE PUSHDOWN STORE IS BETTER THAN ONE COUNTER FOR TWO WAY MACHINESDURIS P; GALIL Z.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 177-188; BIBL. 14 REF.Conference Paper

TIME- AND SPACE-SAVING COMPUTER METHODS, RELATED TO MITCHELL'S DETMAX, FOR FINDING D-OPTIMUM DESIGNSGALIL Z; KIEFER J.1980; TECHNOMETRICS; ISSN 0040-1706; USA; DA. 1980; VOL. 22; NO 3; PP. 301-313; BIBL. 17 REF.Article

EXPLICITE CONSTRUCTIONS OF LINEAR SIZE SUPERCONCENTRATORSGABBER O; GALIL Z.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. 364-370; BIBL. 5 REF.Conference Paper

MONOTONE SWITCHING CIRCUITS AND BOOLEAN MATRIX PRODUCT.MEHLHORN K; GALIL Z.sdIN: THEOR. ALGORITHMES LANG. PROGRAMMATION. SEMIN.; ROCQUENCOURT; 1974-1975; ROCQUENCOURT; INST. RECH. INF. AUTOM.; DA. S.D.; PP. 33-39; BIBL. 5 REF.Conference Paper

ON REVERSAL-BOUNDED COUNTERMACHINES AND ON PUSHDOWN AUTOMATA WITH A BOUND ON THE SIZE OF THE PUSHDOWN STOREDURIS P; GALIL Z.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 166-175; BIBL. 4 REF.Conference Paper

A FAST SELECTION ALGORITHM AND THE PROBLEM OF OPTIMUM DISTRIBUTION OF EFFORTGALIL Z; MEGIDDO N.1979; J. AN. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 1; PP. 58-64; BIBL. 14 REF.Article

A LINEAR-TIME ON-LINE RECOGNITION ALGORITHM FOR "PALSTAR".GALIL Z; SEIFERAS J.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 102-111; BIBL. 12 REF.Article

COMPARISON OF SIMPLEX DESIGNS FOR QUADRATIC MIXTURE MODELS.GALIL Z; KIEFER J.1977; TECHNOMETRICS; U.S.A.; DA. 1977; VOL. 19; NO 4; PP. 445-453; BIBL. 15 REF.Article

REAL-TIME RECOGNITION OF SUBSTRING REPETITION AND REVERSALSEIFERAS J; GALIL Z.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 111-146; BIBL. 16 REF.Article

A NOTE ON MULTIPLE-ENTRY FINITE AUTOMATA.GALIL Z; SIMON J.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 3; PP. 350-351; BIBL. 2 REF.Article

FOOLING A TWO WAY AUTOMATION OR ONE PUSHDOWN STORE IS BETTER THAN ONE COUNTER FOR TWO WAY MACHINESDURIS P; GALIL Z.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 21; NO 1; PP. 39-53; BIBL. 15 REF.Article

D-OPTIMUM WEIGHING DESIGNSGALIL Z; KIEFER J.1980; ANN. STAT.; ISSN 0090-5364; USA; DA. 1980; VOL. 8; NO 6; PP. 1293-1306; BIBL. 18 REF.Article

SAVING SPACE IN FAST STRING-MATCHINGGALIL Z; SEIFERAS J.1980; S.I.A.M. J. COMPUTG.; USA; DA. 1980; VOL. 9; NO 2; PP. 417-438; BIBL. 18 REF.Article