| 2025 | AISTATS | Graph-based Complexity for Causal Effect by Empirical Plug-in. | Rina Dechter, Anna Raichev, Jin Tian, Alexander Ihler |
| 2024 | AISTATS | Surrogate Bayesian Networks for Approximating Evolutionary Games. | Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter |
| 2024 | ECAI | Estimating Causal Effects from Learned Causal Networks. | Anna Raichev, Jin Tian, Alexander Ihler, Rina Dechter |
| 2024 | UAI | Value-Based Abstraction Functions for Abstraction Sampling. | Bobak Pezeshki, Kalev Kask, Alexander Ihler, Rina Dechter |
| 2023 | UAI | Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. | Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2022 | AISTATS | Fast Fourier Transform Reductions for Bayesian Network Inference. | Vincent Hsiao, Dana S. Nau, Rina Dechter |
| 2022 | UAI | NeuroBE: Escalating neural network approximations of Bucket Elimination. | Sakshi Agarwal, Kalev Kask, Alexander Ihler, Rina Dechter |
| 2022 | UAI | AND/OR branch-and-bound for computational protein design optimizing K. | Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2021 | AAAI | Submodel Decomposition Bounds for Influence Diagrams. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2021 | AAAI | A New Bounding Scheme for Influence Diagrams. | Radu Marinescu, Junkyu Lee, Rina Dechter |
| 2021 | IJCAI | Deep Bucket Elimination. | Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter |
| 2020 | IJCAI | Scaling Up AND/OR Abstraction Sampling. | Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter |
| 2020 | SoCS | Heuristic AND/OR Search for Solving Influence Diagram. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2019 | AAAI | Anytime Recursive Best-First Search for Bounding Marginal MAP. | Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler |
| 2019 | AAAI | Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. | Qi Lou, Rina Dechter, Alexander Ihler |
| 2019 | UAI | A Weighted Mini-Bucket Bound for Solving Influence Diagram. | Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter |
| 2018 | AAAI | Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. | Junkyu Lee, Alexander Ihler, Rina Dechter |
| 2018 | AAAI | Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. | Qi Lou, Rina Dechter, Alexander Ihler |
| 2018 | IJCAI | Stochastic Anytime Search for Bounding Marginal MAP. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2018 | UAI | Abstraction Sampling in Graphical Models. | Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask |
| 2018 | UAI | Join Graph Decomposition Bounds for Influence Diagrams. | Junkyu Lee, Alexander Ihler, Rina Dechter |
| 2018 | UAI | Finite-sample Bounds for Marginal MAP. | Qi Lou, Rina Dechter, Alexander Ihler |
| 2017 | AAAI | Anytime Best+Depth-First Search for Bounding Marginal MAP. | Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter |
| 2017 | AAAI | Anytime Anyspace AND/OR Search for Bounding the Partition Function. | Qi Lou, Rina Dechter, Alexander Ihler |
| 2016 | AAAI | Look-Ahead with Mini-Bucket Heuristics for MPE. | Rina Dechter, Kalev Kask, William Lam, Javier Larrosa |
| 2016 | AAAI | From Exact to Anytime Solutions for Marginal MAP. | Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2016 | ECAI | On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. | William Lam, Kalev Kask, Rina Dechter, Javier Larrosa |
| 2016 | IJCAI | Probabilistic Inference Modulo Theories. | Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter |
| 2016 | IJCAI | Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. | Javier Larrosa, Emma Rollon, Rina Dechter |
| 2016 | ISAIM | Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2015 | IJCAI | Pushing Forward Marginal MAP with Best-First Search. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2015 | SoCS | Caching in Context-Minimal OR Spaces. | Rina Dechter, Levi H. S. Lelis, Lars Otten |
| 2015 | SoCS | Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. | William Lam, Kalev Kask, Rina Dechter |
| 2014 | AAAI | Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. | Junkyu Lee, Radu Marinescu, Rina Dechter |
| 2014 | CP | Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. | Levi H. S. Lelis, Lars Otten, Rina Dechter |
| 2014 | CP | Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). | Lars Otten, Rina Dechter |
| 2014 | ISAIM | Weighted Best First Search for Graphical Models. | Natalia Flerova, Radu Marinescu, Rina Dechter |
| 2014 | UAI | AND/OR Search for Marginal MAP. | Radu Marinescu, Rina Dechter, Alexander Ihler |
| 2014 | SoCS | Evaluating Weighted DFS Branch and Bound over Graphical Models. | Natalia Flerova, Radu Marinescu, Rina Dechter |
| 2014 | SoCS | Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. | William Lam, Kalev Kask, Rina Dechter, Alexander Ihler |
| 2014 | SoCS | STLS: Cycle-Cutset-Driven Local Search For MPE. | Alon Milchgrub, Rina Dechter |
| 2013 | IJCAI | Predicting the Size of Depth-First Branch and Bound Search Trees. | Levi H. S. Lelis, Lars Otten, Rina Dechter |
| 2013 | IJCAI | Semiring-Based Mini-Bucket Partitioning Schemes. | Emma Rollon, Javier Larrosa, Rina Dechter |
| 2012 | AAAI | Search Algorithms for m Best Solutions for Graphical Models. | Rina Dechter, Natalia Flerova, Radu Marinescu |
| 2012 | ECAI | Advances in Distributed Branch and Bound. | Lars Otten, Rina Dechter |
| 2012 | UAI | Join-graph based cost-shifting schemes. | Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten |
| 2012 | UAI | A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. | Lars Otten, Rina Dechter |
| 2011 | AAAI | Stopping Rules for Randomized Greedy Triangulation Schemes. | Andrew Gelfand, Kalev Kask, Rina Dechter |
| 2011 | AAAI | Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. | Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter |
| 2011 | PSB | Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. | Lars Otten, Rina Dechter |
| 2011 | SoCS | Anytime AND/OR Depth-First Search for Combinatorial Optimization. | Lars Otten, Rina Dechter |
| 2010 | AAAI | New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. | Emma Rollon, Rina Dechter |
| 2010 | ISAIM | Toward parallel search for optimization in graphical models. | Lars Otten, Rina Dechter |
| 2010 | ISAIM | Evaluating partition strategies for mini-bucket elimination. | Emma Rollon, Rina Dechter |
| 2010 | UAI | BEEM : Bucket Elimination with External Memory. | Kalev Kask, Rina Dechter, Andrew Gelfand |
| 2008 | AAAI | Studies in Solution Sampling. | Vibhav Gogate, Rina Dechter |
| 2008 | CP | Approximate Solution Sampling (and Counting) on AND/OR Spaces. | Vibhav Gogate, Rina Dechter |
| 2008 | CP | Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. | Lars Otten, Rina Dechter |
| 2008 | ECAI | On the Practical Significance of Hypertree vs. TreeWidth. | Rina Dechter, Lars Otten, Radu Marinescu |
| 2008 | UAI | Evaluating probabilistic reasoning systems. | Adnan Darwiche, Rina Dechter |
| 2008 | UAI | AND/OR Importance Sampling. | Vibhav Gogate, Rina Dechter |
| 2008 | UAI | Bounding Search Space Size via (Hyper)tree Decompositions. | Lars Otten, Rina Dechter |
| 2007 | AAAI | Approximate Counting by Sampling the Backtrack-free Search Space. | Vibhav Gogate, Rina Dechter |
| 2007 | AAAI | Best-First AND/OR Search for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2007 | CP | AND/OR Multi-valued Decision Diagrams for Constraint Optimization. | Robert Mateescu, Radu Marinescu, Rina Dechter |
| 2007 | CPAIOR | Best-First AND/OR Search for 0/1 Integer Programming. | Radu Marinescu, Rina Dechter |
| 2007 | IJCAI | A Comparison of Time-Space Schemes for Graphical Models. | Robert Mateescu, Rina Dechter |
| 2007 | UAI | Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. | Vibhav Gogate, Bozhena Bidyuk, Rina Dechter |
| 2007 | UAI | Best-First AND/OR Search for Most Probable Explanations. | Radu Marinescu, Rina Dechter |
| 2007 | UAI | AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. | Robert Mateescu, Rina Dechter |
| 2006 | AAAI | An Anytime Scheme for Bounding Posterior Beliefs. | Bozhena Bidyuk, Rina Dechter |
| 2006 | AAAI | Memory Intensive Branch-and-Bound Search for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2006 | CP | A New Algorithm for Sampling CSP Solutions Uniformly at Random. | Vibhav Gogate, Rina Dechter |
| 2006 | CP | Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). | Robert Mateescu, Rina Dechter |
| 2006 | CPAIOR | AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. | Radu Marinescu, Rina Dechter |
| 2006 | ECAI | Improving Bound Propagation. | Bozhena Bidyuk, Rina Dechter |
| 2006 | ECAI | Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. | Radu Marinescu, Rina Dechter |
| 2006 | UAI | Cutset Sampling with Likelihood Weighting. | Bozhena Bidyuk, Rina Dechter |
| 2005 | CP | AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. | Radu Marinescu, Rina Dechter |
| 2005 | CP | AND/OR Search Spaces and the Semantic Width of Constraint Networks. | Robert Mateescu, Rina Dechter |
| 2005 | IJCAI | AND/OR Branch-and-Bound for Graphical Models. | Radu Marinescu, Rina Dechter |
| 2005 | IJCAI | AND/OR Cutset Conditioning. | Robert Mateescu, Rina Dechter |
| 2005 | UAI | Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. | Vibhav Gogate, Rina Dechter |
| 2005 | UAI | Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. | Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca |
| 2005 | UAI | The Relationship Between AND/OR Search and Variable Elimination. | Robert Mateescu, Rina Dechter |
| 2004 | CP | The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. | Rina Dechter, Robert Mateescu |
| 2004 | CP | Counting-Based Look-Ahead Schemes for Constraint Satisfaction. | Kalev Kask, Rina Dechter, Vibhav Gogate |
| 2004 | ISAIM | New Look-Ahead Schemes for Constraint Satisfaction. | Kalev Kask, Rina Dechter, Vibhav Gogate |
| 2004 | LPNMR | Constraints and Probabilistic Networks: A Look At The Interface. | Rina Dechter |
| 2004 | UAI | On Finding Minimal w-cutset. | Bozhena Bidyuk, Rina Dechter |
| 2004 | UAI | Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. | Rina Dechter, Robert Mateescu |
| 2004 | UAI | A Complete Anytime Algorithm for Treewidth. | Vibhav Gogate, Rina Dechter |
| 2003 | AI | Cycle-Cutset Sampling for Bayesian Networks. | Bozhena Bidyuk, Rina Dechter |
| 2003 | AISTATS | Bayesian Inference in the Presence of Determinism. | David Larkin, Rina Dechter |
| 2003 | UAI | An Empirical Study of w-Cutset Sampling for Bayesian Networks. | Bozhena Bidyuk, Rina Dechter |
| 2003 | UAI | A Simple Insight into Iterative Belief Propagation's Success. | Rina Dechter, Robert Mateescu |
| 2003 | UAI | Systematic vs. Non-systematic Algorithms for Solving the MPE Task. | Radu Marinescu, Kalev Kask, Rina Dechter |
| 2002 | AAAI | Generating Random Solutions for Constraint Satisfaction Problems. | Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek |
| 2002 | AAAI | Tree Approximation for Belief Updating. | Robert Mateescu, Rina Dechter, Kalev Kask |
| 2002 | UAI | Iterative Join-Graph Propagation. | Rina Dechter, Kalev Kask, Robert Mateescu |
| 2001 | CP | A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. | Rina Dechter, Kalev Kask, Javier Larrosa |
| 2001 | UAI | Hybrid Processing of Beliefs and Constraints. | Rina Dechter, David Larkin |
| 2000 | AAAI | An Implementation of the Combinatorial Auction Problem in ECL | Robert Menke, Rina Dechter |
| 1999 | AISTATS | Stochastic local search for Bayesian network. | Kalev Kask, Rina Dechter |
| 1999 | IJCAI | Branch and Bound with Mini-Bucket Heuristics. | Kalev Kask, Rina Dechter |
| 1999 | UAI | Mini-Bucket Heuristics for Improved Search. | Kalev Kask, Rina Dechter |
| 1998 | CP | Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. | Daniel Frost, Rina Dechter |
| 1998 | UAI | Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. | Irina Rish, Kalev Kask, Rina Dechter |
| 1997 | IJCAI | Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. | Rina Dechter |
| 1997 | SAC | Simple distributed algorithms for the cycle cutset problem. | Arun K. Jagota, Rina Dechter |
| 1997 | UAI | A Scheme for Approximating Probabilistic Inference. | Rina Dechter, Irina Rish |
| 1996 | AAAI | A Graph-Based Method for Improving GSAT. | Kalev Kask, Rina Dechter |
| 1996 | CP | Looking at Full Looking Ahead. | Daniel Frost, Rina Dechter |
| 1996 | CP | To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). | Irina Rish, Rina Dechter |
| 1996 | UAI | Bucket elimination: A unifying framework for probabilistic inference. | Rina Dechter |
| 1996 | UAI | Topological parameters for time-space tradeoff. | Rina Dechter |
| 1996 | UAI | An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. | Yousri El Fattah, Rina Dechter |
| 1996 | UAI | Identifying Independencies in Causal Graphs with Feedback. | Judea Pearl, Rina Dechter |
| 1996 | TIME | Processing Disjunctions of Temporal Constraints. | Eddie Schwalb, Rina Dechter |
| 1995 | CP | Local and Global Relational Consistency. | Rina Dechter, Peter van Beek |
| 1995 | IJCAI | Diagnosing Tree-Decomposable Circuits. | Yousri El Fattah, Rina Dechter |
| 1995 | IJCAI | Systematic Versus Stochastic Constraint Satisfaction. | Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang |
| 1995 | IJCAI | Look-Ahead Value Ordering for Constraint Satisfaction Problems. | Daniel Frost, Rina Dechter |
| 1995 | IJCAI | GSAT and Local Consistency. | Kalev Kask, Rina Dechter |
| 1994 | AAAI | Dead-End Driven Learning. | Daniel Frost, Rina Dechter |
| 1994 | AAAI | In Search of the Best Constraint Satisfaction Search. | Daniel Frost, Rina Dechter |
| 1994 | AAAI | Temporal Reasoning with Constraints on Fluents and Events. | Eddie Schwalb, Kalev Kask, Rina Dechter |
| 1994 | KR | Constraint Tightness versus Global Consistency. | Peter van Beek, Rina Dechter |
| 1994 | KR | Directional Resolution: The Davis-Putnam Procedure, Revisited. | Rina Dechter, Irina Rish |
| 1993 | AAAI | On Computing Minimal Models. | Rachel Ben-Eliyahu, Rina Dechter |
| 1993 | AAAI | Coping With Disjunctions in Temporal Constraint Satisfaction Problems. | Eddie Schwalb, Rina Dechter |
| 1992 | AAAI | An Improved Connectionist Activation Function for Energy Minimization. | Gadi Pinkas, Rina Dechter |
| 1992 | ICLP | Propositional Sematics for Disjunctive Logic Programs. | Rachel Ben-Eliyahu, Rina Dechter |
| 1991 | AAAI | Default Logic, Propositional Logic, and Constraints. | Rachel Ben-Eliyahu, Rina Dechter |
| 1991 | IJCAI | On the Feasibility of Distributed Constraint Satisfaction. | Zeev Collin, Rina Dechter, Shmuel Katz |
| 1991 | IJCAI | Directed Constraint Networks: A Relational Framework for Causal Modeling. | Rina Dechter, Judea Pearl |
| 1990 | AAAI | On the Expressiveness of Networks with Hidden Variables. | Rina Dechter |
| 1990 | AAAI | Tree Decomposition with Applications to Constraint Processing. | Itay Meiri, Judea Pearl, Rina Dechter |
| 1989 | COLT | Learning Structure from Data: A Survey. | Judea Pearl, Rina Dechter |
| 1989 | IJCAI | Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. | Rina Dechter, Itay Meiri |
| 1989 | KR | Temporal Constraint Networks. | Rina Dechter, Itay Meiri, Judea Pearl |
| 1988 | AAAI | Belief Maintenance in Dynamic Constraint Networks. | Rina Dechter, Avi Dechter |
| 1988 | AAAI | Tree-Clustering Schemes for Constraint-Processing. | Rina Dechter, Judea Pearl |
| 1987 | AAAI | Removing Redundancies in Constraint Networks. | Avi Dechter, Rina Dechter |
| 1987 | PODS | Decomposing an N-ary Relation into a Tree of Binary Relations. | Rina Dechter |
| 1986 | AAAI | Learning While Searching in Constraint-Satisfaction-Problems. | Rina Dechter |
| 1985 | IJCAI | The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. | Rina Dechter, Judea Pearl |
| 1983 | AAAI | The Optimality of A* Revisited. | Rina Dechter, Judea Pearl |