An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum widthGLUCHSHENKO, Olga N; HAMACHER, Horst W; TAMIR, Arie et al.Operations research letters. 2009, Vol 37, Num 3, pp 168-170, issn 0167-6377, 3 p.Article

Can a student learn optimally from two different teachers?NEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 1, issn 1751-8113, 015101.1-015101.16Article

A new linear convex hull algorithm for simple polygonsBHATTACHARYA, B. K; ELGINDY, H.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 85-88, issn 0018-9448Article

Optimal algoriths for the intersection and the minimum distance problems between planar polygonsCHIN, F; CAO AN WANG.IEEE transactions on computers. 1983, Vol 32, Num 12, pp 1203-1207, issn 0018-9340Article

Parallel strategy for optimal learning in perceptronsNEIROTTI, J. P.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 12, issn 1751-8113, 125101.1-125101.15Article

Average case optimality for linear problemsTRAUB, J. F; WASILKOWSKI, G. W; WOZNIAKOWSKI, H et al.Theoretical computer science. 1984, Vol 29, Num 1-2, pp 1-25, issn 0304-3975Article

A note on the power of integer divisionVYSKOC, J.Information processing letters. 1983, Vol 17, Num 2, pp 71-72, issn 0020-0190Article

Optimal polygon placement by translationSUDEBKUMAR PRASANT PAL; BHASKAR DASGUPTA; VENI MADHAVAN, C. E et al.International journal of computer mathematics. 1994, Vol 52, Num 3-4, pp 139-148, issn 0020-7160Article

An optimal algorithm for computing a minimum nested nonconvex polygonSUBIR KUMAR GHOSH; ANIL MAHESHWARI.Information processing letters. 1990, Vol 36, Num 6, pp 277-280, issn 0020-0190, 4 p.Article

Optimal constructions of hybrid algorithmsKAO, M.-Y; YUAN MA; SIPSER, M et al.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 142-164, issn 0196-6774Article

Parametric computation of margins and of minimum cumulative register lifetime datesDUPONT DE DINECHIN, B.Lecture notes in computer science. 1997, pp 231-245, issn 0302-9743, isbn 3-540-63091-0Conference Paper

TWOPRIME : A fast stream ciphering algorithmDING, C; NIEMI, V; RENVALL, A et al.Lecture notes in computer science. 1997, pp 88-102, issn 0302-9743, isbn 3-540-63247-6Conference Paper

A correction to 'an optimal algorithm to compute all the covers of a string'MOORE, D; SMYTH, W. F.Information processing letters. 1995, Vol 54, Num 2, pp 101-103, issn 0020-0190Article

Algorithmes optimaux de résolution des problèmes de configuration et de recouvrement des figures polygonales planesNOSOV, L. V; NOSOVA, E. G; RABINOVICH, E. B et al.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 4, pp 28-36, issn 0002-3574Article

Minimum vertex distance between separable convex polygonsCHIN, F; WANG, C. A.Information processing letters. 1984, Vol 18, Num 1, pp 41-45, issn 0020-0190Article

An algorithm for edge-coloring of multigraphsNISHIZEKI, T; SATO, M.Systems, computers, controls. 1984, Vol 15, Num 4, pp 58-63, issn 0096-8765Article

Finding rectangle intersections by divide-and-conquerGÜTING, R. H; WOOD, D.IEEE transactions on computers. 1984, Vol 33, Num 7, pp 671-675, issn 0018-9340Article

Adjudicating a towers of Hanoi contestWOOD, D.International journal of computer mathematics. 1983, Vol 14, Num 3-4, pp 199-207, issn 0020-7160Article

The optimal PAC algorithmWARMUTH, Manfred K.Lecture notes in computer science. 2004, pp 641-642, issn 0302-9743, isbn 3-540-22282-0, 2 p.Conference Paper

Randomized single-target hot-potato routingBEN AROYA, I; NEWMAN, I; SCHUSTER, A et al.Journal of algorithms (Print). 1997, Vol 23, Num 1, pp 101-120, issn 0196-6774Article

X² cryptanalysis of the SEAL encryption algorithmHANDSCHUH, H; GILBERT, H.Lecture notes in computer science. 1997, pp 1-12, issn 0302-9743, isbn 3-540-63247-6Conference Paper

A greedy algorithm to determine the number of transporters in a cyclic electroplating processARMSTRONG, R; GU, S; LEI, L et al.INRIA / IEEE symposium on emerging technologies and factories automation. 1995, pp 460-474, isbn 0-7803-2535-4, 3VolConference Paper

Measures of presortedness and optimal sorting algorithmsMANNILA, H.IEEE transactions on computers. 1985, Vol 34, Num 4, pp 318-325, issn 0018-9340Article

The power of geometric duality revisitedLEE, D. T; CHING, Y. T.Information processing letters. 1985, Vol 21, Num 3, pp 117-122, issn 0020-0190Article

Sur les algorithmes optimaux de commande adaptativeNEMIROVSKIJ, A. S; TSYPKIN, YA. Z.Avtomatika i telemehanika. 1984, Num 12, pp 64-77, issn 0005-2310Article