Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("NEVALAINEN O")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 46

  • Page / 2
Export

Selection :

  • and

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

EXPERIMENTS WITH A CLOSEST POINT ALGORITHM IN HAMMING SPACENEVALAINEN O; KATAJAINEN J.1982; ANGEWANDTE INFORMATIK; ISSN 0013-5704; DEU; DA. 1982; NO 5; PP. 277-281; ABS. GER; BIBL. 7 REF.Article

THE EFFICIENCY OF TWO INDEXED PRIORITY QUEUE ALGORITHMSNEVALAINEN O; TEUHOLA J.1978; B.I.T.; DNK; DA. 1978; VOL. 18; NO 3; PP. 320-333; BIBL. 13 REF.Article

ON THE REORGANIZATION OF HYBRID INDEXESJAKOBSSON M; NEVALAINEN O.1980; INTERNATIONAL CONFERENCE ON DATA BASES/1980/ABERDEEN; GBR/USA/DEU; LONDON; PHILADELPHIA; RHEINE: HEYDEN; DA. 1980; PP. 250-259; BIBL. 4 REF.Conference Paper

COMPACT STORAGE SCHEMES FOR FORMATTED FILES BY SPANNING TREESERNVALL J; NEVALAINEN O.1979; ; BIT; DNK; DA. 1979; VOL. 19; NO 4; PP. 463-475; BIBL. 13 REF.Article

IMPLEMENTATION OF A DISTRIBUTIVE SORTING ALGORITHMNEVALAINEN O; ERNVALL J.1983; T.S.I. TECHNIQUE ET SCIENCE INFORMATIQUES; ISSN 0752-4072; FRA; DA. 1983; VOL. 2; NO 1; PP. 33-41; ABS. FRE; BIBL. 24 REF.Article

ON A DYNAMIC NEAREST NEIGHBOUR PROBLEMLEIPALA T; NEVALAINEN O.1979; R.A.I.R.O., INFORMAT.; FRA; DA. 1979; VOL. 13; NO 1; PP. 3-15; ABS. FRE; BIBL. 11 REF.Article

PRIORITY QUEUE ADMINISTRATION BY SUBLIST INDEXNEVALAINEN O; TEUHOLA J.1979; COMPUTER J.; GBR; DA. 1979; VOL. 22; NO 3; PP. 220-225; BIBL. 7 REF.Article

SOLVING THE ORDER OF LINE DRAWING.NEVALAINEN O; VESTERINEN M.1978; ANGEW. INFORMAT.; DTSCH.; DA. 1978; NO 1; PP. 15-19; ABS. ALLEM.; BIBL. 6 REF.Article

DETERMINING BLOCKING FACTORS FOR SEQUENTIAL FILER BY HEURISTIC METHODS.NEVALAINEN O; VESTERINEN M.1977; COMPUTER J.; G.B.; DA. 1977; VOL. 20; NO 3; PP. 245-247; BIBL. 4 REF.Article

TWO EFFICIENT ALGORITHMS FOR RANDOM SAMPLING WITHOUT REPLACEMENTTEUHOLA J; NEVALAINEN O.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 11; NO 2; PP. 127-140; BIBL. 3 REF.Article

ON THE MINIMAL STORAGE SPACE OF TABLE-LIKE FILESERNVALL J; NEVALAINEN O.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 4; PP. 319-326Article

AN ALGORITHM FOR UNBIASED RANDOM SAMPLINGERNVALL J; NEVALAINEN O.1982; COMPUTER JOURNAL; ISSN 0010-4620; GBR; DA. 1982; VOL. 25; NO 1; PP. 45-47; BIBL. 2 REF.Article

BLOCKING FACTORS FOR MAGNETIC TAPE FILES.NEVALAINEN O; PUTKONEN A.1978; ANN. UNIV. TURKU., A1; FINL.; DA. 1978; NO 175; PP. 74-81; BIBL. 5 REF.Article

A PLOTTER SEQUENCING SYSTEMLEI PAELAE T; NEVALAINEN O.1979; COMPUTER J.; GBR; DA. 1979; VOL. 22; NO 4; PP. 313-316; BIBL. 12 REF.Article

FINDING MINIMAL SPANNING TREES IN A EUCLIDEAN COORDINATE SPACENEVALAINEN O; ERNVALL J; KATAJAINEN J et al.1981; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 1; PP. 46-54; BIBL. 16 REF.Article

A NOTE ON CHARACTER COMPRESSIONNEVALAINEN O; MUURINEN K; RANTALA S et al.1979; ANGEW. INFORMAT.; DEU; DA. 1979; NO 7; PP. 313-318; ABS. GER; BIBL. 11 REF.Article

A two-stage modelling method for compressing binary images by arithmetic codingFRÄNTI, P; NEVALAINEN, O.Computer journal (Print). 1993, Vol 36, Num 7, pp 615-622, issn 0010-4620Article

Optimization of the movements of a component placement machineLEIPALA, T; NEVALAINEN, O.European journal of operational research. 1989, Vol 38, Num 2, pp 167-177, issn 0377-2217Article

Block truncation coding with entropy codingFRÄNTI, P; NEVALAINEN, O.IEEE transactions on communications. 1995, Vol 43, Num 2-4, pp 1677-1685, issn 0090-6778, 3Article

An intermal hybrid sort algorithm revisitedNEVALAINEN, O; RAITA, T.Computer journal (Print). 1992, Vol 35, Num 2, pp 177-183, issn 0010-4620Article

An almost naive algorithm for finding relative neighbourhood graphs in Lp metricsKATAJAINEN, J; NEVALAINEN, O.Informatique théorique et applications (Imprimé). 1987, Vol 21, Num 2, pp 199-215, issn 0988-3754Article

Computing relative neighbourhood graphs in the planeKATAJAINEN, J; NEVALAINEN, O.Pattern recognition. 1986, Vol 19, Num 3, pp 221-228, issn 0031-3203Article

Estimating the length of minimal spanning trees in compression of filesERNVALL, J; NEVALAINEN, O.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 1, pp 19-32, issn 0006-3835Article

Variable quality image compression system based on SPIHTJÄRVI, A; LEHTINEN, J; NEVALAINEN, O et al.Signal processing. Image communication. 1999, Vol 14, Num 9, pp 683-696, issn 0923-5965Article

  • Page / 2