default search action
Amir Sapir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]Luba Sapir
, Tamara Kogan, Ariel Sapir, Amir Sapir:
Nonstationary vs. stationary iterative processes. Numer. Algorithms 86(2): 515-535 (2021) - [i4]Tamara Kogan, Luba Sapir, Amir Sapir, Eytan Sapir:
Iterative process of order 2 without inverting the derivative. CoRR abs/2105.05740 (2021) - [i3]Amir Sapir, Ariel Sapir:
Is 2NF a Stable Normal Form? CoRR abs/2106.15664 (2021)
2010 – 2019
- 2019
- [i2]Luba Sapir, Tamara Kogan, Ariel Sapir, Amir Sapir:
Nonstationary iterative processes. CoRR abs/1911.01404 (2019) - 2017
- [j9]Tamara Kogan, Luba Sapir
To the question of efficiency of iterative methods. Appl. Math. Lett. 66: 40-46 (2017) - 2016
- [j8]Daniel Berend
Exponential vs. Subexponential Tower of Hanoi Variants. J. Graph Algorithms Appl. 20(2): 461-479 (2016) - 2013
- [j7]Amir Sapir:
On consistent inconsistencies. Inroads 4(1): 52-56 (2013) - 2012
- [j6]Daniel Berend
The Tower of Hanoi problem on Pathh graphs. Discret. Appl. Math. 160(10-11): 1465-1483 (2012) - [c5]Daniel Berend
Which Multi-peg Tower of Hanoi Problems Are Exponential? WG 2012: 81-90 - 2011
- [j5]Daniel Berend
A Decision-Making Approach to the Spam Problem. INFOR Inf. Syst. Oper. Res. 49(1): 1-13 (2011) - [i1]Daniel Berend, Amir Sapir, Shay Solomon:
The Tower of Hanoi problem on Pathh graphs. CoRR abs/1102.4885 (2011)
2000 – 2009
- 2007
- [j4]Tamara Kogan, Luba Sapir, Amir Sapir:
A nonstationary iterative second-order method for solving nonlinear equations. Appl. Math. Comput. 188(1): 75-82 (2007) - 2006
- [j3]Daniel Berend
The diameter of Hanoi graphs. Inf. Process. Lett. 98(2): 79-85 (2006) - [j2]Daniel Berend
The cyclic multi-peg Tower of Hanoi. ACM Trans. Algorithms 2(3): 297-317 (2006) - 2005
- [c4]Daniel Berend, Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi. ALENEX/ANALCO 2005: 212-217 - [c3]Jean-Paul Allouche
Restricted Towers of Hanoi and Morphisms. Developments in Language Theory 2005: 1-10 - 2004
- [j1]Amir Sapir:
The Tower of Hanoi with Forbidden Moves. Comput. J. 47(1): 20-24 (2004)
1990 – 1999
- 1999
- [c2]Amir Sapir, Ehud Gudes:
Dynamic Relationships and Their Propagation and Concurrency Semantics in Object-Oriented Databases. NGITS 1999: 94-111 - 1998
- [c1]Amir Sapir, Ehud Gudes:
Dynamic Relationships and their Propagation Attributes in Object Oriented Databases. DEXA Workshop 1998: 967-974
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-04-24 22:47 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: