Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("STORER JA")

Results 1 to 7 of 7

  • Page / 1
Export

Selection :

  • and

CONSTRUCTING FULL SPANNING TREES FOR CUBIC GRAPHSSTORER JA.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 1; PP. 8-11; BIBL. 4 REF.Article

THE NODE COST MEASURE FOR EMBEDDING GRAPHS ON THE PLANAR GRIDSTORER JA.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 201-210; BIBL. 18 REF.Conference Paper

A NOTE ON THE COMPLEXITY OF CHESSSTORER JA.1979; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS/1979-03-28/BALTIMORE MD; USA; BALTIMORE: THE JOHNS HOPKINS UNIVERSITY; DA. 1979; PP. 160-166; BIBL. 6 REF.Conference Paper

TOWARD AN ABSTRACT THEORY OF DATA COMPRESSION. EXTENDED ABSTRACTSTORER JA.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 391-399; BIBL. 26 REF.Conference Paper

DATA COMPRESSION VIA TEXTUAL SUBSTITUTIONSTORER JA; SZYMANSKI TG.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 928-951; BIBL. 39 REF.Article

A NOTE COMPLEXITY OF THE SUPERSTRING PROBLEM. EXTENDED ABSTRACTMAIER D; STORER JA.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 52-56; BIBL. 5 REF.Conference Paper

ON FINDING MINIMAL LENGTH SUPERSTRINGSGALLANT J; MAIER D; STORER JA et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 50-58; BIBL. 9 REF.Article

  • Page / 1