![](https://dblp.uni-trier.de./img/logo.320x120.png)
![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
Eitan Kondratovsky
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
2020 – today
- 2024
- [j4]Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024) - [j3]Amihood Amir, Eitan Kondratovsky, Avivit Levy
:
On suffix tree detection. Theor. Comput. Sci. 1012: 114728 (2024) - [c12]Amihood Amir
, Eitan Kondratovsky
, Shoshana Marcus
, Dina Sokol
:
Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. SPIRE 2024: 1-15 - 2023
- [c11]Amihood Amir
, Eitan Kondratovsky
, Avivit Levy
:
On Suffix Tree Detection. SPIRE 2023: 14-27 - 2022
- [j2]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy
, Dina Sokol:
Multidimensional Period Recovery. Algorithmica 84(6): 1490-1510 (2022) - [c10]Rathish Das, Meng He
, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. ISAAC 2022: 59:1-59:17 - [c9]Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE 2022: 55-69 - [c8]Rathish Das, Meng He
, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu:
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. SPIRE 2022: 217-232 - [i2]Rathish Das, Meng He
, Eitan Kondratovsky, J. Ian Munro, Anurag Murty Naredla, Kaiyu Wu:
Shortest Beer Path Queries in Interval Graphs. CoRR abs/2209.14401 (2022) - 2021
- [j1]Amihood Amir, Eitan Kondratovsky:
Towards a real time algorithm for parameterized longest common prefix computation. Theor. Comput. Sci. 852: 132-137 (2021) - [c7]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-Mappability Problem Revisited. CPM 2021: 5:1-5:20 - [i1]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
The k-mappability problem revisited. CoRR abs/2106.07017 (2021) - 2020
- [c6]Amihood Amir, Itai Boneh, Michael Itzhaki, Eitan Kondratovsky:
Analysis of the Period Recovery Error Bound. ESA 2020: 5:1-5:21 - [c5]Amihood Amir, Itai Boneh, Eitan Kondratovsky:
Approximating the Anticover of a String. SPIRE 2020: 99-114 - [c4]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. SPIRE 2020: 115-130
2010 – 2019
- 2019
- [c3]Amihood Amir, Eitan Kondratovsky:
Sufficient Conditions for Efficient Indexing Under Different Matchings. CPM 2019: 6:1-6:12 - [c2]Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos
, Eitan Kondratovsky:
Repetition Detection in a Dynamic String. ESA 2019: 5:1-5:18 - 2018
- [c1]Amihood Amir, Eitan Kondratovsky:
Searching for a Modified Pattern in a Changing Text. SPIRE 2018: 241-253
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 2025-01-09 13:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint