![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Oren Kapah
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c9]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA 2016: 367-375 - 2014
- [i3]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - [i2]Amihood Amir, Oren Kapah, Ely Porat, Amir Rothschild:
Polynomials: a new tool for length reduction in binary discrete convolutions. CoRR abs/1410.5607 (2014)
2000 – 2009
- 2009
- [j5]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009) - [j4]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange rearrangement: The element-cost model. Theor. Comput. Sci. 410(43): 4315-4326 (2009) - [j3]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009) - 2008
- [j2]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
:
Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008) - [c8]Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat:
Approximate String Matching with Address Bit Errors. CPM 2008: 118-129 - [c7]Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz:
Interchange Rearrangement: The Element-Cost Model. SPIRE 2008: 224-235 - [i1]Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild:
Improved Deterministic Length Reduction. CoRR abs/0802.0017 (2008) - 2007
- [c6]Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 - [c5]Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat:
On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110 - [c4]Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur:
Generalized LCS. SPIRE 2007: 50-61 - 2006
- [j1]Amihood Amir, Oren Kapah, Dekel Tsur
:
Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006) - [c3]Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat:
Approximate Matching in Weighted Sequences. CPM 2006: 365-376 - 2004
- [c2]Shlomo Argamon, Navot Akiva, Amihood Amir, Oren Kapah:
Efficient Unsupervised Recursive Word Segmentation Using Minimum Description Length. COLING 2004 - [c1]Amihood Amir, Oren Kapah, Dekel Tsur:
Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint