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

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

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

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

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

A 4-approximation algorithm for guarding 1.5-dimensional terrainsKING, James.Lecture notes in computer science. 2006, pp 629-640, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Complexity of continuous space machine operationsWOODS, Damien; GIBSON, J. Paul.Lecture notes in computer science. 2005, pp 540-551, issn 0302-9743, isbn 3-540-26179-6, 12 p.Conference Paper

Incremental learning of temporal sequences using state memory and a resource allocating networkKONISHI, Yoshio; FUJII, Robert H.International Joint Conference on Neural Networks. 2004, isbn 0-7803-8359-1, 4Vol, Vol4, 2889-2893Conference Paper

Proposal-based negotiation in convex regionsCADOLI, Marco.Lecture notes in computer science. 2003, pp 93-108, issn 0302-9743, isbn 3-540-40798-7, 16 p.Conference Paper

Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulaeRINTANEN, Jussi.Lecture notes in computer science. 2001, pp 362-376, issn 0302-9743, isbn 3-540-42957-3Conference Paper

Efficient numerical integration using Gaussian quadraturePLACE, J; STACH, J.Simulation (San Diego, Calif.). 1999, Vol 73, Num 4, pp 232-238, issn 0037-5497Article