Narad Rampersad
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Molecular Biology
- Mathematical Physics
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- James D. CurrieJeffrey ShallitJean‐Paul AlloucheJEFFREY SHALLITMing‐Wei WangÉmilie CharlierPaweł GawrychowskiMichel Rigo
- Topics
- semigroups and automata theory (56 papers)Algorithms and Data Compression (27 papers)Computability, Logic, AI Algorithms (15 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsArtificial Intelligence
- Journals
- SHILAP Revista de lepidopterologíaMathematics of ComputationTheoretical Computer Science
In The Last Decade
Narad Rampersad
53 papers receiving 305 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 297
- Artificial Intelligence 229
- Molecular Biology 87
- Mathematical Physics 29
- Discrete Mathematics and Combinatorics 27
Countries citing papers authored by Narad Rampersad
This map shows the geographic impact of Narad Rampersad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Narad Rampersad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Narad Rampersad more than expected).
Fields of papers citing papers by Narad Rampersad
This network shows the impact of papers produced by Narad Rampersad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Narad Rampersad. The network helps show where Narad Rampersad may publish in the future.
Co-authorship network of co-authors of Narad Rampersad
This figure shows the co-authorship network connecting the top 25 collaborators of Narad Rampersad. A scholar is included among the top collaborators of Narad Rampersad based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Narad Rampersad. Narad Rampersad is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. | 0 |
| 6 | Permutation complexity of images of Sturmian words by marked morphisms | 0 |
| 7 | 1 | |
| 8 | 4 | |
| 9 | 2 | |
| 10 | 5 | |
| 11 | 1 | |
| 12 | The minimal automaton recognizing mN in a linear numeration system | 1 |
| 13 | 3 | |
| 14 | 5 | |
| 15 | 5 | |
| 16 | 8 | |
| 17 | For each α > 2 there is an Infinite Binary Word with Critical Exponent α. | 4 |
| 18 | Avoiding Sufficiently Large Binary Patterns. | 1 |
| 19 | 3 | |
| 20 | The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially | 10 |
About Narad Rampersad
Narad Rampersad is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 63 papers that have together received 315 indexed citations. Recurring topics across this work include semigroups and automata theory (56 papers), Algorithms and Data Compression (27 papers) and Computability, Logic, AI Algorithms (15 papers). The work is most often cited by research in Computational Theory and Mathematics (297 citations), Discrete Mathematics and Combinatorics (27 citations) and Artificial Intelligence (229 citations). Narad Rampersad has collaborated with scholars based in Canada, Belgium and France. Frequent co-authors include James D. Currie, Jeffrey Shallit, Jean‐Paul Allouche, JEFFREY SHALLIT, Ming‐Wei Wang, Émilie Charlier, Paweł Gawrychowski, Michel Rigo, F. Blanchet-Sadri and Michael Domaratzki. Their work appears in journals such as SHILAP Revista de lepidopterología, Mathematics of Computation and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.