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

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

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

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)

New Search Heuristics for Max-CSP. - Kalev Kask (CP, 2000)

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

A general scheme for automatic generation of search heuristics from specification dependencies. - Kalev Kask; Rina Dechter (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)

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

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)

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

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

Join-Graph Propagation Algorithms. - Robert Mateescu; Kalev Kask; Vibhav Gogate; Rina Dechter (J. Artif. Intell. Res., 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)

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

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)

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)

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

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

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

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

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

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

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