Kamala Krithivasan

According to our database1, Kamala Krithivasan
  • authored at least 103 papers between 1972 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

A Centrality Entropy Maximization Problem in Shortest Path Routing Networks.
Computer Networks, 2016

2014
Tree topology inference from leaf-to-leaf path lengths using Prüfer sequence.
IJCNDS, 2014

On Controlled P Systems.
Fundam. Inform., 2014

Spiking Neural P Systems with Cooperating Rules.
Proceedings of the Membrane Computing, 2014

Small Universal Spiking Neural P Systems with Cooperating Rules as Function Computing Devices.
Proceedings of the Membrane Computing, 2014

An entropy maximization problem in shortest path routing networks.
Proceedings of the 20th IEEE International Workshop on Local & Metropolitan Area Networks, 2014

2013
Binding-blocking automata.
Int. J. Comput. Math., 2013

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

Control Languages Associated with Tissue P Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Distance realization problem in Network Tomography: A heuristic approach.
Proceedings of the IEEE International Conference on Advanced Networks and Telecommunications Systems, 2013

2012
A Variant of Distributed P Systems for Real Time Cross Layer Optimization.
J. UCS, 2012

Control Words of Transition P Systems.
Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012), 2012

Weighted Finite Automata and Digital Images.
Modern Applications of Automata Theory, 2012

2011
Modelling and analysis of spiking neural P systems with anti-spikes using Pnet lab.
Nano Comm. Netw., 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

On String Languages Generated by Spiking Neural P Systems with Anti-Spikes.
Int. J. Found. Comput. Sci., 2011

An Adaptive e-Learning Environment Using Distributed Spiking Neural P Systems.
Proceedings of the 2011 IEEE International Conference on Technology for Education, 2011

Real time cross layer design using particle swarm optimization.
Proceedings of the 4th Bangalore Annual Compute Conference, Compute 2011, 2011

Clique-Detection Algorithm Using Clique-Self-Assembly.
Proceedings of the Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011

2010
Representation of Spiking Neural P Systems with Anti-spikes through Petri Nets.
Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 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
Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules.
Int. J. Comput. Math., 2009

Modeling Spiking Neural P Systems using Timed Petri Nets.
Proceedings of the World Congress on Nature & Biologically Inspired Computing, 2009

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

2008
Graph Splicing Systems.
Proceedings of the International Conference on Theoretical and Mathematical Foundations of Computer Science, 2008

A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images.
Proceedings of the Combinatorial Image Analysis, 12th International Workshop, 2008

Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images.
Proceedings of the Advances in Visual Computing, 4th International Symposium, 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
Returning and non-returning parallel communicating finite automata are equivalent.
ITA, 2007

Network of evolutionary processors with splicing rules and permitting context.
Biosystems, 2007

Learning Algorithms for Grammars of Variable Arity Trees.
Proceedings of the Sixth International Conference on Machine Learning and Applications, 2007

Self-assembly of graphs.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

Hexagonal Contextual Array P Systems.
Proceedings of the Formal Models, 2007

2006
Graph splicing systems.
Discrete Applied Mathematics, 2006

An Efficient Reconstruction of 2D-Tiling with t1, 2, t2, 1, t1, 1 Tiles.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Communicating Distributed H systems with Simple Splicing Rules.
Proceedings of the 2006 International Conference on Computer Design & Conference on Computing in Nanotechnology, 2006

2005
Local and recognizable hexagonal picture languages.
IJPRAI, 2005

On Characterizing Recursively Enumerable Languages by Insertion Grammars.
Fundam. Inform., 2005

Binary 3D-Matrices Under the Microscope: A Tomographical Problem.
Electronic Notes in Discrete Mathematics, 2005

Network of Evolutionary Processors with Splicing Rules and Forbidding Context.
Proceedings of the Mechanisms, 2005

Network of Evolutionary Processors with Splicing Rules.
Proceedings of the Mechanisms, 2005

2004
Rewriting Tissue P Systems.
J. UCS, 2004

Length Synchronization Context-Free Grammars.
Journal of Automata, Languages and Combinatorics, 2004

An optimal algorithm for one-separation of a set of isothetic polygons.
Inf. Sci., 2004

Contextual array P systems.
Int. J. Comput. Math., 2004

Hexagonal Pattern Languages.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

Leftmost Rewriting Tissue P Systems.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

Realizing Switching Functions Using Peptide-Antibody Interactions.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Some Variants in Communication of Parallel Communicating Pushdown Automata.
Journal of Automata, Languages and Combinatorics, 2003

Distributed varpi -Automata.
Int. J. Found. Comput. Sci., 2003

On a class of P automata.
Int. J. Comput. Math., 2003

On Minimising P Finite State Automata.
Bulletin of the EATCS, 2003

P Systems Generating Hexagonal Picture Languages.
Proceedings of the Membrane Computing, International Workshop, 2003

2002
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2002

Probabilistic Parallel Communicating Grammar Systems.
Int. J. Comput. Math., 2002

A Note on Hybrid P Systems.
Grammars, 2002

Contextual P Systems.
Fundam. Inform., 2002

Improved Results about Universality of P systems.
Bulletin of the EATCS, 2002

Generalized normal form for rewriting P systems.
Acta Inf., 2002

A Survey of Some Variants of P Systems.
Proceedings of the Membrane Computing, International Workshop, 2002

2001
Fuzzy omega-automata.
Inf. Sci., 2001

Minimum area polygons with two reflex angles enclosing k Points.
Int. J. Comput. Math., 2001

Image representation using distributed weighted finite automata.
Electr. Notes Theor. Comput. Sci., 2001

P Systems with Picture Objects.
Acta Cybern., 2001

P Systems with Membrane Creation: Universality and Efficiency.
Proceedings of the Machines, 2001

Peptide Computing - Universality and Complexity.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

On the Number of Rules in Components of Cooperating Distributed Grammar Systems with Probabilities.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

Simplified simple H systems.
Proceedings of the Where Mathematics, 2001

2000
On the Generative Power of Simple H Systems.
Journal of Automata, Languages and Combinatorics, 2000

Finite Automata and Digital Images.
IJPRAI, 2000

Universality Results for Some Variants of P Systems.
Proceedings of the Multiset Processing, 2000

Array Contextual Grammars.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Distributed Processing in Automata.
Int. J. Found. Comput. Sci., 1999

1998
Pattern Matching in Matrix Grammars.
Journal of Automata, Languages and Combinatorics, 1998

1997
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One.
Bulletin of the EATCS, 1997

A workload characterization methodology for WWW applications.
Proceedings of the Performance and Management of Complex Communication Networks, 1997

An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Array Splicing Systems.
Proceedings of the New Trends in Formal Languages, 1997

1996
Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.
Theor. Comput. Sci., 1995

An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.
Nord. J. Comput., 1995

Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993
Language Classes Defined by Time-Bounded Relativised Cellular Automata.
ITA, 1993

Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.
Proceedings of the Developments in Language Theory, 1993

1991
Fastest Path Across Constrained Moving Rectilinear Obstacles.
Inf. Process. Lett., 1991

Relativised Cellular Automata and Complexity Classes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989
Application of L-Systems to Algorithmic Generation of South Indian Folk Art Patterns and Karnatic Music.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Hexagonal Cellular Automata.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Systolic Pyramid Automata, Cellular Automata and Array Languages.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton.
ITA, 1989

Systolic Pyramid Automata, Cellular Automata and Array Languages.
IJPRAI, 1989

1988
Path Planning with Local Information.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987
Efficient two-dimensional pattern matching in the presence of errors.
Inf. Sci., 1987

1985
Context dependent table matrix L systems.
Inf. Sci., 1985

Terminal weighted grammars and picture description.
Computer Vision, Graphics, and Image Processing, 1985

1984
Treating Terminals as Function Values of Time.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1974
Parallel Context-Free Languages
Information and Control, February, 1974

Array Grammars and Kolam.
Computer Graphics and Image Processing, 1974

1973
Picture Languages with Array Rewriting Rules
Information and Control, June, 1973

1972
Abstract families of matrices and picture languages.
Computer Graphics and Image Processing, 1972


  Loading...