default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLakshmanan Kuppusamy
Person information
- affiliation: VIT University, Vellore, India
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Henning Fernau
, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of generalized forbidding matrix grammars. Theor. Comput. Sci. 999: 114539 (2024)- [c31]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Counting Simple Rules in Semi-conditional Grammars is not Simple. CiE 2024: 192-204 - [i1]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Computational Completeness of Semi-Conditional Matrix Grammars. CoRR abs/2411.15338 (2024) - 2023
- [c30]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
When Stars Control a Grammar's Work. AFL 2023: 96-111 - 2022
- [j28]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319: 2-18 (2022) - [j27]Ushus Elizebeth Zachariah, Lakshmanan Kuppusamy:
A hybrid approach to energy efficient clustering and routing in wireless sensor networks. Evol. Intell. 15(1): 593-605 (2022) - [j26]Ushus Elizebeth Zachariah, Lakshmanan Kuppusamy:
Correction to: A hybrid approach to energy efficient clustering and routing in wireless sensor networks. Evol. Intell. 15(1): 607 (2022) - [j25]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of matrix simple semi-conditional grammars. Inf. Comput. 284: 104688 (2022) - [j24]Ushus Elizebeth Zachariah, Lakshmanan Kuppusamy:
A novel approach on energy-efficient clustering protocol for wireless sensor networks. Int. J. Commun. Syst. 35(9) (2022) - 2021
- [j23]Arnab Bhattacharyya, Ashutosh Gupta, Lakshmanan Kuppusamy, Somya Mani, Ankit Shukla, Mandayam K. Srivas, Mukund Thattai:
A formal methods approach to predicting new features of the eukaryotic vesicle traffic system. Acta Informatica 58(1-2): 57-93 (2021) - [j22]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundam. Informaticae 181(2-3): 189-211 (2021) - [j21]Nalini Nagendhiran, Lakshmanan Kuppusamy:
Adaptive Drift Detection Mechanism for Non-Stationary Data Stream. J. Inf. Knowl. Manag. 20(1): 2150008 (2021) - [j20]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the generative capacity of matrix insertion-deletion systems of small sum-norm. Nat. Comput. 20(4): 671-689 (2021) - 2020
- [j19]Sergey Verlan, Henning Fernau, Lakshmanan Kuppusamy:
Universal insertion grammars of size two. Theor. Comput. Sci. 843: 153-163 (2020) - [c29]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS 2020: 52-63 - [c28]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. Int. Conf. on Membrane Computing 2020: 31-45
2010 – 2019
- 2019
- [j18]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On path-controlled insertion-deletion systems. Acta Informatica 56(1): 35-59 (2019) - [j17]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1). Nat. Comput. 18(3): 563-577 (2019) - [c27]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM 2019: 174-188 - [c26]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS 2019: 111-123 - [c25]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM 2019: 192-205 - 2018
- [j16]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. RAIRO Theor. Informatics Appl. 52(1): 1-21 (2018) - [j15]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Properties of Language Classes Between Linear and Context-Free. J. Autom. Lang. Comb. 23(4): 329-360 (2018) - [j14]Annapurna Jonnalagadda, Lakshmanan Kuppusamy:
Overlapping community detection in social networks using coalitional games. Knowl. Inf. Syst. 56(3): 637-661 (2018) - [j13]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Investigations on the power of matrix insertion-deletion systems with small sizes. Nat. Comput. 17(2): 249-269 (2018) - [c24]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele:
New Nonterminal Complexity Results for Semi-conditional Grammars. CiE 2018: 172-182 - [c23]Ushus Elizebeth Zachariah, Lakshmanan Kuppusamy:
An Augmented Algorithm for Energy Efficient Clustering. ISDA (2) 2018: 617-626 - [c22]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case. MCU 2018: 88-104 - [c21]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. UCNC 2018: 86-100 - 2017
- [j12]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes. J. Autom. Lang. Comb. 22(1-3): 61-92 (2017) - [j11]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes. Theor. Comput. Sci. 682: 100-121 (2017) - [c20]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. DCFS 2017: 128-139 - [c19]Annapurna Jonnalagadda, Lakshmanan Kuppusamy:
Mining Communities in Directed Networks: A Game Theoretic Approach. ISDA 2017: 826-835 - [c18]Henning Fernau, Lakshmanan Kuppusamy:
Parikh Images of Matrix Ins-Del Systems. TAMC 2017: 201-215 - [c17]Henning Fernau, Lakshmanan Kuppusamy, Sergey Verlan:
Universal Matrix Insertion Grammars with Small Size. UCNC 2017: 182-193 - [c16]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. CIAA 2017: 89-100 - 2016
- [j10]Lakshmanan Kuppusamy, Anand Mahendran:
Modelling DNA and RNA secondary structures using matrix insertion-deletion systems. Int. J. Appl. Math. Comput. Sci. 26(1): 245 (2016) - [j9]Lakshmanan Kuppusamy, Indhumathi Raman, Kamala Krithivasan:
On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems. Int. J. Found. Comput. Sci. 27(7): 775-786 (2016) - [j8]Annapurna Jonnalagadda, Lakshmanan Kuppusamy:
A survey on game theoretic models for community detection in social networks. Soc. Netw. Anal. Min. 6(1): 83:1-83:24 (2016) - [c15]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. DCFS 2016: 111-125 - [c14]Abhisek Midya, Lakshmanan Kuppusamy, V. S. Sumitha, Alok Kumar Pani:
1-Normal DRA for Insertion Languages. ICTCSDM 2016: 10-19 - [c13]Anand Mahendran, Lakshmanan Kuppusamy:
Formal Language Representation and Modelling Structures Underlying RNA Folding Process. ICTCSDM 2016: 20-29 - [c12]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. UCNC 2016: 35-48 - 2014
- [j7]Indhumathi Raman, Lakshmanan Kuppusamy:
Edge-Disjoint Fibonacci Trees in Hypercube. J. Comput. Networks Commun. 2014: 498349:1-498349:4 (2014) - 2013
- [j6]Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Trade-off Between Ambiguity and Complexity in Contextual Languages. Fundam. Informaticae 122(4): 315-326 (2013) - 2011
- [j5]Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Ambiguity of Insertion Systems. Int. J. Found. Comput. Sci. 22(7): 1747-1758 (2011) - [j4]Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan, Khalid Mohammed:
On the study of ambiguity and the trade-off between measures and ambiguity in insertion-deletion languages. Nano Commun. Networks 2(2-3): 106-118 (2011) - [c11]Lakshmanan Kuppusamy, Anand Mahendran, Shankara Narayanan Krishna:
Matrix Insertion-Deletion Systems for Bio-Molecular Structures. ICDCIT 2011: 301-312 - [p1]Lakshmanan Kuppusamy, Anand Mahendran, Éric Villemonte de la Clergerie:
Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix Insertion-Deletion Systems. Biology, Computation and Linguistics 2011: 71-82 - 2010
- [c10]Kamala Krithivasan, Lakshmanan Kuppusamy, Anand Mahendran, Khalid Mohammed:
On the Ambiguity and Complexity Measures of Insertion-Deletion Systems. BIONETICS 2010: 425-439
2000 – 2009
- 2009
- [c9]Lakshmanan Kuppusamy, Kamala Krithivasan:
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. ICTAC 2009: 246-260 - [c8]Yanjing Wang, Lakshmanan Kuppusamy, Jan van Eijck:
Verifying epistemic protocols under common knowledge. TARK 2009: 257-266 - 2008
- [c7]Lakshmanan Kuppusamy, Anand Mahendran, Kamala Krithivasan:
On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars. DCFS 2008: 216-223 - 2007
- [c6]Lakshmanan Kuppusamy, R. Rama:
The Computational Efficiency of Insertion Deletion Tissue P Systems. Formal Models, Languages and Applications 2007: 235-245 - 2006
- [j3]Lakshmanan Kuppusamy:
A note on ambiguity of internal contextual grammars. Theor. Comput. Sci. 369(1-3): 436-441 (2006) - [c5]Lakshmanan Kuppusamy:
End-Marked Maximal Depth-First Contextual Grammars. Developments in Language Theory 2006: 339-350 - 2005
- [c4]Lakshmanan Kuppusamy:
Incompatible Measures of Internal Contextual Grammars. DCFS 2005: 253-260 - [c3]Lakshmanan Kuppusamy:
Further Results on Syntactic Ambiguity of Internal Contextual Grammars. FSMNLP 2005: 132-143 - 2003
- [j2]Shankara Narayanan Krishna, Lakshmanan Kuppusamy, Raghavan Rama:
On Some Classes of Contextual Grammars. Int. J. Comput. Math. 80(2): 151-164 (2003) - [c2]Lakshmanan Kuppusamy, Raghavan Rama:
Descriptional Complexity of Rewriting Tissue P Systems. DCFS 2003: 150-161 - 2002
- [j1]Shankara Narayanan Krishna, Lakshmanan Kuppusamy, Raghavan Rama:
On the Power of P Systems with Contextual Rules. Fundam. Informaticae 49(1-3): 167-178 (2002) - [c1]Shankara Narayanan Krishna, Lakshmanan Kuppusamy, Raghavan Rama:
Tissue P Systems with Contextual and Rewriting Rules. WMC-CdeA 2002: 339-351
Coauthor Index
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-21 00:04 CET 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:
