default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUdi Boker
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c41]Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash:
History-Determinism vs Fair Simulation. CONCUR 2024: 12:1-12:16- [c40]Udi Boker
:
Discounted-Sum Automata with Real-Valued Discount Factors. LICS 2024: 15:1-15:14 - [i17]Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, Aditya Prakash:
History-Determinism vs Fair Simulation. CoRR abs/2407.08620 (2024) - 2023
- [j13]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative-Automata. Log. Methods Comput. Sci. 19(4) (2023) - [j12]Udi Boker, Karoliina Lehtinen:
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism. ACM SIGLOG News 10(1): 24-51 (2023) - [c39]Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Safety and Liveness of Quantitative Automata. CONCUR 2023: 17:1-17:18 - [c38]Udi Boker, Guy Hefetz:
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. FoSSaCS 2023: 371-391 - [c37]Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. FSTTCS 2023: 19:1-19:22 - [i16]Udi Boker, Guy Hefetz:
On the Comparison of Discounted-Sum Automata with Multiple Discount Factors. CoRR abs/2301.04086 (2023) - [i15]Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç:
Safety and Liveness of Quantitative Automata. CoRR abs/2307.06016 (2023) - [i14]Udi Boker, Guy Hefetz:
Discounted-Sum Automata with Multiple Discount Factors. CoRR abs/2307.08780 (2023) - [i13]Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. CoRR abs/2308.03308 (2023) - 2022
- [j11]Shaull Almagor, Udi Boker, Orna Kupferman:
What's decidable about weighted automata? Inf. Comput. 282: 104651 (2022) - [j10]Ori Lahav, Udi Boker:
What's Decidable About Causally Consistent Shared Memory? ACM Trans. Program. Lang. Syst. 44(2): 8:1-8:55 (2022) - [c36]Udi Boker:
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk). CSL 2022: 1:1-1:15 - [c35]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative Automata. FoSSaCS 2022: 120-139 - [c34]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. FoSSaCS 2022: 140-160 - [i12]Udi Boker, Karoliina Lehtinen, Salomon Sickert:
On the Translation of Automata to Linear Temporal Logic. CoRR abs/2201.10267 (2022) - 2021
- [c33]Udi Boker, Guy Hefetz:
Discounted-Sum Automata with Multiple Discount Factors. CSL 2021: 12:1-12:23 - [c32]Udi Boker, Karoliina Lehtinen:
History Determinism vs. Good for Gameness in Quantitative Automata. FSTTCS 2021: 38:1-38:20 - [c31]Udi Boker:
Quantitative vs. Weighted Automata. RP 2021: 3-18 - [i11]Udi Boker, Karoliina Lehtinen:
History Determinism vs. Good for Gameness in Quantitative Automata. CoRR abs/2110.14238 (2021) - [i10]Udi Boker, Karoliina Lehtinen:
Token Games and History-Deterministic Quantitative-Automata. CoRR abs/2110.14308 (2021) - 2020
- [j9]Karoliina Lehtinen, Udi Boker:
Register Games. Log. Methods Comput. Sci. 16(2) (2020) - [c30]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CONCUR 2020: 47:1-47:16 - [c29]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS 2020: 41:1-41:13 - [c28]Ori Lahav, Udi Boker:
Decidable verification under a causally consistent shared memory. PLDI 2020: 211-226 - [i9]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR abs/2002.07278 (2020) - [i8]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CoRR abs/2005.03435 (2020) - [i7]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR abs/2009.14437 (2020)
2010 – 2019
- 2019
- [c27]Udi Boker, Karoliina Lehtinen:
Good for Games Automata: From Nondeterminism to Alternation. CONCUR 2019: 19:1-19:16 - [c26]Udi Boker:
Inherent Size Blowup in ω-Automata. DLT 2019: 3-17 - [i6]Udi Boker, Karoliina Lehtinen:
Register Games. CoRR abs/1902.10654 (2019) - [i5]Udi Boker, Karoliina Lehtinen:
Good for Games Automata: From Nondeterminism to Alternation. CoRR abs/1906.11624 (2019) - 2018
- [j8]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of ω-Regular Languages. Log. Methods Comput. Sci. 14(1) (2018) - [c25]Udi Boker, Karoliina Lehtinen:
On the Way to Alternating Weak Automata. FSTTCS 2018: 21:1-21:22 - [c24]Udi Boker, Yariv Shaulian:
Automaton-Based Criteria for Membership in CTL. LICS 2018: 155-164 - [c23]Udi Boker:
Why These Automata Types? LPAR 2018: 143-163 - 2017
- [c22]Udi Boker:
On the (In)Succinctness of Muller Automata. CSL 2017: 12:1-12:16 - [c21]Udi Boker:
Rabin vs. Streett Automata. FSTTCS 2017: 17:1-17:15 - [c20]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata?. FSTTCS 2017: 18:1-18:14 - [i4]Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata? CoRR abs/1710.04115 (2017) - 2016
- [j7]Shaull Almagor, Udi Boker, Orna Kupferman:
Formally Reasoning About Quality. J. ACM 63(3): 24:1-24:56 (2016) - [c19]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of omega-Regular Languages. MFCS 2016: 11:1-11:14 - [p1]Udi Boker, Nachum Dershowitz:
Honest Computability and Complexity. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 151-173 - [i3]Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of $ω$-Regular Languages. CoRR abs/1612.08154 (2016) - 2015
- [c18]Udi Boker, Thomas A. Henzinger, Jan Otop:
The Target Discounted-Sum Problem. LICS 2015: 750-761 - 2014
- [j6]Udi Boker, Thomas A. Henzinger:
Exact and Approximate Determinization of Discounted-Sum Automata. Log. Methods Comput. Sci. 10(1) (2014) - [j5]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. 15(4): 27:1-27:25 (2014) - [c17]Udi Boker, Thomas A. Henzinger, Arjun Radhakrishna:
Battery transition systems. POPL 2014: 595-606 - [c16]Shaull Almagor, Udi Boker, Orna Kupferman:
Discounting in LTL. TACAS 2014: 424-439 - [i2]Shaull Almagor, Udi Boker, Orna Kupferman:
Discounting in LTL. CoRR abs/1406.4249 (2014) - 2013
- [c15]Shaull Almagor, Udi Boker, Orna Kupferman:
Formalizing and Reasoning about Quality. ICALP (2) 2013: 15-27 - [c14]Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) 2013: 89-100 - 2012
- [j4]Udi Boker, Orna Kupferman:
Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. 13(4): 29:1-29:26 (2012) - [c13]Udi Boker, Thomas A. Henzinger:
Approximate Determinization of Quantitative Automata. FSTTCS 2012: 362-373 - 2011
- [c12]Shaull Almagor, Udi Boker, Orna Kupferman:
What's Decidable about Weighted Automata? ATVA 2011: 482-491 - [c11]Udi Boker, Thomas A. Henzinger:
Determinizing Discounted-Sum Automata. CSL 2011: 82-96 - [c10]Udi Boker, Orna Kupferman:
Co-Büching Them All. FoSSaCS 2011: 184-198 - [c9]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. LICS 2011: 43-52 - 2010
- [c8]Udi Boker, Nachum Dershowitz:
Three Paths to Effectiveness. Fields of Logic and Computation 2010: 135-146 - [c7]Udi Boker, Orna Kupferman:
The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation 2010: 147-164 - [c6]Udi Boker, Orna Kupferman, Avital Steinitz:
Parityizing Rabin and Streett. FSTTCS 2010: 412-423 - [c5]Udi Boker, Orna Kupferman, Adin Rosenberg:
Alternation Removal in Büchi Automata. ICALP (2) 2010: 76-87
2000 – 2009
- 2009
- [j3]Udi Boker, Nachum Dershowitz:
The influence of domain interpretations on computational models. Appl. Math. Comput. 215(4): 1323-1339 (2009) - [c4]Udi Boker, Orna Kupferman:
Co-ing Büchi Made Tight and Useful. LICS 2009: 245-254 - 2008
- [b1]Udi Boker:
The influence of domain interpretations on computational models. Tel Aviv University, Israel, 2008 - [c3]Udi Boker, Nachum Dershowitz:
The Church-Turing Thesis over Arbitrary Domains. Pillars of Computer Science 2008: 199-229 - 2006
- [j2]Udi Boker, Nachum Dershowitz:
A hypercomputational alien. Appl. Math. Comput. 178(1): 44-57 (2006) - [j1]Udi Boker, Nachum Dershowitz:
Comparing Computational Power. Log. J. IGPL 14(5): 633-647 (2006) - 2005
- [c2]Udi Boker, Nachum Dershowitz:
How to Compare the Power of Computational Models. CiE 2005: 54-64 - [c1]Udi Boker, Nachum Dershowitz:
Abstract Effective Models. DCM@ICALP 2005: 15-23 - [i1]Udi Boker, Nachum Dershowitz:
Comparing Computational Power. CoRR abs/cs/0510069 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
