| Anytime AND/OR depth-first search for combinatorial optimization L Otten, R Dechter Ai Communications 25 (3), 211-227, 2012 | 65 | 2012 |
| A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees M Silberstein, O Weissbrod, L Otten, A Tzemach, A Anisenia, O Shtark, ... Bioinformatics 29 (2), 197-205, 2013 | 58 | 2013 |
| Join-graph based cost-shifting schemes AT Ihler, N Flerova, R Dechter, L Otten arXiv preprint arXiv:1210.4878, 2012 | 55 | 2012 |
| Pushing the power of stochastic greedy ordering schemes for inference in graphical models K Kask, A Gelfand, L Otten, R Dechter Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 54-60, 2011 | 52 | 2011 |
| Predicting the size of depth-first branch and bound search trees. LHS Lelis, L Otten, R Dechter IJCAI, 594-600, 2013 | 33 | 2013 |
| Winning the pascal 2011 map challenge with enhanced and/or branch-and-bound L Otten, A Ihler, K Kask, R Dechter Workshop on DISCML 2012 (a workshop of NIPS 2012), 2012 | 23 | 2012 |
| A case study in complexity estimation: Towards parallel branch-and-bound over graphical models L Otten, R Dechter arXiv preprint arXiv:1210.4885, 2012 | 16 | 2012 |
| Toward parallel search for optimization in graphical models. L Otten, R Dechter ISAIM, 2010 | 15 | 2010 |
| Results from the Probablistic Inference Evaluation of UAI’08 A Darwiche, R Dechter, A Choi, V Gogate, L Otten UAI Applications Workshop, 2008 | 13 | 2008 |
| Randomization in constraint programming for airline planning L Otten, M Grönkvist, D Dubhashi International Conference on Principles and Practice of Constraint …, 2006 | 12 | 2006 |
| AND/OR branch-and-bound on a computational grid L Otten, R Dechter Journal of Artificial Intelligence Research 59, 351-435, 2017 | 11 | 2017 |
| Memory-efficient tree size prediction for depth-first search in graphical models LHS Lelis, L Otten, R Dechter Principles and Practice of Constraint Programming: 20th International …, 2014 | 10 | 2014 |
| Mini-bucket elimination with moment matching N Flerova, A Ihler, R Dechter, L Otten NIPS Workshop DISCML, 2011 | 9 | 2011 |
| Bounding search space size via (hyper) tree decompositions L Otten, R Dechter arXiv preprint arXiv:1206.3284, 2012 | 7 | 2012 |
| On the practical significance of hypertree vs. treewidth R Dechter, L Otten, R Marinescu ECAI 2008, 913-914, 2008 | 7 | 2008 |
| Finding most likely haplotypes in general pedigrees through parallel search with dynamic load balancing L Otten, R Dechter Biocomputing 2011, 26-37, 2011 | 5 | 2011 |
| Load balancing for parallel branch and bound L Otten, R Dechter 10th Workshop on Preferences and Soft Constraints, 51-65, 2010 | 5 | 2010 |
| Refined bounds for instance-based search complexity of counting and other# P problems L Otten, R Dechter International Conference on Principles and Practice of Constraint …, 2008 | 5 | 2008 |
| Advances in distributed branch and bound L Otten, R Dechter ECAI 2012, 917-918, 2012 | 2 | 2012 |
| Caching in context-minimal or spaces R Dechter, L Lelis, L Otten Proceedings of the International Symposium on Combinatorial Search 6 (1 …, 2015 | 1 | 2015 |
