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

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

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

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

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

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

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

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

Tree checking for sparse complexesCABOARA, Massimo; FARIDI, Sara; SELINGER, Peter et al.Lecture notes in computer science. 2006, pp 110-121, issn 0302-9743, isbn 3-540-38084-1, 1Vol, 12 p.Conference Paper

Union-find with constant time deletionsALSTRUP, Stephen; LI GØRTZ, Inge; RAUHE, Theis et al.Lecture notes in computer science. 2005, pp 78-89, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

An improved communication-randomness tradeoffFÜRER, Martin.Lecture notes in computer science. 2004, pp 444-454, issn 0302-9743, isbn 3-540-21258-2, 11 p.Conference Paper

Convex computation of worst case criteria with applications in identification and controlJANSSON, Henrik; HJALMARSSON, Hakan.IEEE Conference on Decision and Control. 2004, isbn 0-7803-8682-5, Vol 3, 3132-3137Conference Paper

Duality relationships for rate-distortion problemsVISHWANATH, Sriram.IEEE Global Telecommunications Conference. 2004, pp 406-409, isbn 0-7803-8794-5, 4 p.Conference Paper

Alternating paths along orthogonal segmentsTOTH, Csaba D.Lecture notes in computer science. 2003, pp 389-400, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

On the quality of partitions based on space-filling curvesHUNGERSHÖFER, Jan; WIERUM, Jens-Michael.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 3, 36-45Conference Paper

Tree pattern matching for linear static termsCHAUVE, Cedric.Lecture notes in computer science. 2002, pp 160-169, issn 0302-9743, isbn 3-540-44158-1, 10 p.Conference Paper

Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental studyDEMETRESCU, Camil; FRIGIONI, Daniele; MARCHETTI-SPACCAMELA, Alberto et al.Lecture notes in computer science. 2001, pp 218-229, issn 0302-9743, isbn 3-540-42512-8Conference Paper

Joint performance of greedy heuristics for the integer knapsack problemRAJEEV KOHLI; RAMESH KRISHNAMURTI.Discrete applied mathematics. 1995, Vol 56, Num 1, pp 37-48, issn 0166-218XArticle

Rapprochement between bounded-error and stochastic estimation theoryNINNESS, B. M; GOODWIN, G. C.International journal of adaptive control and signal processing. 1995, Vol 9, Num 1, pp 107-132, issn 0890-6327Article