default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeerja Mhaskar
Person information
- affiliation: McMaster University
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Mohammed Alabbad, Neerja Mhaskar, Ridha Khédri:
Two formal design solutions for the generalization of network segmentation. J. Netw. Comput. Appl. 222: 103763 (2024)- [j11]Mohammed Alabbad
, Neerja Mhaskar, Ridha Khédri:
Hardening of network segmentation using automated referential penetration testing. J. Netw. Comput. Appl. 224: 103851 (2024) - [i4]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Galois Words. CoRR abs/2409.02757 (2024) - 2023
- [j10]Geoffrey Brian Golding, Holly Koponen, Neerja Mhaskar, W. F. Smyth:
Computing Maximal Covers for Protein Sequences. J. Comput. Biol. 30(2): 149-160 (2023) - [c8]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
V-Words, Lyndon Words and Substring circ-UMFFs. COCOA (1) 2023: 471-484 - [c7]Holly Koponen, Mhaskar Neerja, William F. Smyth:
Improved Practical Algorithms to Compute Maximal Covers. PSC 2023: 30-41 - 2022
- [j9]Neerja Mhaskar, W. F. Smyth:
String Covering: A Survey. Fundam. Informaticae 190(1): 17-45 (2022) - [i3]Hossein Dehghani, Neerja Mhaskar, W. F. Smyth:
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings. CoRR abs/2204.08331 (2022) - [i2]Neerja Mhaskar, William F. Smyth:
String Covering: A Survey. CoRR abs/2211.11856 (2022) - 2021
- [j8]Neerja Mhaskar, Mohammed Alabbad, Ridha Khédri:
A Formal Approach to Network Segmentation. Comput. Secur. 103: 102162 (2021) - [j7]Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. Inf. Process. Lett. 168: 106097 (2021) - [j6]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A new approach to regular & indeterminate strings. Theor. Comput. Sci. 854: 105-115 (2021) - [j5]Jacqueline W. Daykin, Neerja Mhaskar, W. F. Smyth:
Computation of the suffix array, Burrows-Wheeler transform and FM-index in V-order. Theor. Comput. Sci. 880: 82-96 (2021) - 2020
- [j4]Michael Soltys, Neerja Mhaskar:
A formal framework for Stringology. Discret. Appl. Math. 274: 141-151 (2020) - [c6]Mhaskar Neerja, William F. Smyth:
Simple KMP Pattern-Matching on Indeterminate Strings. Stringology 2020: 125-133 - [i1]Felipe A. Louza, Neerja Mhaskar, W. F. Smyth:
A New Approach to Regular & Indeterminate Strings. CoRR abs/2012.07892 (2020)
2010 – 2019
- 2019
- [c5]Ali Alatabbi, Jacqueline W. Daykin, Neerja Mhaskar, M. Sohel Rahman, W. F. Smyth:
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index. WALCOM 2019: 329-338 - 2018
- [j3]Neerja Mhaskar, W. F. Smyth:
Frequency Covers for Strings. Fundam. Informaticae 163(3): 275-289 (2018) - [j2]Neerja Mhaskar, William F. Smyth:
String covering with optimal covers. J. Discrete Algorithms 51: 26-38 (2018) - [c4]Ali Alatabbi, Jacqueline W. Daykin, Mhaskar Neerja, Mohammad Sohel Rahman, William F. Smyth:
A Faster V-order String Comparison Algorithm. Stringology 2018: 38-48 - 2016
- [c3]Neerja Mhaskar, Michael Soltys:
Forced Repetitions over Alphabet Lists. Stringology 2016: 125-134 - 2015
- [j1]Neerja Mhaskar, Michael Soltys:
String shuffle: Circuits and graphs. J. Discrete Algorithms 31: 120-128 (2015) - [c2]Neerja Mhaskar, Michael Soltys:
A Formal Framework for Stringology. Stringology 2015: 90-103 - [c1]Neerja Mhaskar, Michael Soltys:
Non-repetitive Strings over Alphabet Lists. WALCOM 2015: 270-281
Coauthor Index
aka: W. F. Smyth
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-10-07 02:38 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:
