default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIndhumathi Raman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Henning Fernau
, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of generalized forbidding matrix grammars. Theor. Comput. Sci. 999: 114539 (2024)- 2022
- [j16]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319: 2-18 (2022) - [j15]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of matrix simple semi-conditional grammars. Inf. Comput. 284: 104688 (2022) - 2021
- [j14]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) - [j13]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) - 2019
- [j12]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On path-controlled insertion-deletion systems. Acta Informatica 56(1): 35-59 (2019) - [j11]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) - 2018
- [j10]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) - [j9]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Properties of Language Classes Between Linear and Context-Free. J. Autom. Lang. Comb. 23(4): 329-360 (2018) - [j8]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) - 2017
- [j7]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) - [j6]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) - 2016
- [j5]Indhumathi Raman:
Certain height-balanced subtrees of hypercubes. Int. J. Comput. Math. Comput. Syst. Theory 1(1): 32-41 (2016) - [j4]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) - 2014
- [j3]Indhumathi Raman, Lakshmanan Kuppusamy:
Edge-Disjoint Fibonacci Trees in Hypercube. J. Comput. Networks Commun. 2014: 498349:1-498349:4 (2014) - 2013
- [j2]Indhumathi Raman, Sheshayya A. Choudum:
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes. J. Discrete Algorithms 22: 53-65 (2013) - 2009
- [j1]Sheshayya A. Choudum, Indhumathi Raman:
On embedding subclasses of height-balanced trees in hypercubes. Inf. Sci. 179(9): 1333-1347 (2009)
Conference and Workshop Papers
- 2024
- [c14]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Counting Simple Rules in Semi-conditional Grammars is not Simple. CiE 2024: 192-204 - 2023
- [c13]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
When Stars Control a Grammar's Work. AFL 2023: 96-111 - 2020
- [c12]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the Power of Generalized Forbidding Insertion-Deletion Systems. DCFS 2020: 52-63 - [c11]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective. Int. Conf. on Membrane Computing 2020: 31-45 - 2019
- [c10]Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results on Generalized Forbidding Grammars. CALDAM 2019: 174-188 - [c9]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Matrix Simple Semi-conditional Grammars. DCFS 2019: 111-123 - [c8]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On Matrix Ins-Del Systems of Small Sum-Norm. SOFSEM 2019: 192-205 - 2018
- [c7]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 - [c6]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems. UCNC 2018: 86-100 - 2017
- [c5]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity. DCFS 2017: 128-139 - [c4]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. CIAA 2017: 89-100 - 2016
- [c3]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. DCFS 2016: 111-125 - [c2]Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion. UCNC 2016: 35-48 - 2013
- [c1]Indhumathi Raman:
On Embedding of Certain Recursive Trees and Stars into Hypercube. WALCOM 2013: 322-333
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 2024-08-03 21:16 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:
