A COMPUTER ANIMATION COMPOSED OF CONNECTED ANIMATION PRIMITIVESAGUI T; NAKAJIMA M; SEKINE H et al.1981; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1981 PUBL. 1982; VOL. 12; NO 2; PP. 45-54; BIBL. 12 REF.Article

AN EFFICIENT LIST-MOVING ALGORITHM USING CONSTANT WORK-SPACE.CLARK DW.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 6; PP. 352-354; BIBL. 10 REF.Article

REFERENCING LISTS BY AN EDGE.WISE DS.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 6; PP. 338-342; BIBL. 6 REF.Article

ANOTHER COMPACTING GARBAGE COLLECTORMORRIS FL.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 4; PP. 139-142; BIBL. 8 REF.Article

GENERAL VECTOR DATA STRUCTURES IN APLDELL'AQUILA C.1979; EURO IFIP 79. EUROPEAN CONFERENCE ON APPLIED INFORMATION TECHNOLOGY/1979/LONDRES; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1979; PP. 591-597; BIBL. 15 REF.Conference Paper

BATCH SCHEDULING FROM SHORT LISTSLYON G.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 493-495; BIBL. 4 REF.Conference Paper

A MODEL FOR PL/I LIST-PROCESSING USING THE METHOD OF SEMANTIC BRICKS.ISSEL W.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 11-12; PP. 567-587; ABS. ALLEM. RUSSEArticle

TWO SPECTRA OF SELF ORGANIZING SEQUENTIAL SEARCH ALGORITHMSTENENBAUM AM; NEMES RM.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 557-566; BIBL. 11 REF.Article

LOCALIZED SEARCH IN SORTED LISTKOSARAJU SR.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. 62-69; BIBL. 6 REF.Conference Paper

M3L: A LIST-DIRECTED ARCHITECTURESANSONNET JP; CASTAN M; PERCEBOIS C et al.1980; ANNUAL SYMPOSIUM ON COMPUTER ARCHITECTURE. 7/1980/LA BAULE; USA; NEW YORK: IEEE; DA. 1980; PP. 105-112; BIBL. 15 REF.Conference Paper

RANDOM ACCESS IN A LIST ENVIRONMENT.LODI E; LUCCIO F; PAGLI L et al.1976; INFORM. SYST.; G.B.; DA. 1976; VOL. 2; NO 1; PP. 11-17; BIBL. 6 REF.Article

AN IMPROVED LIST-SEARCHING ALGORITHMLEVY LS.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 1; PP. 43-45; BIBL. 2 REF.Article

ON THE POWER OF LIST ITERATIONGORDON MJC.1979; COMPUTER J.; GBR; DA. 1979; VOL. 22; NO 4; PP. 376-379; BIBL. 7 REF.Article

EIN VERFAHREN ZUR EDV-GESTUETZTEN DIENSTPLANBILDUNG = UN PROCEDE POUR LA FORMATION DES TABLEAUX DE SERVICE PAR LE TRAITEMENT ELECTRONIQUE DES DONNEESWINCKLER J.1979; VERK. U. TECH.; DEU; DA. 1979; NO 1; PP. 3-6; BIBL. 9 REF.Article

A COUNTEREXAMPLE TO REINGOLD'S PUSHDOWN PERMUTER CHARACTERIZATION THEOREMCARLSON CR.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 199-201; BIBL. 1 REF.Article

EXTENSIONS OF A FUNCTIONAL LIST PROCESSOR.POPOV GI.1977; SERDICA; BULG.; DA. 1977; VOL. 3; NO 2; PP. 94-105; BIBL. 2 REF.Article

AN OVERVIEW OF SL5.GRISWOLD RE; HANSON DR.1977; SIGPLAN NOT.; U.S.A.; DA. 1977; VOL. 12; NO 4; PP. 40-50; BIBL. 1 P. 1/2Article

A NOTE ON TRAVERSAL ALGORITHMS FOR TRIPLY LINKED BINARY TREESFENNER TI; LOIZOU G.1981; BIT (NORD-TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 2; PP. 153-156; BIBL. 7 REF.Article

ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURESYAU SS; RAMEY JL.1979; COMPSAC 79. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 3/1979/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 606-611; BIBL. 9 REF.Conference Paper

Direct-chaining with coalescing listsKNOTT, G. D.Journal of algorithms (Print). 1984, Vol 5, Num 1, pp 7-21, issn 0196-6774Article

THE ARITHMETIC OF SHAPESKRISHNAMURTI R.1980; ENVIRON. & PLANN. B; ISSN 0308-2164; GBR; DA. 1980; VOL. 7; NO 4; PP. 463-484; BIBL. 9 REF.Article

DESIGN AND ANALYSIS OF A HYPHENATION PROCEDUREMOITRA A; MUDUR SP; NARWEKAR AW et al.1979; SOFTWARE-PRACT. EXPER.; GBR; DA. 1979; VOL. 9; NO 4; PP. 325-337; BIBL. 6 REF.Article

PIVOT STRATEGIES FOR PRIMAL-SIMPLEX NETWORK CODES.MULVEY JM.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 2; PP. 266-270; BIBL. 13 REF.Article

PRESERVING AVERAGE PROXIMITY IN ARRAYS.DE MILLO RA; EISENSTAT SC; LIPTON RJ et al.1978; COMMUNIC. A.C.M.; U.S.A.; DA. 1978; VOL. 21; NO 3; PP. 228-230; BIBL. 7 REF.Article

SIMULATIONS OF DYNAMIC SEQUENTIAL SEARCH ALGORITHMSTENENBAUM A.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 9; PP. 790-791; BIBL. 3 REF.Article