# Udi Boker

According to our database

Collaborative distances:

^{1}, Udi Boker authored at least 35 papers between 2005 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Families of DFAs as Acceptors of ω-Regular Languages.

Logical Methods in Computer Science, 2018

Automaton-Based Criteria for Membership in CTL.

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

How Deterministic are Good-For-Games Automata?

CoRR, 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 $ω$-Regular Languages.

CoRR, 2016

Families of DFAs as Acceptors of omega-Regular Languages.

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 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.

Logical Methods in Computer Science, 2014

Discounting in LTL.

CoRR, 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

Temporal Specifications with Accumulative Values.

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 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

What's Decidable about Weighted Automata?

Proceedings of the Automated Technology for Verification and Analysis, 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.

Applied Mathematics and Computation, 2009

Co-ing Büchi Made Tight and Useful.

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

The Church-Turing Thesis over Arbitrary Domains.

Proceedings of the Pillars of Computer Science, 2008

2006

Comparing Computational Power.

Logic Journal of the IGPL, 2006

Abstract Effective Models.

Electr. Notes Theor. Comput. Sci., 2006

A hypercomputational alien.

Applied Mathematics and Computation, 2006

2005

Comparing Computational Power

CoRR, 2005

How to Compare the Power of Computational Models.

Proceedings of the New Computational Paradigms, 2005