Udi Boker - RankMe

76 papers A* 7A 1B 15C 2Journal 33Unranked 16

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Discounted-Sum Automata with Multiple Discount Factors. Log. Methods Comput. Sci. Udi Boker, Guy Hefetz
2025	J	`jnl`	Safety and Liveness of Quantitative Properties and Automata. Log. Methods Comput. Sci. Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç
2025	J	`jnl`	The Target Discounted-Sum Problem. CoRR Udi Boker, Thomas A. Henzinger, Jan Otop
2024	A*	`conf`	Discounted-Sum Automata with Real-Valued Discount Factors. LICS Udi Boker
2024	B	`conf`	History-Determinism vs Fair Simulation. CONCUR Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
2024	J	`jnl`	History-Determinism vs Fair Simulation. CoRR Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash
2023	J	`jnl`	Discounted-Sum Automata with Multiple Discount Factors. CoRR Udi Boker, Guy Hefetz
2023	B	`conf`	On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. FoSSaCS Udi Boker, Guy Hefetz
2023	J	`jnl`	On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. CoRR Udi Boker, Guy Hefetz
2023	B	`conf`	Safety and Liveness of Quantitative Automata. CONCUR Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç
2023	J	`jnl`	Safety and Liveness of Quantitative Automata. CoRR Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç
2023	—	`conf`	Synchronized CTL over One-Counter Automata. FSTTCS Shaull Almagor, Daniel Assa, Udi Boker
2023	J	`jnl`	Synchronized CTL over One-Counter Automata. CoRR Shaull Almagor, Daniel Assa, Udi Boker
2023	J	`jnl`	Token Games and History-Deterministic Quantitative-Automata. Log. Methods Comput. Sci. Udi Boker, Karoliina Lehtinen
2023	J	`jnl`	When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News Udi Boker, Karoliina Lehtinen
2022	B	`conf`	Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). CSL Udi Boker
2022	B	`conf`	On the Translation of Automata to Linear Temporal Logic. FoSSaCS Udi Boker, Karoliina Lehtinen, Salomon Sickert
2022	J	`jnl`	On the Translation of Automata to Linear Temporal Logic. CoRR Udi Boker, Karoliina Lehtinen, Salomon Sickert
2022	B	`conf`	Token Games and History-Deterministic Quantitative Automata. FoSSaCS Udi Boker, Karoliina Lehtinen
2022	J	`jnl`	What's Decidable About Causally Consistent Shared Memory? ACM Trans. Program. Lang. Syst. Ori Lahav, Udi Boker
2022	J	`jnl`	What's decidable about weighted automata? Inf. Comput. Shaull Almagor, Udi Boker, Orna Kupferman
2021	B	`conf`	Discounted-Sum Automata with Multiple Discount Factors. CSL Udi Boker, Guy Hefetz
2021	—	`conf`	History Determinism vs. Good for Gameness in Quantitative Automata. FSTTCS Udi Boker, Karoliina Lehtinen
2021	J	`jnl`	History Determinism vs. Good for Gameness in Quantitative Automata. CoRR Udi Boker, Karoliina Lehtinen
2021	—	`conf`	Quantitative vs. Weighted Automata. RP Udi Boker
2021	J	`jnl`	Token Games and History-Deterministic Quantitative-Automata. CoRR Udi Boker, Karoliina Lehtinen
2020	A*	`conf`	Decidable verification under a causally consistent shared memory. PLDI Ori Lahav, Udi Boker
2020	J	`jnl`	On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	—	`conf`	On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	J	`jnl`	On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	B	`conf`	Parametrized Universality Problems for One-Counter Nets. CONCUR Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
2020	J	`jnl`	Parametrized Universality Problems for One-Counter Nets. CoRR Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke
2020	J	`jnl`	Register Games. Log. Methods Comput. Sci. Karoliina Lehtinen, Udi Boker
2019	B	`conf`	Good for Games Automata: From Nondeterminism to Alternation. CONCUR Udi Boker, Karoliina Lehtinen
2019	J	`jnl`	Good for Games Automata: From Nondeterminism to Alternation. CoRR Udi Boker, Karoliina Lehtinen
2019	C	`conf`	Inherent Size Blowup in ω-Automata. DLT Udi Boker
2019	J	`jnl`	Register Games. CoRR Udi Boker, Karoliina Lehtinen
2018	A*	`conf`	Automaton-Based Criteria for Membership in CTL. LICS Udi Boker, Yariv Shaulian
2018	J	`jnl`	Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. Dana Angluin, Udi Boker, Dana Fisman
2018	—	`conf`	On the Way to Alternating Weak Automata. FSTTCS Udi Boker, Karoliina Lehtinen
2018	B	`conf`	Why These Automata Types? LPAR Udi Boker
2017	J	`jnl`	How Deterministic are Good-For-Games Automata? CoRR Udi Boker, Orna Kupferman, Michal Skrzypczak
2017	—	`conf`	How Deterministic are Good-For-Games Automata?. FSTTCS Udi Boker, Orna Kupferman, Michal Skrzypczak
2017	B	`conf`	On the (In)Succinctness of Muller Automata. CSL Udi Boker
2017	—	`conf`	Rabin vs. Streett Automata. FSTTCS Udi Boker
2016	J	`jnl`	Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR Dana Angluin, Udi Boker, Dana Fisman
2016	B	`conf`	Families of DFAs as Acceptors of omega-Regular Languages. MFCS Dana Angluin, Udi Boker, Dana Fisman
2016	J	`jnl`	Formally Reasoning About Quality. J. ACM Shaull Almagor, Udi Boker, Orna Kupferman
2016	—	`ch.`	Honest Computability and Complexity. Martin Davis on Computability, Computational Logic, and Mathematical Foundations Udi Boker, Nachum Dershowitz
2015	A*	`conf`	The Target Discounted-Sum Problem. LICS Udi Boker, Thomas A. Henzinger, Jan Otop
2014	A*	`conf`	Battery transition systems. POPL Udi Boker, Thomas A. Henzinger, Arjun Radhakrishna
2014	A	`conf`	Discounting in LTL. TACAS Shaull Almagor, Udi Boker, Orna Kupferman
2014	J	`jnl`	Discounting in LTL. CoRR Shaull Almagor, Udi Boker, Orna Kupferman
2014	J	`jnl`	Exact and Approximate Determinization of Discounted-Sum Automata. Log. Methods Comput. Sci. Udi Boker, Thomas A. Henzinger
2014	J	`jnl`	Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
2013	—	`conf`	Formalizing and Reasoning about Quality. ICALP (2) Shaull Almagor, Udi Boker, Orna Kupferman
2013	—	`conf`	Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
2012	—	`conf`	Approximate Determinization of Quantitative Automata. FSTTCS Udi Boker, Thomas A. Henzinger
2012	J	`jnl`	Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. Udi Boker, Orna Kupferman
2011	B	`conf`	Co-Büching Them All. FoSSaCS Udi Boker, Orna Kupferman
2011	B	`conf`	Determinizing Discounted-Sum Automata. CSL Udi Boker, Thomas A. Henzinger
2011	A*	`conf`	Temporal Specifications with Accumulative Values. LICS Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman
2011	B	`conf`	What's Decidable about Weighted Automata? ATVA Shaull Almagor, Udi Boker, Orna Kupferman
2010	—	`conf`	Alternation Removal in Büchi Automata. ICALP (2) Udi Boker, Orna Kupferman, Adin Rosenberg
2010	—	`conf`	Parityizing Rabin and Streett. FSTTCS Udi Boker, Orna Kupferman, Avital Steinitz
2010	—	`conf`	The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation Udi Boker, Orna Kupferman
2010	—	`conf`	Three Paths to Effectiveness. Fields of Logic and Computation Udi Boker, Nachum Dershowitz
2009	A*	`conf`	Co-ing Büchi Made Tight and Useful. LICS Udi Boker, Orna Kupferman
2009	J	`jnl`	The influence of domain interpretations on computational models. Appl. Math. Comput. Udi Boker, Nachum Dershowitz
2008	—	`conf`	The Church-Turing Thesis over Arbitrary Domains. Pillars of Computer Science Udi Boker, Nachum Dershowitz
2008	—	`—`	The influence of domain interpretations on computational models Udi Boker
2006	J	`jnl`	A hypercomputational alien. Appl. Math. Comput. Udi Boker, Nachum Dershowitz
2006	J	`jnl`	Comparing Computational Power. Log. J. IGPL Udi Boker, Nachum Dershowitz
2005	—	`conf`	Abstract Effective Models. DCM@ICALP Udi Boker, Nachum Dershowitz
2005	J	`jnl`	Comparing Computational Power CoRR Udi Boker, Nachum Dershowitz
2005	C	`conf`	How to Compare the Power of Computational Models. CiE Udi Boker, Nachum Dershowitz