|
Search the dblp DataBase
Kamala Krithivasan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- M. Sakthi Balan, Kamala Krithivasan
Realizing Switching Functions Using Peptide-Antibody Interactions. [Citation Graph (0, 0)][DBLP] Aspects of Molecular Computing, 2004, pp:353-360 [Conf]
- Kamala Krithivasan, M. Sakthi Balan, Raghavan Rama
Array Contextual Grammars. [Citation Graph (0, 0)][DBLP] Recent Topics in Mathematical and Computational Linguistics, 2000, pp:154-168 [Conf]
- Kamala Krithivasan, Venkatesan T. Chakaravarthy, Raghavan Rama
Array Splicing Systems. [Citation Graph (0, 0)][DBLP] New Trends in Formal Languages, 1997, pp:346-365 [Conf]
- Kamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar
Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles. [Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:149-154 [Conf]
- Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur
Communicating Distributed H systems with Simple Splicing Rules. [Citation Graph (0, 0)][DBLP] CDES, 2006, pp:107-111 [Conf]
- Amitava Datta, Kamala Krithivasan, Thomas Ottmann
An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. [Citation Graph (0, 0)][DBLP] CIAC, 1997, pp:110-121 [Conf]
- V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. [Citation Graph (0, 0)][DBLP] COCOON, 1995, pp:71-80 [Conf]
- Kamala Krithivasan, Meena Mahajan
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1993, pp:342-354 [Conf]
- M. Sakthi Balan, Kamala Krithivasan, Y. Sivasubrmanyam
Peptide Computing - Universality and Complexity. [Citation Graph (0, 0)][DBLP] DNA, 2001, pp:290-299 [Conf]
- Amitava Datta, Kamala Krithivasan
Path Planning with Local Information. [Citation Graph (0, 0)][DBLP] FSTTCS, 1988, pp:108-121 [Conf]
- Kamala Krithivasan
Treating Terminals as Function Values of Time. [Citation Graph (0, 0)][DBLP] FSTTCS, 1984, pp:188-201 [Conf]
- Meena Mahajan, Kamala Krithivasan
Relativised Cellular Automata and Complexity Classes. [Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:172-185 [Conf]
- Amitava Datta, Kamala Krithivasan
Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures. [Citation Graph (0, 0)][DBLP] ICPP (3), 1990, pp:344-345 [Conf]
- Gabriele Kotsis, Kamala Krithivasan, S. V. Raghavan
A workload characterization methodology for WWW applications. [Citation Graph (0, 0)][DBLP] PMCCN, 1997, pp:137-153 [Conf]
- Masilamani Vedhanayagam, Kamala Krithivasan
An Efficient Reconstruction of 2D-Tiling with t1, 2, t2, 1, t1, 1 Tiles. [Citation Graph (0, 0)][DBLP] IWCIA, 2006, pp:474-480 [Conf]
- K. S. Dersanambika, Kamala Krithivasan, Carlos Martín-Vide, K. G. Subramanian
Hexagonal Pattern Languages. [Citation Graph (0, 0)][DBLP] IWCIA, 2004, pp:52-64 [Conf]
- Ashish Choudhary, Kamala Krithivasan
Network of Evolutionary Processors with Splicing Rules. [Citation Graph (0, 0)][DBLP] IWINAC (1), 2005, pp:290-299 [Conf]
- Ashish Choudhary, Kamala Krithivasan
Network of Evolutionary Processors with Splicing Rules and Forbidding Context. [Citation Graph (0, 0)][DBLP] IWINAC (1), 2005, pp:300-309 [Conf]
- Madhu Mutyam, Kamala Krithivasan
P Systems with Membrane Creation: Universality and Efficiency. [Citation Graph (0, 0)][DBLP] MCU, 2001, pp:276-287 [Conf]
- K. S. Dersanambika, Kamala Krithivasan, K. G. Subramanian
P Systems Generating Hexagonal Picture Languages. [Citation Graph (0, 0)][DBLP] Workshop on Membrane Computing, 2003, pp:168-180 [Conf]
- Madhu Mutyam, Kamala Krithivasan
Universality Results for Some Variants of P Systems. [Citation Graph (0, 0)][DBLP] WMP, 2000, pp:237-254 [Conf]
- Madhu Mutyam, Kamala Krithivasan
A Survey of Some Variants of P Systems. [Citation Graph (0, 0)][DBLP] WMC-CdeA, 2002, pp:360-370 [Conf]
- Madhu Mutyam, Kamala Krithivasan
Generalized normal form for rewriting P systems. [Citation Graph (0, 0)][DBLP] Acta Inf., 2002, v:38, n:10, pp:721-734 [Journal]
- Shankara Narayanan Krishna, Raghavan Rama, Kamala Krithivasan
P Systems with Picture Objects. [Citation Graph (0, 0)][DBLP] Acta Cybern., 2001, v:15, n:1, pp:53-74 [Journal]
- Kamala Krithivasan, Anindya Das
Terminal weighted grammars and picture description. [Citation Graph (0, 0)][DBLP] Computer Vision, Graphics, and Image Processing, 1985, v:30, n:1, pp:13-31 [Journal]
- Rahul Santhanam, Kamala Krithivasan
Graph splicing systems. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:8, pp:1264-1278 [Journal]
- Venkatesan T. Chakaravarthy, Kamala Krithivasan
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal]
- Kamala Krithivasan, Sandeep V. Varma
On Minimising P Finite State Automata. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2003, v:80, n:, pp:168-173 [Journal]
- Madhu Mutyam, Kamala Krithivasan
Improved Results about Universality of P systems. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2002, v:76, n:, pp:162-168 [Journal]
- Y. Sivasubramanyam, Kamala Krithivasan
Image representation using distributed weighted finite automata. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:46, n:, pp:- [Journal]
- Kamala Krithivasan, Madhu Mutyam
Contextual P Systems. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2002, v:49, n:1-3, pp:179-189 [Journal]
- Madhu Mutyam, Kamala Krithivasan
A Note on Hybrid P Systems. [Citation Graph (0, 0)][DBLP] Grammars, 2002, v:5, n:3, pp:239-244 [Journal]
- Rani Siromoney, Kamala Krithivasan
Parallel Context-Free Languages [Citation Graph (0, 0)][DBLP] Information and Control, 1974, v:24, n:2, pp:155-162 [Journal]
- Gift Siromoney, Rani Siromoney, Kamala Krithivasan
Picture Languages with Array Rewriting Rules [Citation Graph (0, 0)][DBLP] Information and Control, 1973, v:22, n:5, pp:447-470 [Journal]
- K. S. Dersanambika, Kamala Krithivasan
Contextual array P systems. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2004, v:81, n:8, pp:955-969 [Journal]
- K. Arthi, Kamala Krithivasan
Probabilistic Parallel Communicating Grammar Systems. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2002, v:79, n:1, pp:1-26 [Journal]
- Madhu Mutyam, Kamala Krithivasan
On a class of P automata. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Math., 2003, v:80, n:9, pp:1111-1120 [Journal]
- Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha
Distributed Processing in Automata. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:443-464 [Journal]
- Kamala Krithivasan, K. Sharda, Sandeep V. Varma
Distributed varpi -Automata. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2003, v:14, n:4, pp:681-698 [Journal]
- K. S. Dersanambika, Kamala Krithivasan, Carlos Martín-Vide, K. G. Subramanian
Local and recognizable hexagonal picture languages. [Citation Graph (0, 0)][DBLP] IJPRAI, 2005, v:19, n:7, pp:853-871 [Journal]
- S. V. Ramasubramanian, Kamala Krithivasan
Finite Automata and Digital Images. [Citation Graph (0, 0)][DBLP] IJPRAI, 2000, v:14, n:4, pp:501-524 [Journal]
- R. Srikant, Kamala Krithivasan
Fastest Path Across Constrained Moving Rectilinear Obstacles. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:37, n:6, pp:349-353 [Journal]
- Amitava Datta, Kamala Krithivasan, Thomas Ottmann
An optimal algorithm for one-separation of a set of isothetic polygons. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2004, v:164, n:1-4, pp:65-88 [Journal]
- Kamala Krithivasan, K. Sharda
Fuzzy omega-automata. [Citation Graph (0, 0)][DBLP] Inf. Sci., 2001, v:138, n:1-4, pp:257-281 [Journal]
- Kamala Krithivasan, R. Sitalakshmi
Efficient two-dimensional pattern matching in the presence of errors. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1987, v:43, n:3, pp:169-184 [Journal]
- Nalinakshi Nirmal, Kamala Krithivasan
Context dependent table matrix L systems. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1985, v:36, n:3, pp:249-265 [Journal]
- Meena Mahajan, Kamala Krithivasan
Language Classes Defined by Time-Bounded Relativised Cellular Automata. [Citation Graph (0, 0)][DBLP] ITA, 1993, v:27, n:5, pp:403-432 [Journal]
- Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan
Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton. [Citation Graph (0, 0)][DBLP] ITA, 1989, v:23, n:3, pp:251-279 [Journal]
- K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:433-446 [Journal]
- M. Sakthi Balan, Kamala Krithivasan, Madhu Mutyam
Some Variants in Communication of Parallel Communicating Pushdown Automata. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2003, v:8, n:3, pp:401-416 [Journal]
- Viswanathan Radhakrishnan, Venkatesan T. Chakaravarthy, Kamala Krithivasan
Pattern Matching in Matrix Grammars. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1998, v:3, n:1, pp:59-76 [Journal]
- Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan
On the Generative Power of Simple H Systems. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2000, v:5, n:4, pp:457-0 [Journal]
- Madhu Mutyam, Vaka Jaya Prakash, Kamala Krithivasan
Rewriting Tissue P Systems. [Citation Graph (0, 0)][DBLP] J. UCS, 2004, v:10, n:9, pp:1250-1271 [Journal]
- V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets. [Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1995, v:2, n:1, pp:28-40 [Journal]
- Kamala Krithivasan, Meena Mahajan
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:143, n:1, pp:23-49 [Journal]
- Madhu Mutyam, Kamala Krithivasan, A. Siddhartha Reddy
On Characterizing Recursively Enumerable Languages by Insertion Grammars. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2005, v:64, n:1-4, pp:317-324 [Journal]
Learning Algorithms for Grammars of Variable Arity Trees. [Citation Graph (, )][DBLP]
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. [Citation Graph (, )][DBLP]
Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images. [Citation Graph (, )][DBLP]
A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images. [Citation Graph (, )][DBLP]
Self-assembly of graphs. [Citation Graph (, )][DBLP]
Graph Splicing Systems. [Citation Graph (, )][DBLP]
Search in 0.037secs, Finished in 0.039secs
|