Lakshmanan Kuppusamy

According to our database1, Lakshmanan Kuppusamy authored at least 45 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On path-controlled insertion-deletion systems.
Acta Inf., 2019

On Matrix Ins-Del Systems of Small Sum-Norm.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Descriptional Complexity of Matrix Simple Semi-conditional Grammars.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

Improved Descriptional Complexity Results on Generalized Forbidding Grammars.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Investigations on the power of matrix insertion-deletion systems with small sizes.
Natural Computing, 2018

Overlapping community detection in social networks using coalitional games.
Knowl. Inf. Syst., 2018

Properties of Language Classes Between Linear and Context-Free.
Journal of Automata, Languages and Combinatorics, 2018

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.
RAIRO - Theor. Inf. and Applic., 2018

Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

An Augmented Algorithm for Energy Efficient Clustering.
Proceedings of the Intelligent Systems Design and Applications, 2018

New Nonterminal Complexity Results for Semi-conditional Grammars.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theor. Comput. Sci., 2017

On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.
Journal of Automata, Languages and Combinatorics, 2017

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Implementation and Application of Automata, 2017

Universal Matrix Insertion Grammars with Small Size.
Proceedings of the Unconventional Computation and Natural Computation, 2017

Parikh Images of Matrix Ins-Del Systems.
Proceedings of the Theory and Applications of Models of Computation, 2017

Mining Communities in Directed Networks: A Game Theoretic Approach.
Proceedings of the Intelligent Systems Design and Applications, 2017

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
A survey on game theoretic models for community detection in social networks.
Social Netw. Analys. Mining, 2016

On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems.
Int. J. Found. Comput. Sci., 2016

Modelling DNA and RNA secondary structures using matrix insertion-deletion systems.
Applied Mathematics and Computer Science, 2016

Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2016

1-Normal DRA for Insertion Languages.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Formal Language Representation and Modelling Structures Underlying RNA Folding Process.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2014
Edge-Disjoint Fibonacci Trees in Hypercube.
Journal Comp. Netw. and Communic., 2014

2013
On the Trade-off Between Ambiguity and Complexity in Contextual Languages.
Fundam. Inform., 2013

2011
On the study of ambiguity and the trade-off between measures and ambiguity in insertion-deletion languages.
Nano Comm. Netw., 2011

On the Ambiguity of Insertion Systems.
Int. J. Found. Comput. Sci., 2011

Matrix Insertion-Deletion Systems for Bio-Molecular Structures.
Proceedings of the Distributed Computing and Internet Technology, 2011

Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix Insertion-Deletion Systems.
Proceedings of the Biology, Computation and Linguistics - New Interdisciplinary Paradigms, 2011

2010
On the Ambiguity and Complexity Measures of Insertion-Deletion Systems.
Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2010

2009
Verifying epistemic protocols under common knowledge.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations.
Proceedings of the Theoretical Aspects of Computing, 2009

2008
On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
The Computational Efficiency of Insertion Deletion Tissue P Systems.
Proceedings of the Formal Models, 2007

2006
A note on ambiguity of internal contextual grammars.
Theor. Comput. Sci., 2006

End-Marked Maximal Depth-First Contextual Grammars.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
Further Results on Syntactic Ambiguity of Internal Contextual Grammars.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

Incompatible Measures of Internal Contextual Grammars.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2003
On Some Classes of Contextual Grammars.
Int. J. Comput. Math., 2003

Descriptional Complexity of Rewriting Tissue P Systems.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
On the Power of P Systems with Contextual Rules.
Fundam. Inform., 2002

Tissue P Systems with Contextual and Rewriting Rules.
Proceedings of the Membrane Computing, International Workshop, 2002


  Loading...