Eitan Kondratovsky

Orcid: 0000-0002-9625-7534

According to our database1, Eitan Kondratovsky authored at least 13 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Reconstructing parameterized strings from parameterized suffix and LCP arrays.
Theor. Comput. Sci., January, 2024

2023
On Suffix Tree Detection.
Proceedings of the String Processing and Information Retrieval, 2023

2022
Multidimensional Period Recovery.
Algorithmica, 2022

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries.
Proceedings of the String Processing and Information Retrieval, 2022

Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays.
Proceedings of the String Processing and Information Retrieval, 2022

Shortest Beer Path Queries in Interval Graphs.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Towards a real time algorithm for parameterized longest common prefix computation.
Theor. Comput. Sci., 2021

The k-Mappability Problem Revisited.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Approximating the Anticover of a String.
Proceedings of the String Processing and Information Retrieval, 2020

Analysis of the Period Recovery Error Bound.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Repetition Detection in a Dynamic String.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Sufficient Conditions for Efficient Indexing Under Different Matchings.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Searching for a Modified Pattern in a Changing Text.
Proceedings of the String Processing and Information Retrieval, 2018


  Loading...