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

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

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

The summary abox : Cutting ontologies down to sizeFOKOUE, Achille; KERSHENBAUM, Aaron; LI MA et al.Lecture notes in computer science. 2006, pp 343-356, issn 0302-9743, isbn 3-540-49029-9, 1Vol, 14 p.Conference Paper

Efficient algorithms for the weighted 2-center problem in a cactus graphBEN-MOSHE, Boaz; BHATTACHARYA, Binay; QIAOSHENG SHI et al.Lecture notes in computer science. 2005, pp 693-703, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 11 p.Conference Paper

A lower bound on the competitive ratio of truthful auctionsGOLDBERG, Andrew V; HARTLINE, Jason D; KARLIN, Anna R et al.Lecture notes in computer science. 2004, pp 644-655, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Efficient pebbling for list traversal synopsesMATIAS, Yossi; PORAT, Ely.Lecture notes in computer science. 2003, pp 918-928, issn 0302-9743, isbn 3-540-40493-7, 11 p.Conference Paper

An improved algorithm of multicast topology inference from end-to-end measurementsTIAN, Hui; SHEN, Hong.Lecture notes in computer science. 2003, pp 376-384, issn 0302-9743, isbn 3-540-20359-1, 9 p.Conference Paper

An efficient bounds consistency algorithm for the global cardinality constraintQUIMPER, Claude-Guy; VAN BEEK, Peter; LOPEZ-ORTIZ, Alejandro et al.Lecture notes in computer science. 2003, pp 600-614, issn 0302-9743, isbn 3-540-20202-1, 15 p.Conference Paper

A lower bound for cake cuttingSGALL, Jiri; WOEGINGER, Gerhard J.Lecture notes in computer science. 2003, pp 459-469, issn 0302-9743, isbn 3-540-20064-9, 11 p.Conference Paper

Preemptive scheduling with rejectionHOOGEVEEN, H; SKUTELLA, M; WOEGINGER, G. J et al.Lecture notes in computer science. 2000, pp 268-277, issn 0302-9743, isbn 3-540-41004-XConference Paper

A simple semi on-line algorithm for P2//C_max with a bufferZHANG, G.Information processing letters. 1997, Vol 61, Num 3, pp 145-148, issn 0020-0190Article

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing timesNOWICKI, E.European journal of operational research. 1994, Vol 72, Num 1, pp 74-81, issn 0377-2217Article

On the message complexity of distributed problemsSANTORO, N.International journal of computer & information sciences. 1984, Vol 13, Num 3, pp 131-147, issn 0091-7036Article

How many experiments are-needed to adapt?BITTANTI, Sergio; CAMPI, Marco C; PRANDINI, Maria et al.Lecture notes in control and information sciences. 2007, pp 5-14, issn 0170-8643, isbn 978-3-540-73569-4, 10 p.Conference Paper