Probabilistic Analysis of the Complexity of A*. - Nam Huyn; Rina Dechter; Judea Pearl (Artif. Intell., 1980)

The Optimality of A* Revisited. - Rina Dechter; Judea Pearl (AAAI, 1983)

The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. - Rina Dechter; Judea Pearl (IJCAI, 1985)

Generalized Best-First Search Strategies and the Optimality of A* - Rina Dechter; Judea Pearl (J. ACM, 1985)

Learning While Searching in Constraint-Satisfaction-Problems. - Rina Dechter (AAAI, 1986)

Broadcast Communications and Distributed Algorithms. - Rina Dechter; Leonard Kleinrock (IEEE Trans. Computers, 1986)

Removing Redundancies in Constraint Networks. - Avi Dechter; Rina Dechter (AAAI, 1987)

Decomposing an N-ary Relation into a Tree of Binary Relations. - Rina Dechter (PODS, 1987)

Network-Based Heuristics for Constraint-Satisfaction Problems. - Rina Dechter; Judea Pearl (Artif. Intell., 1987)

Belief Maintenance in Dynamic Constraint Networks. - Rina Dechter; Avi Dechter (AAAI, 1988)

Tree-Clustering Schemes for Constraint-Processing. - Rina Dechter; Judea Pearl (AAAI, 1988)

Learning Structure from Data: A Survey. - Judea Pearl; Rina Dechter (COLT, 1989)

Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. - Rina Dechter; Itay Meiri (IJCAI, 1989)

Tree Clustering for Constraint Networks. - Rina Dechter; Judea Pearl (Artif. Intell., 1989)

On the Greedy Solution of Ordering Problems. - Avi Dechter; Rina Dechter (INFORMS J. Comput., 1989)

On the Expressiveness of Networks with Hidden Variables. - Rina Dechter (AAAI, 1990)

Tree Decomposition with Applications to Constraint Processing. - Itay Meiri; Judea Pearl; Rina Dechter (AAAI, 1990)

Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. - Rina Dechter (Artif. Intell., 1990)

Decomposing a Relation into a Tree of Binary Relations. - Rina Dechter (J. Comput. Syst. Sci., 1990)

Default Logic, Propositional Logic, and Constraints. - Rachel Ben-Eliyahu; Rina Dechter (AAAI, 1991)

On the Feasibility of Distributed Constraint Satisfaction. - Zeev Collin; Rina Dechter; Shmuel Katz (IJCAI, 1991)

Directed Constraint Networks: A Relational Framework for Causal Modeling. - Rina Dechter; Judea Pearl (IJCAI, 1991)

Temporal Constraint Networks. - Rina Dechter; Itay Meiri; Judea Pearl (Artif. Intell., 1991)

An Improved Connectionist Activation Function for Energy Minimization. - Gadi Pinkas; Rina Dechter (AAAI, 1992)

Propositional Sematics for Disjunctive Logic Programs. - Rachel Ben-Eliyahu; Rina Dechter (JICSLP, 1992)

From Local to Global Consistency. - Rina Dechter (Artif. Intell., 1992)

Structure Identification in Relational Data. - Rina Dechter; Judea Pearl (Artif. Intell., 1992)

Coping With Disjunctions in Temporal Constraint Satisfaction Problems. - Eddie Schwalb; Rina Dechter (AAAI, 1993)

Dead-End Driven Learning. - Daniel Frost; Rina Dechter (AAAI, 1994)

In Search of the Best Constraint Satisfaction Search. - Daniel Frost; Rina Dechter (AAAI, 1994)

Temporal Reasoning with Constraints on Fluents and Events. - Eddie Schwalb; Kalev Kask; Rina Dechter (AAAI, 1994)

Constraint Tightness versus Global Consistency. - Peter van Beek; Rina Dechter (KR, 1994)

Directional Resolution: The Davis-Putnam Procedure, Revisited. - Rina Dechter; Irina Rish (KR, 1994)

Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. - Rina Dechter; Itay Meiri (Artif. Intell., 1994)

Propositional Semantics for Disjunctive Logic Programs. - Rachel Ben-Eliyahu; Rina Dechter (Ann. Math. Artif. Intell., 1994)

Diagnosing Tree-Decomposable Circuits. - Yousri El Fattah; Rina Dechter (IJCAI, 1995)

Systematic Versus Stochastic Constraint Satisfaction. - Eugene C. Freuder; Rina Dechter; Matthew L. Ginsberg; Bart Selman; Edward P. K. Tsang (IJCAI, 1995)

Look-Ahead Value Ordering for Constraint Satisfaction Problems. - Daniel Frost; Rina Dechter (IJCAI (1), 1995)

GSAT and Local Consistency. - Kalev Kask; Rina Dechter (IJCAI (1), 1995)

On the Minimality and Decomposability of Row-Convex Constraint Networks. - Peter van Beek; Rina Dechter (J. ACM, 1995)

Improving Connectionist Energy Minimization. - Gadi Pinkas; Rina Dechter (J. Artif. Intell. Res., 1995)

A Graph-Based Method for Improving GSAT. - Kalev Kask; Rina Dechter (AAAI/IAAI, Vol. 1, 1996)

Looking at Full Looking Ahead. - Daniel Frost; Rina Dechter (CP, 1996)

To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). - Irina Rish; Rina Dechter (CP, 1996)

Processing Disjunctions of Temporal Constraints. - Eddie Schwalb; Rina Dechter (TIME, 1996)

Bucket elimination: A unifying framework for probabilistic inference. - Rina Dechter (UAI, 1996)

Topological parameters for time-space tradeoff. - Rina Dechter (UAI, 1996)

An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. - Yousri El Fattah; Rina Dechter (UAI, 1996)

Identifying Independencies in Causal Graphs with Feedback. - Judea Pearl; Rina Dechter (UAI, 1996)

Default Reasoning Using Classical Logic. - Rachel Ben-Eliyahu; Rina Dechter (Artif. Intell., 1996)

Structure-Driven Algorithms for Truth Maintenance. - Rina Dechter; Avi Dechter (Artif. Intell., 1996)

Uncovering Trees in Constraint Networks. - Itay Meiri; Rina Dechter; Judea Pearl (Artif. Intell., 1996)

On Computing Minimal Models. - Rachel Ben-Eliyahu; Rina Dechter (Ann. Math. Artif. Intell., 1996)

Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. - Rina Dechter (ACM Comput. Surv., 1996)

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. - Rina Dechter (IJCAI, 1997)

Simple distributed algorithms for the cycle cutset problem. - Arun K. Jagota; Rina Dechter (SAC, 1997)

A Scheme for Approximating Probabilistic Inference. - Rina Dechter; Irina Rish (UAI, 1997)

Processing Disjunctions in Temporal Constraint Networks. - Eddie Schwalb; Rina Dechter (Artif. Intell., 1997)

Constraint tightness and looseness versus local and global consistency. - Peter van Beek; Rina Dechter (J. ACM, 1997)

Local and Global Relational Consistency. - Rina Dechter; Peter van Beek (Theor. Comput. Sci., 1997)

Bucket Elimination: A Unifying Framework for Probabilistic Inference. - Rina Dechter (Learning in Graphical Models, 1998)

Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. - Daniel Frost; Rina Dechter (CP, 1998)

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. - Irina Rish; Kalev Kask; Rina Dechter (UAI, 1998)

Stochastic local search for Bayesian network. - Kalev Kask; Rina Dechter (AISTATS, 1999)

Branch and Bound with Mini-Bucket Heuristics. - Kalev Kask; Rina Dechter (IJCAI, 1999)

Mini-Bucket Heuristics for Improved Search. - Kalev Kask; Rina Dechter (UAI, 1999)

Bucket Elimination: A Unifying Framework for Reasoning. - Rina Dechter (Artif. Intell., 1999)

Maintenance scheduling problems as benchmarks for constraint algorithms. - Daniel Frost; Rina Dechter (Ann. Math. Artif. Intell., 1999)

Self-Stabilizing Distributed Constraint Satisfaction. - Zeev Collin; Rina Dechter; Shmuel Katz (Chic. J. Theor. Comput. Sci., 1999)

An Implementation of the Combinatorial Auction Problem in ECLiPSe. - Robert Menke; Rina Dechter (AAAI/IAAI, 2000)

A New Perspective on Algorithms for Optimizing Policies under Uncertainty. - Rina Dechter (AIPS, 2000)

Resolution versus Search: Two Strategies for SAT. - Irina Rish; Rina Dechter (J. Autom. Reason., 2000)

A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. - Rina Dechter; Kalev Kask; Javier Larrosa (CP, 2001)

Hybrid Processing of Beliefs and Constraints. - Rina Dechter; David Larkin 001 (UAI, 2001)

Topological parameters for time-space tradeoff. - Rina Dechter; Yousri El Fattah (Artif. Intell., 2001)

A general scheme for automatic generation of search heuristics from specification dependencies. - Kalev Kask; Rina Dechter (Artif. Intell., 2001)

Heuristic search in artificial intelligence. - Weixiong Zhang; Rina Dechter; Richard E. Korf (Artif. Intell., 2001)

Generating Random Solutions for Constraint Satisfaction Problems. - Rina Dechter; Kalev Kask; Eyal Bin; Roy Emek (AAAI/IAAI, 2002)

Tree Approximation for Belief Updating. - Robert Mateescu; Rina Dechter; Kalev Kask (AAAI/IAAI, 2002)

Iterative Join-Graph Propagation. - Rina Dechter; Kalev Kask; Robert Mateescu (UAI, 2002)

Backjump-based backtracking for constraint satisfaction problems. - Rina Dechter; Daniel Frost (Artif. Intell., 2002)

Constraint processing. - Rina Dechter (Elsevier Morgan Kaufmann, 2003)

Cycle-Cutset Sampling for Bayesian Networks. - Bozhena Bidyuk; Rina Dechter (AI, 2003)

Bayesian Inference in the Presence of Determinism. - David Larkin 001; Rina Dechter (AISTATS, 2003)

An Empirical Study of w-Cutset Sampling for Bayesian Networks. - Bozhena Bidyuk; Rina Dechter (UAI, 2003)

A Simple Insight into Iterative Belief Propagation's Success. - Rina Dechter; Robert Mateescu (UAI, 2003)

Systematic vs. Non-systematic Algorithms for Solving the MPE Task. - Radu Marinescu 002; Kalev Kask; Rina Dechter (UAI, 2003)

Guest Editorial. - Rina Dechter (Constraints An Int. J., 2003)

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. - Javier Larrosa; Rina Dechter (Constraints An Int. J., 2003)

Mini-buckets: A general scheme for bounded inference. - Rina Dechter; Irina Rish (J. ACM, 2003)

The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. - Rina Dechter; Robert Mateescu (CP, 2004)

Counting-Based Look-Ahead Schemes for Constraint Satisfaction. - Kalev Kask; Rina Dechter; Vibhav Gogate (CP, 2004)

New Look-Ahead Schemes for Constraint Satisfaction. - Kalev Kask; Rina Dechter; Vibhav Gogate (AI&M, 2004)

Constraints and Probabilistic Networks: A Look At The Interface. - Rina Dechter (LPNMR, 2004)

On Finding Minimal w-cutset. - Bozhena Bidyuk; Rina Dechter (UAI, 2004)

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. - Rina Dechter; Robert Mateescu (UAI, 2004)

A Complete Anytime Algorithm for Treewidth. - Vibhav Gogate; Rina Dechter (UAI, 2004)

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. - Radu Marinescu 002; Rina Dechter (CP, 2005)

AND/OR Search Spaces and the Semantic Width of Constraint Networks. - Robert Mateescu; Rina Dechter (CP, 2005)

AND/OR Branch-and-Bound for Graphical Models. - Radu Marinescu 002; Rina Dechter (IJCAI, 2005)

AND/OR Cutset Conditioning. - Robert Mateescu; Rina Dechter (IJCAI, 2005)

Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. - Vibhav Gogate; Rina Dechter (UAI, 2005)

Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. - Vibhav Gogate; Rina Dechter; Bozhena Bidyuk; Craig Rindt; James Marca (UAI, 2005)

The Relationship Between AND/OR Search and Variable Elimination. - Robert Mateescu; Rina Dechter (UAI, 2005)

Unifying tree decompositions for reasoning in graphical models. - Kalev Kask; Rina Dechter; Javier Larrosa; Avi Dechter (Artif. Intell., 2005)

An Anytime Scheme for Bounding Posterior Beliefs. - Bozhena Bidyuk; Rina Dechter (AAAI, 2006)

Memory Intensive Branch-and-Bound Search for Graphical Models. - Radu Marinescu 002; Rina Dechter (AAAI, 2006)

A New Algorithm for Sampling CSP Solutions Uniformly at Random. - Vibhav Gogate; Rina Dechter (CP, 2006)

Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). - Robert Mateescu; Rina Dechter (CP, 2006)

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. - Radu Marinescu 002; Rina Dechter (CPAIOR, 2006)

Improving Bound Propagation. - Bozhena Bidyuk; Rina Dechter (ECAI, 2006)

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. - Radu Marinescu 002; Rina Dechter (ECAI, 2006)

Cutset Sampling with Likelihood Weighting. - Bozhena Bidyuk; Rina Dechter (UAI, 2006)

Tractable Structures for Constraint Satisfaction Problems. - Rina Dechter (Handbook of Constraint Programming, 2006)

Approximate Counting by Sampling the Backtrack-free Search Space. - Vibhav Gogate; Rina Dechter (AAAI, 2007)

Best-First AND/OR Search for Graphical Models. - Radu Marinescu 002; Rina Dechter (AAAI, 2007)

AND/OR Multi-valued Decision Diagrams for Constraint Optimization. - Robert Mateescu; Radu Marinescu 002; Rina Dechter (CP, 2007)

Best-First AND/OR Search for 0/1 Integer Programming. - Radu Marinescu 002; Rina Dechter (CPAIOR, 2007)

A Comparison of Time-Space Schemes for Graphical Models. - Robert Mateescu; Rina Dechter (IJCAI, 2007)

Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. - Vibhav Gogate; Bozhena Bidyuk; Rina Dechter (UAI, 2007)

Best-First AND/OR Search for Most Probable Explanations. - Radu Marinescu 002; Rina Dechter (UAI, 2007)

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. - Robert Mateescu; Rina Dechter (UAI, 2007)

AND/OR search spaces for graphical models. - Rina Dechter; Robert Mateescu (Artif. Intell., 2007)

Cutset Sampling for Bayesian Networks. - Bozhena Bidyuk; Rina Dechter (J. Artif. Intell. Res., 2007)

SampleSearch: A Scheme that Searches for Consistent Samples. - Vibhav Gogate; Rina Dechter (AISTATS, 2007)

Studies in Solution Sampling. - Vibhav Gogate; Rina Dechter (AAAI, 2008)

AND/OR Multi-valued Decision Diagrams for Constraint Networks. - Robert Mateescu; Rina Dechter (Concurrency, Graphs and Models, 2008)

Approximate Solution Sampling (and Counting) on AND/OR Spaces. - Vibhav Gogate; Rina Dechter (CP, 2008)

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. - Lars Otten; Rina Dechter (CP, 2008)

Robust Solutions in Unstable Optimization Problems. - Maria Silvia Pini; Francesca Rossi 001; Kristen Brent Venable; Rina Dechter (CSCLP, 2008)

On the Practical Significance of Hypertree vs. TreeWidth. - Rina Dechter; Lars Otten; Radu Marinescu 002 (ECAI, 2008)

Evaluating probabilistic reasoning systems. - Adnan Darwiche; Rina Dechter (BMA, 2008)

AND/OR Importance Sampling. - Vibhav Gogate; Rina Dechter (UAI, 2008)

Bounding Search Space Size via (Hyper)tree Decompositions. - Lars Otten; Rina Dechter (UAI, 2008)

Mixed deterministic and probabilistic networks. - Robert Mateescu; Rina Dechter (Ann. Math. Artif. Intell., 2008)

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. - Robert Mateescu; Rina Dechter; Radu Marinescu 002 (J. Artif. Intell. Res., 2008)

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. - Radu Marinescu 002; Rina Dechter (Artif. Intell., 2009)

Memory intensive AND/OR search for combinatorial optimization in graphical models. - Radu Marinescu 002; Rina Dechter (Artif. Intell., 2009)

New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. - Emma Rollon; Rina Dechter (AAAI, 2010)

Toward parallel search for optimization in graphical models. - Lars Otten; Rina Dechter (ISAIM, 2010)

Evaluating partition strategies for mini-bucket elimination. - Emma Rollon; Rina Dechter (ISAIM, 2010)

BEEM : Bucket Elimination with External Memory. - Kalev Kask; Rina Dechter; Andrew Gelfand (UAI, 2010)

Evaluating the impact of AND/OR search on 0-1 integer linear programming. - Radu Marinescu 002; Rina Dechter (Constraints An Int. J., 2010)

Active Tuples-based Scheme for Bounding Posterior Beliefs. - Bozhena Bidyuk; Rina Dechter; Emma Rollon (J. Artif. Intell. Res., 2010)

Join-Graph Propagation Algorithms. - Robert Mateescu; Kalev Kask; Vibhav Gogate; Rina Dechter (J. Artif. Intell. Res., 2010)

On Combining Graph-based Variance Reduction schemes. - Vibhav Gogate; Rina Dechter (AISTATS, 2010)

Stopping Rules for Randomized Greedy Triangulation Schemes. - Andrew Gelfand; Kalev Kask; Rina Dechter (AAAI, 2011)

Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. - Kalev Kask; Andrew Gelfand; Lars Otten; Rina Dechter (AAAI, 2011)

Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. - Natalia Flerova; Emma Rollon; Rina Dechter (GKR, 2011)

Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. - Lars Otten; Rina Dechter (Pacific Symposium on Biocomputing, 2011)

SampleSearch: Importance sampling in presence of determinism. - Vibhav Gogate; Rina Dechter (Artif. Intell., 2011)

Sampling-based lower bounds for counting queries. - Vibhav Gogate; Rina Dechter (Intelligenza Artificiale, 2011)

Search Algorithms for m Best Solutions for Graphical Models. - Rina Dechter; Natalia Flerova; Radu Marinescu 002 (AAAI, 2012)

Advances in Distributed Branch and Bound. - Lars Otten; Rina Dechter (ECAI, 2012)

Join-graph based cost-shifting schemes. - Alexander Ihler; Natalia Flerova; Rina Dechter; Lars Otten (UAI, 2012)

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. - Lars Otten; Rina Dechter (UAI, 2012)

Importance sampling-based estimation over AND/OR search spaces for graphical models. - Vibhav Gogate; Rina Dechter (Artif. Intell., 2012)

Anytime AND/OR depth-first search for combinatorial optimization. - Lars Otten; Rina Dechter (AI Commun., 2012)

Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006) - Rina Dechter; Thomas S. Richardson 001 (CoRR, 2012)

Predicting the Size of Depth-First Branch and Bound Search Trees. - Levi H. S. Lelis; Lars Otten; Rina Dechter (IJCAI, 2013)

Semiring-Based Mini-Bucket Partitioning Schemes. - Emma Rollon; Javier Larrosa; Rina Dechter (IJCAI, 2013)

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. - Mark Silberstein; Omer Weissbrod; Lars Otten; Anna Tzemach; Andrei Anisenia; Oren Shtark; Dvir Tuberg; Eddie Galfrin; Irena Gannon; Adel Shalata; Zvi U. Borochowitz; Rina Dechter; et al. (Bioinform., 2013)

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference - Rina Dechter (CoRR, 2013)

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms - Rina Dechter (Reasoning with Probabilistic and Deterministic Graphical Models, 2013)

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (StarAI@AAAI, 2014)

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. - Levi H. S. Lelis; Lars Otten; Rina Dechter (CP, 2014)

Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). - Lars Otten; Rina Dechter (CP, 2014)

Weighted Best First Search for Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (ISAIM, 2014)

Evaluating Weighted DFS Branch and Bound over Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (SOCS, 2014)

Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. - William Lam; Kalev Kask; Rina Dechter; Alexander Ihler (SOCS, 2014)

STLS: Cycle-Cutset-Driven Local Search For MPE. - Alon Milchgrub; Rina Dechter (SOCS, 2014)

AND/OR Search for Marginal MAP. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (UAI, 2014)

Pushing Forward Marginal MAP with Best-First Search. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (IJCAI, 2015)

Caching in Context-Minimal OR Spaces. - Rina Dechter; Levi H. S. Lelis; Lars Otten (SOCS, 2015)

Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. - William Lam; Kalev Kask; Rina Dechter (SOCS, 2015)

Look-Ahead with Mini-Bucket Heuristics for MPE. - Rina Dechter; Kalev Kask; William Lam; Javier Larrosa (AAAI, 2016)

From Exact to Anytime Solutions for Marginal MAP. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter; Alexander Ihler (AAAI, 2016)

On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. - William Lam; Kalev Kask; Rina Dechter; Javier Larrosa (ECAI, 2016)

Probabilistic Inference Modulo Theories. - Rodrigo de Salvo Braz; Ciaran O'Reilly; Vibhav Gogate; Rina Dechter (IJCAI, 2016)

Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. - Javier Larrosa; Emma Rollon; Rina Dechter (IJCAI, 2016)

Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (ISAIM, 2016)

Searching for the M Best Solutions in Graphical Models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (J. Artif. Intell. Res., 2016)

Anytime Best+Depth-First Search for Bounding Marginal MAP. - Radu Marinescu 002; Junkyu Lee 001; Alexander Ihler; Rina Dechter (AAAI, 2017)

Anytime Anyspace AND/OR Search for Bounding the Partition Function. - Qi Lou; Rina Dechter; Alexander Ihler (AAAI, 2017)

Dynamic Importance Sampling for Anytime Bounds of the Partition Function. - Qi Lou; Rina Dechter; Alexander Ihler (NIPS, 2017)

Weighted heuristic anytime search: new schemes for optimization over graphical models. - Natalia Flerova; Radu Marinescu 002; Rina Dechter (Ann. Math. Artif. Intell., 2017)

Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. - William Lam; Kalev Kask; Javier Larrosa; Rina Dechter (J. Artif. Intell. Res., 2017)

AND/OR Branch-and-Bound on a Computational Grid. - Lars Otten; Rina Dechter (J. Artif. Intell. Res., 2017)

Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. - Junkyu Lee 001; Alexander Ihler; Rina Dechter (AAAI Workshops, 2018)

Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. - Qi Lou; Rina Dechter; Alexander Ihler (AAAI, 2018)

Stochastic Anytime Search for Bounding Marginal MAP. - Radu Marinescu 002; Rina Dechter; Alexander Ihler (IJCAI, 2018)

Abstraction Sampling in Graphical Models. - Filjor Broka; Rina Dechter; Alexander Ihler; Kalev Kask (UAI, 2018)

Join Graph Decomposition Bounds for Influence Diagrams. - Junkyu Lee 001; Alexander Ihler; Rina Dechter (UAI, 2018)

Finite-sample Bounds for Marginal MAP. - Qi Lou; Rina Dechter; Alexander Ihler (UAI, 2018)

Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. - Ferdinando Fioretto; Enrico Pontelli; William Yeoh 001; Rina Dechter (Constraints An Int. J., 2018)

AND/OR Search for Marginal MAP. - Radu Marinescu 002; Junkyu Lee 001; Rina Dechter; Alexander Ihler (J. Artif. Intell. Res., 2018)

Subproblem ordering heuristics for AND/OR best-first search. - William Lam; Kalev Kask; Javier Larrosa; Rina Dechter (J. Comput. Syst. Sci., 2018)

Anytime Recursive Best-First Search for Bounding Marginal MAP. - Radu Marinescu 002; Akihiro Kishimoto; Adi Botea; Rina Dechter; Alexander Ihler (AAAI, 2019)

Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. - Qi Lou; Rina Dechter; Alexander Ihler (AAAI, 2019)

Counting the Optimal Solutions in Graphical Models. - Radu Marinescu 002; Rina Dechter (NeurIPS, 2019)

A Weighted Mini-Bucket Bound for Solving Influence Diagram. - Junkyu Lee 001; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2019)

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition - Rina Dechter (Reasoning with Probabilistic and Deterministic Graphical Models (2nd Ed.), 2019)

Scaling Up AND/OR Abstraction Sampling. - Kalev Kask; Bobak Pezeshki; Filjor Broka; Alexander Ihler; Rina Dechter (IJCAI, 2020)

Heuristic AND/OR Search for Solving Influence Diagram. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (SOCS, 2020)

Submodel Decomposition Bounds for Influence Diagrams. - Junkyu Lee 001; Radu Marinescu 002; Rina Dechter (AAAI, 2021)

A New Bounding Scheme for Influence Diagrams. - Radu Marinescu 002; Junkyu Lee 001; Rina Dechter (AAAI, 2021)

Approximating Spatial Evolutionary Games using Bayesian Networks. - Vincent Hsiao; Xinyue Pan; Dana S. Nau; Rina Dechter (AAMAS, 2021)

Deep Bucket Elimination. - Yasaman Razeghi; Kalev Kask; Yadong Lu; Pierre Baldi; Sakshi Agarwal; Rina Dechter (IJCAI, 2021)

Fast Fourier Transform Reductions for Bayesian Network Inference. - Vincent Hsiao; Dana S. Nau; Rina Dechter (AISTATS, 2022)

NeuroBE: Escalating neural network approximations of Bucket Elimination. - Sakshi Agarwal; Kalev Kask; Alexander Ihler; Rina Dechter (UAI, 2022)

AND/OR branch-and-bound for computational protein design optimizing K. - Bobak Pezeshki; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2022)

Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. - Bobak Pezeshki; Radu Marinescu 002; Alexander Ihler; Rina Dechter (UAI, 2023)

Surrogate Bayesian Networks for Approximating Evolutionary Games. - Vincent Hsiao; Dana S. Nau; Bobak Pezeshki; Rina Dechter (AISTATS, 2024)

Estimating Causal Effects from Learned Causal Networks. - Anna Raichev; Jin Tian; Alexander Ihler; Rina Dechter (ECAI, 2024)

Value-Based Abstraction Functions for Abstraction Sampling. - Bobak Pezeshki; Kalev Kask; Alexander Ihler; Rina Dechter (UAI, 2024)

Graph-based Complexity for Causal Effect by Empirical Plug-in. - Rina Dechter; Anna Raichev; Jin Tian; Alexander Ihler (AISTATS, 2025)

A Community-driven vision for a new Knowledge Resource for AI. - Vinay K. Chaudhri; Chaitan Baru; Brandon Bennett; Mehul Bhatt; Darion Cassel; Anthony G. Cohn 001; Rina Dechter; Esra Erdem 001; David A. Ferrucci; Kenneth D. Forbus; Gregory Gelfond; Michael R. Genesereth; et al. (CoRR, 2025)