COPYING LIST STRUCTURES USING BOUNDED WORKSPACE. = COPIE DE STRUCTURES DE LISTE DANS UN ESPACE DE TRAVAIL BORNELINDSTROM G.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 4; PP. 198-202; BIBL. 5 REF.Article

A TRANSPORTATION INFORMATION SYSTEMD'ANNA AJ.1972; COMPUTERS AND AUTOMAT.; U.S.A.; DA. 1972; VOL. 21; NO 9; PP. 14-21Serial Issue

A PRECISE NUMERICAL ANALYSIS PROGRAM.ABERTH O.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 9; PP. 509-513; BIBL. 11 REF.Article

ON A STATISTICAL ACCESS METHOD FOR A NON-DENSE LIST AREA. = UNE METHODE STATISTIQUE D'ACCES A UN DOMAINE DE LISTE NON DENSENEVALAINEN O.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; VOL. 18; NO 1; PP. 9-12; ABS. ALLEM.; BIBL. 5 REF.Article

A NON-RECURSIVE TECHNIQUE FOR RECREATING A DIAGRAPH FROM ITS K-FORMULA REPRESENTATION.BAYS C.1976; COMPUTER J.; G.B.; DA. 1976; VOL. 19; NO 4; PP. 326-328; BIBL. 3 REF.Article

INVERTED INDEXES AND MULTI-LIST STRUCTURES.INGLIS J.1974; COMPUTER J.; G.B.; DA. 1974; VOL. 17; NO 1; PP. 59-63; BIBL. 4 REF.Article

GRAPH STRUCTURESPFALTZ JL.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 411-422; BIBL. 5 REF.Serial Issue

RECHERCHE DE L'INFORMATION REPRESENTEE SOUS LA FORME DE TABLEAUYARMOSH NA; SHAFRANSKIJ YA M.1974; VESCI AKAD. NAVUK B.S.S.R., FIZ.-TEKH. NAVUK; S.S.S.R.; DA. 1974; NO 4; PP. 89-96; BIBL. 3 REF.Article

BOUNDED WORKSPACE GARBAGE COLLECTION IN AN ADDRESS-ORDER PRESERVING LIST PROCESSING ENVIRONMENT.FISHER DA.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 29-32; BIBL. 2 REF.Article

METHODES NOUVELLES POUR L'EVALUATION DE LA FIABILITE. RECONNAISSANCE DES FORMES. I. QUELQUES IDEES NOUVELLES POUR L'EVALUATION DE LA FIABILITE. II. APPLICATION DE LA RECONNAISSANCE DES FORMES AUX CALCULS DE FIABILITE DES SYSTEMESKOEN BV.1972; CEA-R-4368; FR.; DA. 1972; PP. 1-112; ABS. ANGL.; BIBL. 4 P.Report

EXTRACTION OF INVARIANT PICTURE SUB-STRUCTURES BY COMPUTER = EXTRACTION DE SOUS-STRUCTURES INVARIANTES DANS DES IMAGES PAR CALCULATEURSAKAI T; NAGAO M; MATSUSHIMA H et al.1972; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1972; VOL. 1; NO 1; PP. 81-96; BIBL. 2 REF.Serial Issue

A MODEL FOR DATA STRUCTURES AND ITS APPLICATIONS. IITURSKI WM.1972; ACTA INFORMAT.; ALLEM.; DA. 1972; VOL. 1; NO 4; PP. 282-289; BIBL. 9 REF.Serial Issue

SOME NEW UPPER BOUNDS ON THE GENERATION OF PRIME NUMBERS.MAIRSON HG.1977; COMMUNIC. A.C.M.; U.S.A.; DA. 1977; VOL. 20; NO 9; PP. 664-669; BIBL. 6 REF.Article

LIST STRUCTURES IN SIMULA AND PL/1 - A COMPARISON.PALME J.1974; SOFTWARE-PRACT. EXPER.; G.B.; DA. 1974; VOL. 4; NO 4; PP. 379-388; BIBL. 4 REF.Article

ON A NOTATIONAL DEVICE FOR THE DESCRIPTION OF POINTER-FREE OPERATIONS ON STRUCTURED DATA.SOLNTSEFF N.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 2; NO 6; PP. 158-159; BIBL. 5 REF.Article

FILES ORGANIZATION TECHNIQUESROBERTS DC.1972; ADV. IN COMPUTERS; U.S.A.; DA. 1972; VOL. 12; PP. 115-174; BIBL. 8 P. 1/2Serial Issue

ELEMENTS D'UNE THEORIE DE LA COMPRESSION DE DONNEESHENRY LABORDERE A; EUZENAT B.1972; IN: TECH. INF. CONGR. AFCET. GRENOBLE, 1972; PARIS; AFCET; DA. 1972; VOL. 1; PP. 9-23; BIBL. 5 REF.Conference Paper

SCHEMAS DE LISTES DANS LE LANGAGE DELTA-EPSILONPETROVA LT.1972; OPTIMIZACIJA; S.S.S.R.; DA. 1972; NO 6; PP. 65-79; BIBL. 6 REF.Serial Issue

A GENERALIZED COUNTER SCHEMELAM K; SIU MK; YU CT et al.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 3; PP. 271-278; BIBL. 9 REF.Article

POSPL-PAQUET DE PROGRAMMES DE TRAITEMENT DES STRUCTURES DE LISTEBERESTOVAYA SN; KRILYUK NI; PASHKOVETS ND et al.1980; KIBERNETIKA; UKR; DA. 1980; NO 2; PP. 42-46; ABS. ENG; BIBL. 8 REF.Article

A STOCHASTIC EVALUATION MODEL FOR DATABASE ORGANIZATIONS IN DATA RETRIEVAL SYSTEMS.SILER FF.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 2; PP. 84-95; BIBL. 25 REF.Article

EIN EA-PAKET ZUR LISTENVERARBEITUNG IN EINEM FORTRAN-SLIP-RAHMEN = UN PACKAGE D'ENTREE SORTIE POUR LE TRAITEMENT DE LISTE DANS LE CADRE DU FORTRAN-SLIPLUGGER J; MELENK H.1972; ANGEW. INFORMAT.; DTSCH.; DA. 1972; VOL. 14; NO 10; PP. 472-479; ABS. ANGL.; BIBL. 9 REF.Serial Issue

APPLICATION OF LINKED LIST TECHNIQUE FOR THE ENHANCEMENT OF TRADITIONAL RANDOM ACCESS FILESTIEN PAO WEN; IYENGAR SS.1980; COMPUTERS AND EDUC.; GBR; DA. 1980; VOL. 4; NO 3; PP. 199-211; BIBL. 12 REF.Article

ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURESYAU SS; RAMEY JL; NICHOLL RA et al.1980; J. SYST. SOFTW.; ISSN 0164-1212; USA; DA. 1980; VOL. 1; NO 4; PP. 319-336; BIBL. 21 REF.Article

ON A LIST TRANSFORMATION FROM A REGULAR EXPRESSION TO ITS CAMBRIDGE-POLISH NOTATION BY A LISP FUNCTIONHYEN YEAL LEE.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 2; PP. 313-317; BIBL. 4 REF.Article