Lakshmanan Kuppusamy
According to our database^{1},
Lakshmanan Kuppusamy
authored at least 43 papers
between 2002 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2019
On pathcontrolled insertiondeletion systems.
Acta Inf., 2019
On Matrix InsDel Systems of Small SumNorm.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 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 insertiondeletion 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 ContextFree.
Journal of Automata, Languages and Combinatorics, 2018
On describing the regular closure of the linear languages with graphcontrolled insertiondeletion systems.
RAIRO  Theor. Inf. and Applic., 2018
Computational Completeness of Simple Semiconditional InsertionDeletion Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018
Minimizing Rules and Nonterminals in Semiconditional Grammars: Nontrivial for the Simple Case.
Proceedings of the Machines, Computations, and Universality  8th International Conference, 2018
New Nonterminal Complexity Results for Semiconditional Grammars.
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
On the computational completeness of graphcontrolled insertiondeletion systems with binary sizes.
Theor. Comput. Sci., 2017
On the Generative Power of GraphControlled InsertionDeletion Systems with Small Sizes.
Journal of Automata, Languages and Combinatorics, 2017
Computational Completeness of PathStructured GraphControlled InsertionDeletion 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 InsDel 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
GraphControlled InsertionDeletion 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 ContextFree Languages by InsDel and Matrix InsDel Systems.
Int. J. Found. Comput. Sci., 2016
Modelling DNA and RNA secondary structures using matrix insertiondeletion systems.
Applied Mathematics and Computer Science, 2016
Generative Power of Matrix InsertionDeletion Systems with ContextFree Insertion or Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2016
1Normal 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 GraphControlled InsertionDeletion Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2016
2014
EdgeDisjoint Fibonacci Trees in Hypercube.
Journal Comp. Netw. and Communic., 2014
2013
On the Tradeoff Between Ambiguity and Complexity in Contextual Languages.
Fundam. Inform., 2013
2011
On the study of ambiguity and the tradeoff between measures and ambiguity in insertiondeletion languages.
Nano Comm. Netw., 2011
On the Ambiguity of Insertion Systems.
Int. J. Found. Comput. Sci., 2011
Matrix InsertionDeletion Systems for BioMolecular Structures.
Proceedings of the Distributed Computing and Internet Technology, 2011
Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix InsertionDeletion Systems.
Proceedings of the Biology, Computation and Linguistics  New Interdisciplinary Paradigms, 2011
2010
On the Ambiguity and Complexity Measures of InsertionDeletion Systems.
Proceedings of the BioInspired 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 (TARK2009), 2009
On the Relative Expressive Power of Contextual Grammars with Maximal and DepthFirst Derivations.
Proceedings of the Theoretical Aspects of Computing, 2009
2008
On the TradeOff 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
EndMarked Maximal DepthFirst 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 FiniteState 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