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 35 matches
- 2024
- Gal Amram, Dor Ma'ayan, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Triggers for Reactive Synthesis Specifications. Software Engineering 2024: 41-42 - 2023
- Gal Amram, Dor Ma'ayan, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Triggers for Reactive Synthesis Specifications. ICSE 2023: 729-741 - 2022
- Gal Amram, Shahar Maoz, Itai Segall, Matan Yossef:
Dynamic Update for Synthesized GR(1) Controllers. ICSE 2022: 786-797 - 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
- Gal Amram, Shahar Maoz, Or Pistiner:
GR(1)*: GR(1) specifications extended with existential guarantees. Formal Aspects Comput. 33(4-5): 729-761 (2021) - Gal Amram, Suguman Bansal, Dror Fried, Lucas Martinelli Tabajara, Moshe Y. Vardi, Gera Weiss:
Adapting Behaviors via Reactive Synthesis. CAV (1) 2021: 870-893 - Gal Amram, Shahar Maoz, Or Pistiner, Jan Oliver Ringert:
Efficient Algorithms for Omega-Regular Energy Games. FM 2021: 163-181 - Gal Amram, Amir Rubin, Gera Weiss:
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence. CoRR abs/2104.02999 (2021) - 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
- Gal Amram, Amir Rubin:
An efficient generalized shift-rule for the prefer-max De Bruijn sequence. Discret. Math. 343(2): 111657 (2020) - 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) - 2019
- 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) - Meirav Amram, Cheng Gong, Sheng-Li Tan, Mina Teicher, Wan-Yuan Xu:
The fundamental groups of Galois covers of planar Zappatic deformations of type Ek. Int. J. Algebra Comput. 29(6): 905-925 (2019) - Gal Amram, Shahar Maoz, Or Pistiner:
GR(1)*: GR(1) Specifications Extended with Existential Guarantees. FM 2019: 83-100 - 2018
- Gal Amram, Amir Rubin:
An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence. CoRR abs/1801.10091 (2018) - 2017
- Uri Abraham, Gal Amram:
Two-process synchronization. Theor. Comput. Sci. 688: 2-23 (2017) - 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
- Gal Amram:
The F-Snapshot Problem. SIROCCO 2016: 159-176 - 2015
- Gal Amram:
The F-snapshot Problem. CoRR abs/1510.02211 (2015) - Gal Amram, Lior Mizrahi, Gera Weiss:
Simple Executions of Snapshot Implementations. CoRR abs/1502.02991 (2015) - 2014
- Gal Amram:
On the Signaling Problem. ICDCN 2014: 44-65 - Uri Abraham, Gal Amram:
On the Mailbox Problem. OPODIS 2014: 453-468 - 2013
- Uri Abraham, Gal Amram:
On the Mailbox Problem. CoRR abs/1307.5619 (2013) - 2008
- Meirav Amram, Mina Teicher, Uzi Vishne:
The Fundamental Group of Galois Cover of the Surface T × T. Int. J. Algebra Comput. 18(8): 1259-1282 (2008) - 2007
- Meirav Amram, Mina Teicher, Uzi Vishne:
The Fundamental Group of the Galois Cover of Hirzebruch Surface F1(2, 2). Int. J. Algebra Comput. 17(3): 507-525 (2007) - 2002
- Amir M. Ben-Amram, Zvi Galil:
Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Algorithmica 32(3): 364-395 (2002) - 2001
- Amir M. Ben-Amram, Zvi Galil:
A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica 30(1): 34-66 (2001) - Amir M. Ben-Amram, Zvi Galil:
Topological Lower Bounds on Algebraic Random Access Machines. SIAM J. Comput. 31(3): 722-761 (2001) - 1995
- Amir M. Ben-Amram, Zvi Galil:
On the Power of the Shift Instruction. Inf. Comput. 117(1): 19-36 (1995) - Amir M. Ben-Amram, Zvi Galil:
Lower Bounds on Algebraic Random Access Machines (Extended Abstract). ICALP 1995: 360-371
skipping 5 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-11-09 18:55 CET 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