ON THE COMBINATIONAL COMPLEXITY OF CERTAIN SYMMETRIC BOOLEAN FUNCTIONS.STOCKMEYER LJ.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 4; PP. 323-336; BIBL. 7 REF.Article

THE POLYNOMINAL-TIME HIERARCHY.STOCKMEYER LJ.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 1-22; BIBL. 27 REF.Article

PROVABLY DIFFICULT COMBINATORIAL GAMESSTOCKMEYER LJ; CHANDRA AK.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 151-174; BIBL. 24 REF.Article

STORAGE SCHEMES FOR BOUNDEDLY EXTENSIBLE ARRAYS.ROSENBERG AL; STOCKMEYER LJ.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 3; PP. 289-303; BIBL. 5 REF.Article

ON THE NUMBER OF COMPARISONS TO FIND THE INTERSECTION OF TWO RELATIONSSTOCKMEYER LJ; WONG CK.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 388-404; BIBL. 12 REF.Article

NP-COMPLETENESS OF SOME GENERALIZATIONS OF THE MAXIMUM MATCHING PROBLEMSTOCKMEYER LJ; VAZIRANI VV.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 1; PP. 14-19; BIBL. 5 REF.Article

UNIFORM DATA ENCODINGSROSENBERG AL; SNYDER L; STOCKMEYER LJ et al.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 412-417; BIBL. 10 REF.Conference Paper

A DICTIONARY MACHINE (FOR VLSI)OTTMANN TA; ROSENBERG AL; STOCKMEYER LJ et al.1982; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1982; VOL. 31; NO 9; PP. 892-897; BIBL. 10 REF.Article

UNIFORM DATA ENCODDINGSROSENBERG AL; STOCKMEYER LJ; SNYDER L et al.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 145-165; BIBL. 19 REF.Article