Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Krithivasan, Kamala"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On string languages generated by spiking neural P systems with anti-spikes
Kamala Krithivasan
,
Venkata Padmavati Metta
,
Deepak Garg
International Journal of Foundations of Computer Science
22
(1), 2011, pp. 15-27
On the ambiguity of insertion systems
Lakshmanan Kuppusamy
,
Anand Mahendran
,
Kamala Krithivasan
International Journal of Foundations of Computer Science
22
(7), 2011, pp. 1747-1758
Distributed
\omega
-automata
Kamala Krithivasan
,
K. Sharda
,
Sandeep V. Varma
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 681-698
Generalized normal form for rewriting
P
systems
Mutyam Madhu
,
Kamala Krithivasan
Acta Informatica
38
(10), 2002, pp. 721-734
Distributed processing in automata
Kamala Krithivasan
,
M. Sakthi Balan
,
Prahladh Harsha
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 443-463
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
Array splicing systems
Kamala Krithivasan
,
Venkatesan T. Chakaravarthy
,
Raghavan Rama
Lecture Notes in Computer Science
1218
, 1997, pp. 346-365
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
V. Kamakoti
,
Kamala Krithivasan
,
C. Pandu Rangan
Lecture Notes in Computer Science
959
, 1995, pp. 71-80
Nondeterministic, probabilistic and alternating computations on cellular array models
Kamala Krithivasan
,
Meena Mahajan
Theoretical Computer Science
143
(1), 1995, pp. 23-49
Relativised cellular automata and complexity classes
Meena Mahajan
,
Kamala Krithivasan
Lecture Notes in Computer Science
560
, 1991, pp. 172-185
Fastest path across constrained moving rectilinear obstacles
R. Srikant
,
Kamala Krithivasan
Information Processing Letters
37
, 1991, pp. 349-353
Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures
Amitava Datta
,
Kamala Krithivasan
Proceedings of the 1990 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'90 (St.~Charles, IL, August 13-17, 1990)
, 1990, pp. 344-345
Path planning with local information
Amitava Datta
,
Kamala Krithivasan
Lecture Notes in Computer Science
338
, 1988, pp. 108-121
Growth functions and syntactic inference of deterministic graph OL systems
Kamala Krithivasan
,
S. Kalavathi
,
Anindya Das
Applied Computer Science
, 1985, pp. 181-190
Single successor context-free graph grammar and application to flowchart compilation
Kamala Krithivasan
,
Usha B. Menon
Applied Computer Science
, 1985, pp. 191-200
Treating terminals as function values of time
Kamala Krithivasan
,
Anindya Das
Lecture Notes in Computer Science
181
, 1984, pp. 188-201
Paralle context-free languages
Rani Siromoney
,
Kamala Krithivasan
Information and Control
24
, 1974, pp. 155-162
Picture languages with array rewriting rules
Gift Siromoney
,
Rani Siromoney
,
Kamala Krithivasan
Information and Control
22
, 1973, pp. 447-470