default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGal Amram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Gal Amram, Dor Ma'ayan, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Triggers for Reactive Synthesis Specifications. Software Engineering 2024: 41-42- 2023
- [c9]Gal Amram, Dor Ma'ayan
, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Triggers for Reactive Synthesis Specifications. ICSE 2023: 729-741 - 2022
- [c8]Gal Amram, Shahar Maoz, Itai Segall, Matan Yossef:
Dynamic Update for Synthesized GR(1) Controllers. ICSE 2022: 786-797 - [c7]Gal Amram, Avi Hayoun, Lior Mizrahi, Gera Weiss:
Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure. DISC 2022: 5:1-5:20 - 2021
- [j4]Gal Amram, Shahar Maoz, Or Pistiner:
GR(1)*: GR(1) specifications extended with existential guarantees. Formal Aspects Comput. 33(4-5): 729-761 (2021) - [c6]Gal Amram, Suguman Bansal, Dror Fried, Lucas Martinelli Tabajara, Moshe Y. Vardi, Gera Weiss:
Adapting Behaviors via Reactive Synthesis. CAV (1) 2021: 870-893 - [c5]Gal Amram, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Efficient Algorithms for Omega-Regular Energy Games. FM 2021: 163-181 - [i8]Gal Amram, Amir Rubin, Gera Weiss:
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence. CoRR abs/2104.02999 (2021) - [i7]Gal Amram, Suguman Bansal, Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi, Gera Weiss:
Adapting Behaviors via Reactive Synthesis. CoRR abs/2105.13837 (2021) - 2020
- [j3]Gal Amram, Amir Rubin:
An efficient generalized shift-rule for the prefer-max De Bruijn sequence. Discret. Math. 343(2): 111657 (2020) - [i6]Gal Amram, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Energy mu-Calculus: Symbolic Fixed-Point Algorithms for omega-Regular Energy Games. CoRR abs/2005.00641 (2020)
2010 – 2019
- 2019
- [j2]Gal Amram, Yair Ashlagi, Amir Rubin, Yotam Svoray, Moshe Schwartz, Gera Weiss:
An efficient shift rule for the prefer-max De Bruijn sequence. Discret. Math. 342(1): 226-232 (2019) - [c4]Gal Amram, Shahar Maoz, Or Pistiner:
GR(1)*: GR(1) Specifications Extended with Existential Guarantees. FM 2019: 83-100 - 2018
- [i5]Gal Amram, Amir Rubin:
An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence. CoRR abs/1801.10091 (2018) - 2017
- [j1]Uri Abraham, Gal Amram:
Two-process synchronization. Theor. Comput. Sci. 688: 2-23 (2017) - [i4]Gal Amram, Yair Ashlagi, Amir Rubin, Yotam Svoray, Moshe Schwartz, Gera Weiss:
An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence. CoRR abs/1706.01106 (2017) - 2016
- [c3]Gal Amram:
The F-Snapshot Problem. SIROCCO 2016: 159-176 - 2015
- [i3]Gal Amram, Lior Mizrahi, Gera Weiss:
Simple Executions of Snapshot Implementations. CoRR abs/1502.02991 (2015) - [i2]Gal Amram:
The F-snapshot Problem. CoRR abs/1510.02211 (2015) - 2014
- [c2]Gal Amram:
On the Signaling Problem. ICDCN 2014: 44-65 - [c1]Uri Abraham, Gal Amram:
On the Mailbox Problem. OPODIS 2014: 453-468 - 2013
- [i1]Uri Abraham, Gal Amram:
On the Mailbox Problem. CoRR abs/1307.5619 (2013)
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 2024-10-15 21:38 CEST 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:
