A discussion of a report by Ehud ShapiroBANERJI, R. B.Computational intelligence. 1987, Vol 3, Num 4, pp 295-303, issn 0824-7935Article

Automatic extraction of approximate repetitions in polyphonic midi files based on perceptive criteriaMEUDIC, Benoit; ST-JAMES, Emmanuel.Lecture notes in computer science. 2004, pp 124-142, issn 0302-9743, isbn 3-540-20922-0, 19 p.Conference Paper

The convergence span of greedy load balancingCOHEN, E.Information processing letters. 1994, Vol 52, Num 4, pp 181-182, issn 0020-0190Article

Approximating the tree and tour covers of a graphARKIN, E. M; HALLDORSSON, M. M; HASSIN, R et al.Information processing letters. 1993, Vol 47, Num 6, pp 275-282, issn 0020-0190Article

Smoothness and factoring polynomials over finite fieldsSHOUP, V.Information processing letters. 1991, Vol 38, Num 1, pp 39-42, issn 0020-0190Article

A new color change to improve the coloring of a graphBERGE, C.Discrete applied mathematics. 1989, Vol 24, Num 1-3, pp 25-28, issn 0166-218XArticle

An algorithm for determining the simplicity of a modular group representationMICHLER, G. O.Journal of symbolic computation. 1988, Vol 6, Num 1, pp 105-111, issn 0747-7171Article

The word problem for free partially commutative groupsWRATHALL, C.Journal of symbolic computation. 1988, Vol 6, Num 1, pp 99-104, issn 0747-7171Article

Exact balancing is not always goodSNIR, M.Information processing letters. 1986, Vol 22, Num 2, pp 97-102, issn 0020-0190Article

Approximate counting : a martingale approachROSENKRANTZ, Walter A.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 508. 1986, 1 p.Report

On an on-line scheduling problem for parallel jobsNAROSKA, Edwin; SCHWIEGELSHOHN, Uwe.Information processing letters. 2002, Vol 81, Num 6, pp 297-304, issn 0020-0190Article

Comparison of signature file models with superimposed codingDERVOS, D; MANOLOPOULOS, Y; LINARDIS, P et al.Information processing letters. 1998, Vol 65, Num 2, pp 101-106, issn 0020-0190Article

Off-line algorithms for the list update problemREINGOLD, N; WESTBROOK, J.Information processing letters. 1996, Vol 60, Num 2, pp 75-80, issn 0020-0190Article

Randomized algorithms for the on-line minimum matching problem on Euclidean spaceYING TEH TSAI; CHUAN YI TANG; YUNN YEN CHEN et al.International journal of computer mathematics. 1995, Vol 58, Num 1-2, pp 19-32, issn 0020-7160Article

The cover time of a regular expander is O(n log n)RUBINFELD, R.Information processing letters. 1990, Vol 35, Num 1, pp 49-51, issn 0020-0190Article

A balanced bin sort of hypercube multicomputersYOUNGJU WON; SARTAJ SAHNI.Journal of supercomputing. 1988, Vol 2, Num 4, pp 435-448, issn 0920-8542Article

A note on the higher moments of the expected behavior of straight insertion sortPANNY, W.Information processing letters. 1986, Vol 22, Num 4, pp 175-177, issn 0020-0190Article

An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communicationGRABNER, P. J; PRODINGER, H.Information processing letters. 1998, Vol 65, Num 2, pp 89-93, issn 0020-0190Article

On a cyclic string-to-string correction problemMAES, M.Information processing letters. 1990, Vol 35, Num 2, pp 73-78, issn 0020-0190Article

On a possible classification of real-time constructed sequencesBLEUZEN-GUERNALEC, N.Theoretical computer science. 1989, Vol 65, Num 2, pp 143-148, issn 0304-3975Article

Analysis of a hybrid algorithm for packing unequal binsFRIESSEN, D. K; KUHL, F. S.SIAM journal on computing (Print). 1988, Vol 17, Num 1, pp 23-40, issn 0097-5397Article

Lifting canonical algorithms from a ring R to the ring R[x]SHTOKHAMER, R.Journal of symbolic computation. 1988, Vol 6, Num 2-3, pp 169-181, issn 0747-7171Article

The Boyer-Moore-Galil string searching strategies revisitedAPOSTOLICO, A; GIANCARLO, R.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 98-105, issn 0097-5397Article

Matching nuts and bolts fasterALON, N; BRADFORD, P. G; FLEISCHER, R et al.Information processing letters. 1996, Vol 59, Num 3, pp 123-127, issn 0020-0190Article

Mathematical analysis of algorithmsPRODINGER, Helmut; SZPANKOWSKI, Wojciech.Theoretical computer science. 1995, Vol 144, Num 1-2, issn 0304-3975, 316 p.Serial Issue