How to Compare the Power of Computational Models. - Udi Boker; Nachum Dershowitz (CiE, 2005)

Abstract Effective Models. - Udi Boker; Nachum Dershowitz (DCM@ICALP, 2005)

A hypercomputational alien. - Udi Boker; Nachum Dershowitz (Appl. Math. Comput., 2006)

Comparing Computational Power. - Udi Boker; Nachum Dershowitz (Log. J. IGPL, 2006)

The Church-Turing Thesis over Arbitrary Domains. - Udi Boker; Nachum Dershowitz (Pillars of Computer Science, 2008)

The influence of domain interpretations on computational models - Udi Boker (2008)

Co-ing Büchi Made Tight and Useful. - Udi Boker; Orna Kupferman (LICS, 2009)

The influence of domain interpretations on computational models. - Udi Boker; Nachum Dershowitz (Appl. Math. Comput., 2009)

Three Paths to Effectiveness. - Udi Boker; Nachum Dershowitz (Fields of Logic and Computation, 2010)

The Quest for a Tight Translation of Büchi to co-Büchi Automata. - Udi Boker; Orna Kupferman (Fields of Logic and Computation, 2010)

Parityizing Rabin and Streett. - Udi Boker; Orna Kupferman; Avital Steinitz (FSTTCS, 2010)

Alternation Removal in Büchi Automata. - Udi Boker; Orna Kupferman; Adin Rosenberg (ICALP (2), 2010)

Determinizing Discounted-Sum Automata. - Udi Boker; Thomas A. Henzinger (CSL, 2011)

Co-Büching Them All. - Udi Boker; Orna Kupferman (FoSSaCS, 2011)

Approximate Determinization of Quantitative Automata. - Udi Boker; Thomas A. Henzinger (FSTTCS, 2012)

Translating to Co-Büchi Made Tight, Unified, and Useful. - Udi Boker; Orna Kupferman (ACM Trans. Comput. Log., 2012)

Formalizing and Reasoning about Quality. - Shaull Almagor; Udi Boker; Orna Kupferman (ICALP (2), 2013)

Nondeterminism in the Presence of a Diverse or Unknown Future. - Udi Boker; Denis Kuperberg; Orna Kupferman; Michal Skrzypczak (ICALP (2), 2013)

Battery transition systems. - Udi Boker; Thomas A. Henzinger; Arjun Radhakrishna (POPL, 2014)

Discounting in LTL. - Shaull Almagor; Udi Boker; Orna Kupferman (TACAS, 2014)

Exact and Approximate Determinization of Discounted-Sum Automata. - Udi Boker; Thomas A. Henzinger (Log. Methods Comput. Sci., 2014)

Temporal Specifications with Accumulative Values. - Udi Boker; Krishnendu Chatterjee; Thomas A. Henzinger; Orna Kupferman (ACM Trans. Comput. Log., 2014)

The Target Discounted-Sum Problem. - Udi Boker; Thomas A. Henzinger; Jan Otop (LICS, 2015)

Honest Computability and Complexity. - Udi Boker; Nachum Dershowitz (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

Families of DFAs as Acceptors of omega-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (MFCS, 2016)

Formally Reasoning About Quality. - Shaull Almagor; Udi Boker; Orna Kupferman (J. ACM, 2016)

On the (In)Succinctness of Muller Automata. - Udi Boker (CSL, 2017)

Rabin vs. Streett Automata. - Udi Boker (FSTTCS, 2017)

How Deterministic are Good-For-Games Automata?. - Udi Boker; Orna Kupferman; Michal Skrzypczak (FSTTCS, 2017)

On the Way to Alternating Weak Automata. - Udi Boker; Karoliina Lehtinen (FSTTCS, 2018)

Automaton-Based Criteria for Membership in CTL. - Udi Boker; Yariv Shaulian (LICS, 2018)

Why These Automata Types? - Udi Boker (LPAR, 2018)

Families of DFAs as Acceptors of ω-Regular Languages. - Dana Angluin; Udi Boker; Dana Fisman (Log. Methods Comput. Sci., 2018)

Good for Games Automata: From Nondeterminism to Alternation. - Udi Boker; Karoliina Lehtinen (CONCUR, 2019)

Inherent Size Blowup in ω-Automata. - Udi Boker (DLT, 2019)

Parametrized Universality Problems for One-Counter Nets. - Shaull Almagor; Udi Boker; Piotr Hofman; Patrick Totzke (CONCUR, 2020)

On the Succinctness of Alternating Parity Good-For-Games Automata. - Udi Boker; Denis Kuperberg; Karoliina Lehtinen; Michal Skrzypczak (FSTTCS, 2020)

Decidable verification under a causally consistent shared memory. - Ori Lahav 001; Udi Boker (PLDI, 2020)

On Succinctness and Recognisability of Alternating Good-for-Games Automata. - Udi Boker; Denis Kuperberg; Karoliina Lehtinen; Michal Skrzypczak (CoRR, 2020)

Register Games. - Karoliina Lehtinen; Udi Boker (Log. Methods Comput. Sci., 2020)

History Determinism vs. Good for Gameness in Quantitative Automata. - Udi Boker; Karoliina Lehtinen (FSTTCS, 2021)

Quantitative vs. Weighted Automata. - Udi Boker (RP, 2021)

Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). - Udi Boker (CSL, 2022)

On the Translation of Automata to Linear Temporal Logic. - Udi Boker; Karoliina Lehtinen; Salomon Sickert (FoSSaCS, 2022)

What's decidable about weighted automata? - Shaull Almagor; Udi Boker; Orna Kupferman (Inf. Comput., 2022)

What's Decidable About Causally Consistent Shared Memory? - Ori Lahav 001; Udi Boker (ACM Trans. Program. Lang. Syst., 2022)

Safety and Liveness of Quantitative Automata. - Udi Boker; Thomas A. Henzinger; Nicolas Mazzocchi; N. Ege Saraç (CONCUR, 2023)

On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. - Udi Boker; Guy Hefetz (FoSSaCS, 2023)

Synchronized CTL over One-Counter Automata. - Shaull Almagor; Daniel Assa; Udi Boker (FSTTCS, 2023)

Token Games and History-Deterministic Quantitative-Automata. - Udi Boker; Karoliina Lehtinen (Log. Methods Comput. Sci., 2023)

When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. - Udi Boker; Karoliina Lehtinen (ACM SIGLOG News, 2023)

History-Determinism vs Fair Simulation. - Udi Boker; Thomas A. Henzinger; Karoliina Lehtinen; Aditya Prakash 002 (CONCUR, 2024)

Discounted-Sum Automata with Real-Valued Discount Factors. - Udi Boker (LICS, 2024)

Discounted-Sum Automata with Multiple Discount Factors. - Udi Boker; Guy Hefetz (Log. Methods Comput. Sci., 2025)

Safety and Liveness of Quantitative Properties and Automata. - Udi Boker; Thomas A. Henzinger; Nicolas Mazzocchi; N. Ege Saraç (Log. Methods Comput. Sci., 2025)