A Novel Spectrum Sharing Scheme Using Relay Station with Intelligent Reception. - Jaehwan Kim; Junkyu Lee 001; Joonhyuk Kang (KES (3), 2006)

High speed transmission for a coaxial cable based in-home network. - Kwanghoon Kim; Junkyu Lee 001; Yusung Lee; Joonhyuk Kang; Hyuncheol Park (IEEE Trans. Consumer Electron., 2006)

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

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

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

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

Probabilistic Planning With Influence Diagrams. - Junkyu Lee 001 (AAAI, 2018)

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

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

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

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

Submodel Decomposition for Solving Limited Memory Influence Diagrams (Student Abstract). - Junkyu Lee 001 (AAAI, 2020)

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

Decomposition Bounds for Influence Diagrams. - Junkyu Lee 001 (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)

How to Reduce Action Space for Planning Domains? (Student Abstract). - Harsha Kokel; Junkyu Lee 001; Michael Katz 001; Shirin Sohrabi; Kavitha Srinivas (AAAI, 2022)

AI Planning Annotation for Sample Efficient Reinforcement Learning. - Junkyu Lee 001; Michael Katz 001; Don Joven Agravante; Miao Liu 001; Tim Klinger; Murray Campbell; Shirin Sohrabi; Gerald Tesauro (CoRR, 2022)

K∗ Search over Orbit Space for Top-k Planning. - Michael Katz 001; Junkyu Lee 001 (IJCAI, 2023)

Action Space Reduction for Planning Domains. - Harsha Kokel; Junkyu Lee 001; Michael Katz 001; Kavitha Srinivas; Shirin Sohrabi (IJCAI, 2023)

Credal Marginal MAP. - Radu Marinescu 002; Debarun Bhattacharjya; Junkyu Lee 001; Fábio G. Cozman; Alexander G. Gray (NeurIPS, 2023)

Generating SAS+ Planning Tasks of Specified Causal Structure. - Michael Katz 001; Junkyu Lee 001; Shirin Sohrabi (SOCS, 2023)

On K* Search for Top-K Planning. - Junkyu Lee 001; Michael Katz 001; Shirin Sohrabi (SOCS, 2023)

K∗ and Partial Order Reduction for Top-Quality Planning. - Michael Katz 001; Junkyu Lee 001 (SOCS, 2023)

Large Language Models as Planning Domain Generators (Student Abstract). - James T. Oswald; Kavitha Srinivas; Harsha Kokel; Junkyu Lee 001; Michael Katz 001; Shirin Sohrabi (AAAI, 2024)

Partially Observable Hierarchical Reinforcement Learning with AI Planning (Student Abstract). - Brandon Rozek; Junkyu Lee 001; Harsha Kokel; Michael Katz 001; Shirin Sohrabi (AAAI, 2024)

Unifying and Certifying Top-Quality Planning. - Michael Katz 001; Junkyu Lee 001; Shirin Sohrabi (ICAPS, 2024)

Large Language Models as Planning Domain Generators. - James T. Oswald; Kavitha Srinivas; Harsha Kokel; Junkyu Lee 001; Michael Katz 001; Shirin Sohrabi (ICAPS, 2024)

Abductive Reasoning in Logical Credal Networks. - Radu Marinescu 002; Junkyu Lee 001; Debarun Bhattacharjya; Fábio G. Cozman; Alexander G. Gray (NeurIPS, 2024)

Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning. - Michael Katz 001; Junkyu Lee 001; Jungkoo Kang; Shirin Sohrabi (SOCS, 2024)

Foundation Model Sherpas: Guiding Foundation Models through Knowledge and Reasoning. - Debarun Bhattacharjya; Junkyu Lee 001; Don Joven Agravante; Balaji Ganesan; Radu Marinescu 002 (CoRR, 2024)

Markov conditions and factorization in logical credal networks. - Fábio G. Cozman; Radu Marinescu 002; Junkyu Lee 001; Alexander G. Gray; Ryan Riegel; Debarun Bhattacharjya (Int. J. Approx. Reason., 2024)

Q-function Decomposition with Intervention Semantics for Factored Action Spaces. - Junkyu Lee 001; Tian Gao; Elliot Nelson; Miao Liu 001; Debarun Bhattacharjya; Songtao Lu (AISTATS, 2025)

Dealing with cycles in graph-based probabilistic models: the case of Logical Credal Networks. - Fábio G. Cozman; Radu Marinescu 002; Junkyu Lee 001; Alexander Gray 001; Denis Deratani Mauá (ISIPTA, 2025)

The Consistency Hypothesis in Uncertainty Quantification for Large Language Models. - Quan Xiao; Debarun Bhattacharjya; Balaji Ganesan; Radu Marinescu 002; Katsiaryna Mirylenka; Nhan H. Pham; Michael R. Glass; Junkyu Lee 001 (UAI, 2025)

Rationalization Models for Text-to-SQL. - Gaetano Rossiello; Nhan Pham; Michael R. Glass; Junkyu Lee 001; Dharmashankar Subramanian (CoRR, 2025)

FactReasoner: A Probabilistic Approach to Long-Form Factuality Assessment for Large Language Models. - Radu Marinescu 002; Debarun Bhattacharjya; Junkyu Lee 001; Tigran T. Tchrakian; Javier Carnerero-Cano; Yufang Hou 001; Elizabeth Daly; Alessandra Pascale (CoRR, 2025)