Browse by Journal / Conference

Bhattacharyya, A and Gadekar, A and Rajgopal, N (2020) Improved learning of k-parities. In: Theoretical Computer Science, 840 . pp. 249-256.

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2011) Popular mixed matchings. In: Theoretical Computer Science, 412 (24). pp. 2679-2690.

Kavitha, Telikepalli and Nasre, Meghana (2011) Popular matchings with variable item copies. In: Theoretical Computer Science, 412 (12-14). pp. 1263-1274.

Garg, Dinesh and Jain, Kamal and Talwar, Kunal and Vazirani, Vijay V (2007) A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. In: Theoretical Computer Science, 378 (2). pp. 143-152.

Chandran, Sunil L and Ram, Shankar L (2007) On the relationship between ATSP and the cycle cover problem. In: Theoretical Computer Science, 370 (1-3). pp. 218-228.

Chandran, LS and Ibarra, L and Ruskey, F and Sawada, J (2003) Generating and characterizing the perfect elimination orderings of a chordal graph. In: Theoretical Computer Science, 307 (2). pp. 303-317.

Shankar, Priti and Dasgupta, Amitava and Deshmukh, Kaustubh and Rajan, Sundar B (2003) On viewing block codes as finite automata. In: Theoretical Computer Science, 290 (3). pp. 1775-1797.

Shankar, Priti and Gantait, Amitranjan and Yuvaraj, AR and Madhavan, Maya (2000) A new algorithm for linear regular tree pattern matching. In: Theoretical Computer Science, 242 (1-2). pp. 125-142.

Allender, Eric and Jiao, Jia and Mahajan, Meena and Vinay, V (1998) Non-commutative arithmetic circuits: depth reduction and size lower bounds. In: Theoretical Computer Science, 209 (1-2). pp. 47-86.

Kulkarni, Sulekha R and Shankar, Priti (1996) Linear time parsers for classes of non context free languages. In: Theoretical Computer Science, 165 (2). pp. 355-390.

Dattasharma, Abhi and Keerthi, Sathiya S (1995) An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles. In: Theoretical Computer Science, 140 (2). pp. 205-230.

Shankar, Priti and Adiga, BS (1992) A graph-based regularity test for deterministic context-free languages. In: Theoretical Computer Science, 95 (2). pp. 339-340.

Lakshmanan, VS (1988) Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers. In: Theoretical Computer Science, 62 (1-2). pp. 105-122.

Lakshmanan, VS and Madhavan, Veni CE (1987) An algebraic theory of functional and multivalued dependencies in relational databases. In: Theoretical Computer Science, 54 (1). pp. 103-128.

Madhavan, CE Veni (1984) Secondary attribute retrieval using tree data structures. In: Theoretical Computer Science, 33 (1). pp. 107-116.

Nambiar, KK and Radhakrishan, T and Tikekar, VG (1983) Representation of functional dependencies in relational databases using linear graphs. In: Theoretical Computer Science, 24 (2). pp. 143-159.