au.\*:("VAN LEEUWEN J")
Results 1 to 25 of 264
Selection :
UEBER PROGRAMMEFFIZIENZ UND ALGEBRAISCHE KOMPLEXITAET = SUR L'EFFICACITE DES PROGRAMMES ET LA COMPLEXITE ALGEBRIQUEVAN LEEUWEN J.1980; INFORM.-SPEKTRUM; DEU; DA. 1980; VOL. 3; NO 3; PP. 172-180; BIBL. 26 REF.Article
THE MEMBERSHIP QUESTION FOR ETOL-LANGUAGES IS POLYNOMIALLY COMPLETE.VAN LEEUWEN J.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 5; PP. 138-143; BIBL. 15 REF.Article
A USEFUL LEMMA FOR CONTEXT-FREE PROGRAMMED GRAMMARSVAN LEEUWEN J.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 373-386; BIBL. 12 REF.Article
RECURSIVELY ENUMERABLE LANGUAGES AND VAN WIJNGAARDEN GRAMMARS.VAN LEEUWEN J.1977; PROC. KKL. NEDERL. AKAD. WETENSCH., A.; NETHERL.; DA. 1977; VOL. 80; NO 1; PP. 29-39; BIBL. 11 REF.Article
THE COMPLEXITY OF DATA ORGANIZATION.VAN LEEUWEN J.1976; IN: FOUND. COMPUT. SCI. ADV. COURSE. 2.; AMSTERDAM; 1976; AMSTERDAM; MATH. CENTRUM; DA. 1976; VOL. 1; PP. 35-147; BIBL. 5 P.Conference Paper
THE TAPE-COMPLEXITY OF CONTEXT-INDEPENDENT DEVELOPMENTAL LANGUAGES.VAN LEEUWEN J.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 2; PP. 203-211; BIBL. 1 P.Article
ON COMPROMISING STATISTICAL DATA-BASES WITH A FEW KNOWN ELEMENTSVAN LEEUWEN J.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 3; PP. 149-153; BIBL. 6 REF.Article
ON EFFICIENTLY COMPUTING THE PRODUCT OF TWO BINARY RELATIONS.VAN LEEUWEN J.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 193-201; BIBL. 12 REF.Article
TWO GENERAL METHODS FOR DYNAMIZING DECOMPOSABLE SEARCHING PROBLEMSOVERMARS MH; VAN LEEUWEN J.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 26; NO 2; PP. 155-166; ABS. GER; BIBL. 9 REF.Article
THE COMPLEXITY OF BASIC COMPLEX OPERATIONSALT H; VAN LEEUWEN J.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 27; NO 3; PP. 205-215; ABS. GER; BIBL. 15 REF.Article
DYNAMICALLY MAINTAINING CONFIGURATIONS IN THE PLANEOVERMARS MH; VAN LEEUWEN J.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 135-145; BIBL. 28 REF.Conference Paper
THE HALTING PROBLEM FOR LINEAR TURING ASSEMBLERS.BAER RM; VAN LEEUWEN J.1976; J. COMPUTER SYST.; U.S.A.; DA. 1976; VOL. 13; NO 2; PP. 119-135; BIBL. 10 REF.Article
AN IMPROVED BOUND FOR DETECTING LOOPING CONFIGURATIONS IN DETERMINISTIC DPA'S.VAN LEEUWEN J; SMITH CH.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 22-24; BIBL. 6 REF.Article
WORST-CASE OPTIMAL INSERTION AND DELETION METHODS FOR DECOMPOSABLE SEARCHING PROBLEMSOVERMARS MH; VAN LEEUWEN J.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 168-173; BIBL. 15 REF.Article
DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMSVAN LEEUWEN J; WOOD D.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 51-56; BIBL. 6 REF.Article
MINER'S RULE WITH RESPECT TO PLAIN CONCRETE = LA REGLE DE MINER EN CE QUI CONCERNE LE BETON NON ARMEVAN LEEUWEN J; SIEMES AJM.1979; HERON; NLD; DA. 1979; VOL. 24; NO 1; PP. 1-34; (31 P.); BIBL. 6 REF.Serial Issue
EFFICIENT RECOGNITION OF RATIONAL RELATIONSVAN LEEUWEN J; NIVAT M.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 1; PP. 34-38; BIBL. 3 REF.Article
DYNAMIZATION OF DECOMPOSABLE SEARCHING PROBLEMS YIELDING GOOD WORST-CASE BOUNDSOVERMARS MH; VAN LEEUWEN J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 224-233; BIBL. 22 REF.Conference Paper
FURTHER COMMENTS ON BYKAT'S CONVEX HULL ALGORITHMOVERMARS MH; VAN LEEUWEN J.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 209-212; BIBL. 8 REF.Article
A FAMILY OF SIMILARITY MEASURES BETWEEN TWO STRINGSFINDLER NV; VAN LEEUWEN J.1979; I.E.E.E. TRANS. PATTERN ANAL. MACH. INTELL.; USA; DA. 1979; VOL. 1; NO 1; PP. 116-118; BIBL. 5 REF.Article
THE COMPLEXITY OF VECTOR-PRODUCTS.DOBKIN D; VAN LEEUWEN J.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 6; PP. 149-154; BIBL. 13 REF.Article
A DECOMPOSITION THEOREM FOR HYPER-ALGEBRAIC EXTENSIONS OF LANGUAGE FAMILIES.VAN LEEUWEN J; WOOD D.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 199-214; BIBL. 10 REF.Article
LES POSSIBILITES DE LA SANTE MENTALE DE L'ENFANT ET LA THERAPEUTIQUE OCCUPATIONNELLE DANS LA PREVENTION DES TROUBLES PSYCHOLOGIQUES PROVOQUES PAR L'INTERACTION ENTRE L'HOMME ET SON ENVIRONNEMENT EN NEERLANDAISKOCK VAN LEEUWEN J. A. C. DE.T. SOC. GENEESKDE. 1972, Vol 50, Num 22, pp 819-821Article
Des règles phonologiques de la décomposition néo-frisonneVAN LEEUWEN, J.Taal en Tongval Bruxelles. 1977, Vol 29, Num 1-2, pp 28-36Article
SOME ELEMENTARY PROOFS OF LOWER-BOUNDS IN COMPLEXITY THEORY.VAN LEEUWEN J; VAN EMDE BOAS P.1975; STICHTG MATH. CENTRUM, INFORMAT.; NEDERL.; DA. 1975; NO 41; PP. 1-20; BIBL. 2 P.Article