BEST HUFFMAN TREESMARKOWSKY G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 363-370; BIBL. 5 REF.Article

ON A CLASS OF ONE-STEP MAJORITY-LOGIC DECODABLE CYCLIC CODESSHU LIN; MARKOWSKY G.1980; I.B.M. J. RES. DEVELOP.; USA; DA. 1980; VOL. 24; NO 1; PP. 56-63; BIBL. 7 REF.Article

LOWER BOUNDS ON THE LENGTHS OF NODE SEQUENCES IN DIRECTED GRAPHS.MARKOWSKY G; TARJAN RE.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 4; PP. 329-337; BIBL. 7 REF.Article

DIFFERENTIAL OPERATORS AND THE THEORY OF BINOMIAL ENUMERATION.MARKOWSKY G.1978; J. MATH. ANAL. APPL.; U.S.A.; DA. 1978; VOL. 63; NO 1; PP. 145-155; BIBL. 6 REF.Article

CATEGORIES OF CHAIN-COMPLETE POSETS.MARKOWSKY G.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 2; PP. 125-135; BIBL. 13 REF.Article

Primes, irreducibles and extremal latticesMARKOWSKY, G.Order (Dordrecht). 1992, Vol 9, Num 3, pp 265-290, issn 0167-8094Article

Bounding signal probabilities in combinational circuitsMARKOWSKY, G.IEEE transactions on computers. 1987, Vol 36, Num 10, pp 1247-1251, issn 0018-9340Article

BASES FOR CHAIN-COMPLETE POSETS.MARKOWSKY G; ROSEN BK.1976; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 138-147; BIBL. 19 REF.Article

Necessary and sufficient conditions for a phenotype system to have a factor-union representationMARKOWSKY, G.Mathematical biosciences. 1983, Vol 66, Num 1, pp 115-128, issn 0025-5564Article

BASES FOR CHAIN-COMPLETE POSETS.MARKOWSKY G; ROSEN BK.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 34-47; BIBL. 17 REF.Conference Paper

REDUCED SET OF PHAGES FOR TYPING SALMONELLAEGERSHMAN M; MARKOWSKY G.1983; JOURNAL OF CLINICAL MICROBIOLOGY; ISSN 0095-1137; USA; DA. 1983; VOL. 17; NO 2; PP. 240-244; BIBL. 11 REF.Article

AN EVALUATION OF LOCAL PATH ID SWAPPING IN COMPUTER NETWORKSMARKOWSKY G; MOSS FH.1981; IEEE TRANS. COMMUN.; ISSN 0090-6778; USA; DA. 1981; VOL. 29; NO 3; PP. 329-336; BIBL. 5 REF.Article

ON THE NUMBER OF PRIME IMPLICANTSCHANDRA AK; MARKOWSKY G.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 1; PP. 7-11; BIBL. 7 REF.Article

THE WEIGHTED SYNDROME SUMS APPROACH TO VLSI TESTINGBARZILAI Z; SAVIR J; MARKOWSKY G et al.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 12; PP. 996-1000; BIBL. 6 REF.Article

Phage typing setsMARKOWSKY, G; GERSHMAN, M; HUNTER, J et al.Mathematical and computer modelling. 1992, Vol 16, Num 6-7, pp 113-119, issn 0895-7177Article

Approach to recognition of license plate numbers using neural networksPALIY, I; TURCHENKO, V; KOVAL, V et al.International Joint Conference on Neural Networks. 2004, isbn 0-7803-8359-1, 4Vol, Vol4, 2965-2970Conference Paper

Using the Castle Metaphor to Communicate Basic Concepts in Cybersecurity EducationMARKOWSKY, G; MARKOWSKY, L.Security & management. International conferenceWorldComp'2011. 2011, pp 507-511, isbn 1-60132-196-1 1-60132-197-X 1-60132-198-8, 5 p.Conference Paper

High School Cyber Defense Competitions: Lessons from the TrenchesALBERT, R; MARKOWSKY, G; WALLINGFORD, J et al.Security & management. International conferenceWorldComp'2010. 2010, pp 280-285, isbn 1-60132-159-7 1-60132-162-7 1-60132-163-5, 6 p.Conference Paper