default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 68 matches
- 2024
- Yotam Amitai, Ofra Amir, Guy Avni:
ASQ-IT: Interactive explanations for reinforcement-learning agents. Artif. Intell. 335: 104182 (2024) - Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CONCUR 2024: 8:1-8:17 - Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. FoSSaCS (2) 2024: 229-249 - Guy Avni, Kaushik Mallik, Suman Sadhukhan:
Auction-Based Scheduling. TACAS (3) 2024: 153-172 - Guy Avni, Mirco Giacobbe, Taylor T. Johnson, Guy Katz, Anna Lukina, Nina Narodytska, Christian Schilling:
AI Verification - First International Symposium, SAIV 2024, Montreal, QC, Canada, July 22-23, 2024, Proceedings. Lecture Notes in Computer Science 14846, Springer 2024, ISBN 978-3-031-65111-3 [contents] - Florent Delgrange, Guy Avni, Anna Lukina, Christian Schilling, Ann Nowé, Guillermo A. Pérez:
Synthesis of Hierarchical Controllers Based on Deep Reinforcement Learning Policies. CoRR abs/2402.13785 (2024) - Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, Kaushik Mallik:
Bidding Games with Charging. CoRR abs/2407.06288 (2024) - 2023
- Guy Avni, Shibashis Guha, Orna Kupferman:
Timed network games. Inf. Comput. 290: 104996 (2023) - Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. AAAI 2023: 5464-5471 - Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. CONCUR 2023: 16:1-16:17 - Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. ECAI 2023: 141-148 - Yotam Amitai, Guy Avni, Ofra Amir:
ASQ-IT: Interactive Explanations for Reinforcement-Learning Agents. CoRR abs/2301.09941 (2023) - Guy Avni, Pranav Ghorpade, Shibashis Guha:
A Game of Pawns. CoRR abs/2305.04096 (2023) - Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. CoRR abs/2307.14492 (2023) - Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. CoRR abs/2307.15218 (2023) - Guy Avni, Kaushik Mallik, Suman Sadhukhan:
Auction-Based Scheduling. CoRR abs/2310.11798 (2023) - 2022
- Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. FSTTCS 2022: 30:1-30:18 - Guy Avni, Thomas A. Henzinger:
An Updated Survey of Bidding Games on Graphs (Invited Talk). MFCS 2022: 3:1-3:6 - Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. CoRR abs/2210.02773 (2022) - Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. CoRR abs/2211.13626 (2022) - 2021
- Guy Avni, Thomas A. Henzinger, Dorde Zikelic:
Bidding mechanisms in graph games. J. Comput. Syst. Sci. 119: 133-144 (2021) - Milad Aghajohari, Guy Avni, Thomas A. Henzinger:
Determinacy in Discrete-Bidding Infinite-Duration Games. Log. Methods Comput. Sci. 17(1) (2021) - Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. SODA 2021: 617-636 - 2020
- Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic resource allocation games. Theor. Comput. Sci. 807: 42-55 (2020) - Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. AAAI 2020: 1798-1805 - Guy Avni, Thomas A. Henzinger:
A Survey of Bidding Games on Graphs (Invited Paper). CONCUR 2020: 2:1-2:21 - Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina:
Formal Methods with a Touch of Magic. FMCAD 2020: 138-147 - Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. CoRR abs/2005.06636 (2020) - Parand Alizadeh Alamdari, Guy Avni, Thomas A. Henzinger, Anna Lukina:
Formal Methods with a Touch of Magic. CoRR abs/2005.12175 (2020) - 2019
- Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:
Infinite-duration Bidding Games. J. ACM 66(4): 31:1-31:29 (2019)
skipping 38 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-14 06:31 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint