Neerja Mhaskar

Orcid: 0000-0002-3233-6540

Affiliations:
  • McMaster University


According to our database1, Neerja Mhaskar authored at least 19 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Two formal design solutions for the generalization of network segmentation.
J. Netw. Comput. Appl., February, 2024

2023
Computing Maximal Covers for Protein Sequences.
J. Comput. Biol., February, 2023

Improved Practical Algorithms to Compute Maximal Covers.
Proceedings of the Prague Stringology Conference 2023, 2023

V-Words, Lyndon Words and Substring circ-UMFFs.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
String Covering: A Survey.
Fundam. Informaticae, 2022

Practical KMP/BM Style Pattern-Matching on Indeterminate Strings.
CoRR, 2022

2021
A new approach to regular & indeterminate strings.
Theor. Comput. Sci., 2021

Computation of the suffix array, Burrows-Wheeler transform and FM-index in <i>V</i>-order.
Theor. Comput. Sci., 2021

Longest previous overlapping factor array.
Inf. Process. Lett., 2021

A Formal Approach to Network Segmentation.
Comput. Secur., 2021

2020
A formal framework for Stringology.
Discret. Appl. Math., 2020

Simple KMP Pattern-Matching on Indeterminate Strings.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

2019
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018
String covering with optimal covers.
J. Discrete Algorithms, 2018

Frequency Covers for Strings.
Fundam. Informaticae, 2018

A Faster V-order String Comparison Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

2016
Forced Repetitions over Alphabet Lists.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
String shuffle: Circuits and graphs.
J. Discrete Algorithms, 2015

Non-repetitive Strings over Alphabet Lists.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015


  Loading...