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