Udi Boker

Orcid: 0000-0003-4322-8892

According to our database1, Udi Boker authored at least 54 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Discounted-Sum Automata with Real-Valued Discount Factors.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

History-Determinism vs Fair Simulation.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism.
ACM SIGLOG News, January, 2023

Token Games and History-Deterministic Quantitative-Automata.
Log. Methods Comput. Sci., 2023

Synchronized CTL over One-Counter Automata.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

On the Comparison of Discounted-Sum Automata with Multiple Discount Factors.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Safety and Liveness of Quantitative Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
What's Decidable About Causally Consistent Shared Memory?
ACM Trans. Program. Lang. Syst., 2022

What's decidable about weighted automata?
Inf. Comput., 2022

On the Translation of Automata to Linear Temporal Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk).
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
Quantitative vs. Weighted Automata.
Proceedings of the Reachability Problems - 15th International Conference, 2021

History Determinism vs. Good for Gameness in Quantitative Automata.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Discounted-Sum Automata with Multiple Discount Factors.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Register Games.
Log. Methods Comput. Sci., 2020

On Succinctness and Recognisability of Alternating Good-for-Games Automata.
CoRR, 2020

Decidable verification under a causally consistent shared memory.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

On the Succinctness of Alternating Parity Good-For-Games Automata.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Parametrized Universality Problems for One-Counter Nets.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Inherent Size Blowup in ω-Automata.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Good for Games Automata: From Nondeterminism to Alternation.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Families of DFAs as Acceptors of ω-Regular Languages.
Log. Methods Comput. Sci., 2018

Why These Automata Types?
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Automaton-Based Criteria for Membership in CTL.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On the Way to Alternating Weak Automata.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017
How Deterministic are Good-For-Games Automata?.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Rabin vs. Streett Automata.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

On the (In)Succinctness of Muller Automata.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016
Formally Reasoning About Quality.
J. ACM, 2016

Families of DFAs as Acceptors of omega-Regular Languages.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Honest Computability and Complexity.
Proceedings of the Martin Davis on Computability, 2016

2015
The Target Discounted-Sum Problem.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Temporal Specifications with Accumulative Values.
ACM Trans. Comput. Log., 2014

Exact and Approximate Determinization of Discounted-Sum Automata.
Log. Methods Comput. Sci., 2014

Discounting in LTL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Battery transition systems.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Nondeterminism in the Presence of a Diverse or Unknown Future.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Formalizing and Reasoning about Quality.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Translating to Co-Büchi Made Tight, Unified, and Useful.
ACM Trans. Comput. Log., 2012

Approximate Determinization of Quantitative Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Co-Büching Them All.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Determinizing Discounted-Sum Automata.
Proceedings of the Computer Science Logic, 2011

2010
Alternation Removal in Büchi Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Parityizing Rabin and Streett.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

The Quest for a Tight Translation of Büchi to co-Büchi Automata.
Proceedings of the Fields of Logic and Computation, 2010

Three Paths to Effectiveness.
Proceedings of the Fields of Logic and Computation, 2010

2009
The influence of domain interpretations on computational models.
Appl. Math. Comput., 2009

Co-ing Büchi Made Tight and Useful.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008
The influence of domain interpretations on computational models
PhD thesis, 2008

The Church-Turing Thesis over Arbitrary Domains.
Proceedings of the Pillars of Computer Science, 2008

2006
Comparing Computational Power.
Log. J. IGPL, 2006

A hypercomputational alien.
Appl. Math. Comput., 2006

2005
Abstract Effective Models.
Proceedings of the First International Workshop on Developments in Computational Models, 2005

How to Compare the Power of Computational Models.
Proceedings of the New Computational Paradigms, 2005


  Loading...