CENTRAL SYMMETRY IN WORST CASE ESTIMATIONWITSENHAUSEN HS.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 5; PP. 661-662; BIBL. 9 REF.Serial Issue

MINIMIZING THE WORST-CASE DISTORTION IN CHANNEL SPLITTINGWITSENHAUSEN HS.1981; BELL SYST. TECH. J.; ISSN 0005-8580; USA; DA. 1981; VOL. 60; NO 8; PP. 1979-1983; BIBL. 4 REF.Article

WORST-CASE ANALYSIS OF MEMORY ALLOCATION ALGORITHMSGAREY MR; GRAHAM RL; ULLMAN JD et al.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 143-150; BIBL. 7 REF.Conference Paper

VIELD MAXIMIZATION AND WORST-CASE DESIGN WITH ARBITRARY STATISTICAL DISTRIBUTIONSBRAYTON RK; DIRECTOR SW; HACHTEL GD et al.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 9; PP. 756-764; BIBL. 11 REF.Article

TRUE WORST-CASE ANALYSIS OF LINEAR ELECTRICAL CIRCUITS BY INTERVAL ARITHMETICSKELBOE S.1979; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1979; VOL. 26; NO 10; PP. 874-879; BIBL. 11 REF.Article

WORST-CASE TOLERANCE OPTIMIZATION OF ANTENNA SYSTEMSSCHJAER JACOBSEN H.1980; I.E.E.E. TRANS. ANTENNAS PROPAG.; USA; DA. 1980; VOL. 28; NO 2; PP. 247-250; BIBL. 13 REF.Article

AN INTERACTIVE LINEAR PROGRAMMING APPROACH TO MODEL PARAMETER FITTING AND WORST CASE CIRCUIT DESIGNHACHTEL GD; SCOTT TR; ZUG RP et al.1980; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1980; VOL. 27; NO 10; PP. 871-881; BIBL. 24 REF.Article

NONPREEMPTIVE LP-SCHEDULING ON HOMOGENEOUS MULTIPROCESSOR SYSTEMSKUNDE M.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 151-173; BIBL. 17 REF.Article

OPTIMAL CENTERING, TOLERANCING, AND YIELD DETERMINATION VIA UPDATED APPROXIMATIONS AND CUTSBANDLER JW; ABDEL MALEK HL.1978; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1978; VOL. 25; NO 10; PP. 853-871; BIBL. 19 REF.Article

BOUNDS ON THE SCHEDULING OF TYPED TASK SYSTEMSJAFFE JM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 541-551; BIBL. 18 REF.Article

NEW UPPER BOUNDS FOR SELECTION.YAP CK.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 9; PP. 501-508; BIBL. 23 REF.Article

WORST CASE ANALYSIS OF A CLASS OF SET COVERING HEURISTICSHO AC.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 23; NO 2; PP. 170-180; BIBL. 6 REF.Article

A MODIFIED OBJECTIVE FUNCTION AND A FAST ALGORITHM FOR DESIGN CENTERINGAGNEW D.1982; IEE PROC., G; ISSN 0143-7089; GBR; DA. 1982; VOL. 129; NO 4; PP. 110-114; BIBL. 12 REF.Article

A WORST-CASE ANALYSIS OF NEAREST NEIGHBOR SEARCHING BY PROJECTIONPAPADIMITRIOU CH; BENTLEY JL.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 470-482; BIBL. 13 REF.Conference Paper

TOLERANCE ASSIGNMENT IN LINEAR NETWORKS USING NONLINEAR PROGRAMMING = ASSIGNATION DE TOLERANCE DANS LES RESEAUX LINEAIRES UTILISANT LA PROGRAMMATION NON LINEAIREPINEL JF; ROBERTS KA.1972; I.E.E.E. TRANS. CIRCUIT THEORY; U.S.A.; DA. 1972; VOL. 19; NO 5; PP. 475-479; BIBL. 10 REF.Serial Issue

ON WORST CASE INTERFERENCE FOR M-ARY SIGNALING WITH CORRELATION RECEIVERSMORRIS JM.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 1; PP. 74-83; BIBL. 20 REF.Article

BOUNDS ON SCHEDULES FOR INDEPENDENT TASKS WITH SIMILAR EXECUTION TIMESACHUGBUE JO; CHIN FY.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 81-99; BIBL. 6 REF.Article

WORST-CASE COMPLEXITY BOUNDS FOR ALGORITHMS IN THE THEORY OF INTEGRAL QUADRATIC FORMSLAGARIAS JC.1980; J. ALGORITHMS; USA; DA. 1980; VOL. 1; NO 2; PP. 142-186; BIBL. 35 REF.Article

EXACT CALCULATION OF THE UNCERTAINTY ON THE INPUT REFLECTION COEFFICIENT OF ARBITRARY TWO PORTS DUE TO MISMATCHES AND ARTIBRARY REFERENCE PLANESTROMP H.1978; I.E.E.E. TRANS. MICROWAVE THEORY TECH.; USA; DA. 1978; VOL. 26; NO 12; PP. 973-978; BIBL. 6 REF.Article

AN APPLICATION OF BIN-PACKING TO MULTIPROCESSOR SCHEDULING.COFFMAN EG JR; GARVEY MR; JOHNSON DS et al.1978; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1978; VOL. 7; NO 1; PP. 1-17; BIBL. 8 REF.Article

EXPECTED LENGTH OF THE LONGEST PROBE SEQUENCE IN HASH CODE SEARCHINGGONNET GH.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 2; PP. 289-304; BIBL. 16 REF.Article

Hat Guessing GamesBUTLER, Steve; HAJIAGHAYI, Mohammad T; KLEINBERG, Robert D et al.SIAM review (Print). 2009, Vol 51, Num 2, pp 399-413, issn 0036-1445, 15 p.Article

A 3-approximation algorithm for two-dimensional bin packingGUOCHUAN ZHANG.Operations research letters. 2005, Vol 33, Num 2, pp 121-126, issn 0167-6377, 6 p.Article

HAT GUESSING GAMESBUTLER, Steve; HAJIAGHAYI, Mohammad T; KLEINBERG, Robert D et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 592-605, issn 0895-4801, 14 p.Article

Deux semaines pour dix chambres froides = Two weeks for ten cold roomsRevue pratique du froid et du conditionnement d'air. 1999, Num 864, pp 30-31, issn 0370-6699Article