Reinforcement LearningKOSTAS, Stathis; D'AVILA GARCEZ, Artur; GIVAN, Robert et al.Journal of algorithms (Print). 2009, Vol 64, Num 4, issn 0196-6774, 68 p.Serial Issue

Intensional dynamic programming. A Rosetta stone for structured dynamic programmingVAN OTTERLO, Martijn.Journal of algorithms (Print). 2009, Vol 64, Num 4, pp 169-191, issn 0196-6774, 23 p.Article

Objective Bayesian probabilistic logicWILLIAMSON, Jon.Journal of algorithms (Print). 2008, Vol 63, Num 4, pp 167-183, issn 0196-6774, 17 p.Article

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest pathsBASWANA, Surender; HARIHARAN, Ramesh; SEN, Sandeep et al.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 74-92, issn 0196-6774, 19 p.Article

A linear time approximation scheme for the single machine scheduling problem with controllable processing timesMASTROLILLI, Monaldo.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 37-52, issn 0196-6774, 16 p.Article

Algorithms for non-uniform size data placement on parallel disksKASHYAP, Srinivas; KHULLER, Samir.Journal of algorithms (Print). 2006, Vol 60, Num 2, pp 144-167, issn 0196-6774, 24 p.Article

Efficient algorithms for a constrained k-tree core problem in a tree networkWANG, Biing-Feng; SHIETUNG PENG; YU, Hong-Yi et al.Journal of algorithms (Print). 2006, Vol 59, Num 2, pp 107-124, issn 0196-6774, 18 p.Article

Graph minimum linear arrangement by multilevel weighted edge contractionsSAFRO, Ilya; RON, Dorit; BRANDT, Achi et al.Journal of algorithms (Print). 2006, Vol 60, Num 1, pp 24-41, issn 0196-6774, 18 p.Article

Maintaining time-decaying stream aggregatesCOHEN, Edith; STRAUSS, Martin J.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 19-36, issn 0196-6774, 18 p.Article

Polynomial time recognition of unit circular-arc graphsDURAN, Guillermo; GRAVANO, Agustin; MCCONNELL, Ross M et al.Journal of algorithms (Print). 2006, Vol 58, Num 1, pp 67-78, issn 0196-6774, 12 p.Article

Posted price profit maximization for multicast by approximating fixed pointsMEHTA, Aranyak; SHENKER, Scott; VAZIRANI, Vijay V et al.Journal of algorithms (Print). 2006, Vol 58, Num 2, pp 150-164, issn 0196-6774, 15 p.Article

Complexity of preemptive minsum scheduling on unrelated parallel machinesSITTERS, René.Journal of algorithms (Print). 2005, Vol 57, Num 1, pp 37-48, issn 0196-6774, 12 p.Article

Cutwidth I : A linear time fixed parameter algorithmTHILIKOS, Dimitrios M; SEMA, Maria; BODLAENDER, Hans L et al.Journal of algorithms (Print). 2005, Vol 56, Num 1, pp 1-24, issn 0196-6774, 24 p.Article

Estimating the maximumGUM, Ben; LIPTON, Richard J; LAPAUGH, Andrea et al.Journal of algorithms (Print). 2005, Vol 54, Num 1, pp 105-114, issn 0196-6774, 10 p.Article

Simple constant amortized time generation of fixed length numeric partitionsBOYER, John M.Journal of algorithms (Print). 2005, Vol 54, Num 1, pp 31-39, issn 0196-6774, 9 p.Article

Detecting tetrahedralizations of a set of line segmentsBOTING YANG; CAO AN WANG.Journal of algorithms (Print). 2004, Vol 53, Num 1, pp 1-35, issn 0196-6774, 35 p.Article

Minimizing end-to-end delay in high-speed networks with a simple coordinated scheduleANDREWS, Matthew; ZHANG, Lisa.Journal of algorithms (Print). 2004, Vol 52, Num 1, pp 57-81, issn 0196-6774, 25 p.Article

Parameterized self-adjusting heapsELMASRY, Amr.Journal of algorithms (Print). 2004, Vol 52, Num 2, pp 103-119, issn 0196-6774, 17 p.Article

Strong bias of group generators: an obstacle to the product replacement algorithmBABAI, Laszlo; PAK, Igor.Journal of algorithms (Print). 2004, Vol 50, Num 2, pp 215-231, issn 0196-6774, 17 p.Conference Paper

Construction of linear tree-layouts which are optimal with respect to vertex separation in linear timeSKODINIS, Konstantin.Journal of algorithms (Print). 2003, Vol 47, Num 1, pp 40-59, issn 0196-6774, 20 p.Article

Expected search duration for finite backtracking adaptive searchALEXANDER, D. L. J; BULGER, D. W; WOOD, G. R et al.Journal of algorithms (Print). 2003, Vol 47, Num 2, pp 78-86, issn 0196-6774, 9 p.Article

Largest empty rectangle among a point setCHAUDHURI, Jeet; NANDY, Subhas C; DAS, Sandip et al.Journal of algorithms (Print). 2003, Vol 46, Num 1, pp 54-78, issn 0196-6774, 25 p.Article

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutationTSABAN, Boaz.Journal of algorithms (Print). 2003, Vol 47, Num 2, pp 104-121, issn 0196-6774, 18 p.Article

Compact floor-planning via orderly spanning treesLIAO, Chien-Chih; LU, Hsueh-I; YEN, Hsu-Chun et al.Journal of algorithms (Print). 2003, Vol 48, Num 2, pp 441-451, issn 0196-6774, 11 p.Article

Finding an optimal path without growing the treeCHEN, Danny Z; DAESCU, Ovidiu; XIAOBO HU et al.Journal of algorithms (Print). 2003, Vol 49, Num 1, pp 13-41, issn 0196-6774, 29 p.Conference Paper