Two-Tier Relaxed HeapsELMASRY, Amr; JENSEN, Claus; KATAJAINEN, Jyrki et al.Lecture notes in computer science. 2006, pp 308-317, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Estimation of the likelihood of capacitive coupling noiseVRUDHULA, Sarma B. K; BLAAUW, David; SIRICHOTIYAKUL, Supamas et al.Design automation conference. 2002, pp 646-651, isbn 1-58113-461-4, 6 p.Conference Paper

Realistic worst-case parameters for circuit simulationTUOHY, P; GRIBBEN, A; WALTON, A. J et al.IEE proceedings. Part I. Solid-state and electron devices. 1987, Vol 134, Num 5, pp 137-140, issn 0143-7100Article

The worst case permutation for median-of-three quicksortERKIO, H.Computer journal (Print). 1984, Vol 27, Num 3, pp 276-277, issn 0010-4620Article

Fast In-place integer radix sortingEL-AKER, Fouad.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part III, 788-791Conference Paper

Creating better abstract operatorsTEUTENBERG, Jonathan; BARLEY, Mike.Lecture notes in computer science. 2005, pp 206-217, issn 0302-9743, isbn 3-540-27872-9, 12 p.Conference Paper

Timed pattern generation for noise-on-delay calculationSEUNG HOON CHOI; DARTU, Florentin; ROY, Kaushik et al.Design automation conference. 2002, pp 870-873, isbn 1-58113-461-4, 4 p.Conference Paper

Reduction of the Search Space in the Edge-Tracing Algorithm for the Voronoi Diagram of 3D BallsCHO, Youngsong; KIM, Donguk; HYUN CHAN LEE et al.Lecture notes in computer science. 2006, pp 111-120, issn 0302-9743, isbn 3-540-34070-X, 10 p.Conference Paper

Computing the diameter of a point setMALANDAIN, Grégoire; BOISSONNAT, Jean-Daniel.Lecture notes in computer science. 2002, pp 197-208, issn 0302-9743, isbn 3-540-43380-5Conference Paper

Casting an Object with a CoreAHN, Hee-Kap; SANG WON BAE; CHENG, Siu-Wing et al.Algorithmica. 2009, Vol 54, Num 1, pp 72-88, issn 0178-4617, 17 p.Article

Error-correcting codes against the worst-case partial-band jammerMA, H. H; POOLE, M. A.IEEE transactions on communications. 1984, Vol 32, Num 2, pp 124-133, issn 0090-6778Article

Adaptive raising strategies optimizing relative efficiencySCHÖNHAGE, Arnold.Lecture notes in computer science. 2003, pp 611-623, issn 0302-9743, isbn 3-540-40493-7, 13 p.Conference Paper

Generation of well-formed parenthesis strings in constant worst-case timeWALSH, T. R.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 165-173, issn 0196-6774Article

Casting an object with a coreAHN, Hee-Kap; SANG WON BAE; CHENG, Siu-Wing et al.Lecture notes in computer science. 2005, pp 40-49, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Worst-case choice for the stable marriage problemDEEPAK KAPUR; KRISHNAMOORTHY, M. S.Information processing letters. 1985, Vol 21, Num 1, pp 27-30, issn 0020-0190Article

Scheduling independent tasks on uniform processorsDOBSON, G.SIAM journal on computing (Print). 1984, Vol 13, Num 4, pp 705-716, issn 0097-5397Article

Worst-case analysis of set union algorithmsTARJAN, R. E; VAN LEEUWEN, J.Journal of the Association for Computing Machinery. 1984, Vol 31, Num 2, pp 245-281, issn 0004-5411Article

Worst case analysis of resistive networks using linear programming approachELWAKKAD ZAGHLOUL, M.Journal of the Franklin Institute. 1983, Vol 316, Num 4, pp 339-351, issn 0016-0032Article

Individual communication complexityBUHRMAN, Harry; KLAUCK, Hartmut; VERESHCHAGIN, Nikolai et al.Lecture notes in computer science. 2004, pp 19-30, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Binary space partition for orthogonal fat rectanglesTOTH, Csaba D.Lecture notes in computer science. 2003, pp 494-505, issn 0302-9743, isbn 3-540-20064-9, 12 p.Conference Paper

Reconfiguring arrays with faults. Part I: Worst-case faultsCOLE, R. J; MAGGS, B. M; SITARAMAN, R. K et al.SIAM journal on computing (Print). 1997, Vol 26, Num 6, pp 1581-1611, issn 0097-5397Article

Average and worst-case performance of Paull's algorithms for rearranging three-stage connection networksKUBALE, M.Annales des télécommunications. 1985, Vol 40, Num 5-6, pp 270-276, issn 0003-4347Article

A storage-size selection problemFRIESEN, D. K; LANGSTON, M. A.Information processing letters. 1984, Vol 18, Num 5, pp 295-296, issn 0020-0190Article

A simple on-line bin-packing algorithmLEE, C. C; LEE, D. T.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 562-572, issn 0004-5411Article

SUT: Quantifying and mitigating URL typosquattingBANERJEE, Anirban; SAZZADUR RAHMAN, Md; FALOUTSOS, Michalis et al.Computer networks (1999). 2011, Vol 55, Num 13, pp 3001-3014, issn 1389-1286, 14 p.Article