| 2012 | ||
|---|---|---|
| i3 | Rama Badrinath, C. E. Veni Madhavan: Diversity in Ranking using Negative Reinforcement. CoRR abs/1207.6600 (2012) | |
| 2011 | ||
| c30 | Rama Badrinath, Suresh Venkatasubramaniyan, C. E. Veni Madhavan: Improving Query Focused Summarization Using Look-Ahead Strategy. ECIR 2011: 641-652 | |
| c29 | V. Suresh, Avanthi Krishnamurthy, Rama Badrinath, C. E. Veni Madhavan: A Stylometric Study and Assessment of Machine Translators. IDA 2011: 364-375 | |
| c28 | V. Suresh, Ashok Veilumuthu, Avanthi Krishnamurthy, C. E. Veni Madhavan, Kaushik Nath, Sunil Arvindam: A non-syntactic approach for text sentiment classification with stopwords. WWW (Companion Volume) 2011: 137-138 | |
| 2010 | ||
| c27 | R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan: Image Classification for More Reliable Steganalysis. CNSA 2010: 66-74 | |
| c26 | R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan: Cover Image Preprocessing for More Reliable LSB Replacement Steganography. ICSAP 2010: 153-156 | |
| c25 | R. Arun, V. Suresh, C. E. Veni Madhavan, M. Narasimha Murty: On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations. PAKDD (1) 2010: 391-402 | |
| 2009 | ||
| c24 | V. Suresh, H. V. Shashidhara, C. E. Veni Madhavan: A perturbative resampling approach to image steganalysis. ICUMT 2009: 1-7 | |
| c23 | R. Arun, V. Suresh, C. E. Veni Madhavan: Clustering in Concept Association Networks. PReMI 2009: 86-91 | |
| c22 | ||
| i2 | Sujit Gujar, C. E. Veni Madhavan: Measures for classification and detection in steganalysis. CoRR abs/0901.0529 (2009) | |
| 2008 | ||
| c21 | ||
| c20 | Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Low correlation interleaved QAM sequences. ISIT 2008: 1935-1939 | |
| c19 | Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan: Two New Families of Low-Correlation Interleaved QAM Sequences. SETA 2008: 130-141 | |
| 2007 | ||
| c18 | V. Suresh, Narayanan Raghupathy, B. Shekar, C. E. Veni Madhavan: Discovering Mentorship Information from Author Collaboration Networks. Discovery Science 2007: 197-208 | |
| c17 | ||
| 2006 | ||
| c16 | V. Suresh, S. Maria Sophia, C. E. Veni Madhavan: Resampling Operations as Features for Detecting LSB Replacement and LSB Matching in Color Images. MRCS 2006: 249-256 | |
| 2005 | ||
| j15 | Abhijit Das, C. E. Veni Madhavan: On the cubic sieve method for computing discrete logarithms over prime fields. Int. J. Comput. Math. 82(12): 1481-1495 (2005) | |
| e3 | Subhamoy Maitra, C. E. Veni Madhavan, Ramarathnam Venkatesan (Eds.): Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings. Lecture Notes in Computer Science 3797, Springer 2005, isbn 3-540-30805-9 | |
| 2003 | ||
| j14 | Indivar Gupta, Laxmi Narain, C. E. Veni Madhavan: Cryptological Applications of Permutation Polynomials. Electronic Notes in Discrete Mathematics 15: 91 (2003) | |
| 2002 | ||
| j13 | P. Sreenivasa Kumar, C. E. Veni Madhavan: Clique tree generalization and new subclasses of chordal graphs. Discrete Applied Mathematics 117(1-3): 109-131 (2002) | |
| j12 | C. R. Subramanian, C. E. Veni Madhavan: General Partitioning on Random Graphs. J. Algorithms 42(1): 153-172 (2002) | |
| 2001 | ||
| c15 | N. S. Narayanaswamy, C. E. Veni Madhavan: On Assigning Prefix Free Codes to the Vertices of a Graph. COCOON 2001: 328-337 | |
| i1 | N. S. Narayanaswamy, C. E. Veni Madhavan: Lower Bounds for OBDDs and Nisan's pseudorandom generator . Electronic Colloquium on Computational Complexity (ECCC) 8(20) (2001) | |
| 2000 | ||
| c14 | R. Sai Anand, C. E. Veni Madhavan: An Online, Transferable E-Cash Payment System. INDOCRYPT 2000: 93-103 | |
| 1999 | ||
| c13 | Abhijit Das, C. E. Veni Madhavan: Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. ISAAC 1999: 295-306 | |
| 1998 | ||
| j11 | P. Sreenivasa Kumar, C. E. Veni Madhavan: Minimal Vertex Separators of Chordal Graphs. Discrete Applied Mathematics 89(1-3): 155-168 (1998) | |
| j10 | C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan: Algorithms for coloring semi-random graphs. Random Struct. Algorithms 13(2): 125-158 (1998) | |
| 1995 | ||
| c12 | ||
| 1994 | ||
| j9 | Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan: An algorithm for recognizing palm polygons. The Visual Computer 10(8): 443-451 (1994) | |
| c11 | C. R. Subramanian, C. E. Veni Madhavan: Coloring Semi-Random Graphs in Polynomial Expected Time. FSTTCS 1994: 137-148 | |
| 1993 | ||
| j8 | Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3: 213-233 (1993) | |
| c10 | P. Pradeep Kumar, C. E. Veni Madhavan: Shortest Watchman Tours in Weak Visibility Polygons. CCCG 1993: 91-96 | |
| c9 | Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan: Coloring Random Graphs in Polynomial Expected Time. ISAAC 1993: 31-37 | |
| 1992 | ||
| j7 | N. Ch. Veeraraghavulu, P. Sreenivasa Kumar, C. E. Veni Madhavan: A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs. Inf. Process. Lett. 44(1): 45-49 (1992) | |
| 1991 | ||
| c8 | Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991: 369-389 | |
| 1990 | ||
| c7 | V. Vinay, H. Venkateswaran, C. E. Veni Madhavan: Circuits, Pebbling and Expressibility. Structure in Complexity Theory Conference 1990: 223-230 | |
| e2 | Kesav V. Nori, C. E. Veni Madhavan (Eds.): Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings. Lecture Notes in Computer Science 472, Springer 1990, isbn 3-540-53487-3 | |
| 1989 | ||
| j6 | Bhaskar DasGupta, C. E. Veni Madhavan: An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. Inf. Process. Lett. 33(1): 35-44 (1989) | |
| c6 | P. Sreenivasa Kumar, C. E. Veni Madhavan: A New Class of Separators and Planarity of Chordal Graphs. FSTTCS 1989: 30-43 | |
| e1 | C. E. Veni Madhavan (Ed.): Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings. Lecture Notes in Computer Science 405, Springer 1989, isbn 3-540-52048-1 | |
| 1987 | ||
| j5 | V. S. Lakshmanan, C. E. Veni Madhavan: An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. Theor. Comput. Sci. 54: 103-128 (1987) | |
| c5 | P. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan: Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. FSTTCS 1987: 65-78 | |
| 1986 | ||
| c4 | V. S. Lakshmanan, C. E. Veni Madhavan: Binary Decompositions and Acyclic Schemes. FSTTCS 1986: 214-238 | |
| 1985 | ||
| j4 | Nageswara S. V. Rao, S. Sitharama Iyengar, C. E. Veni Madhavan: A comparative study of multiple attribute tree and inverted file structures for large bibliographic files. Inf. Process. Manage. 21(5): 433-442 (1985) | |
| c3 | V. S. Lakshmanan, C. E. Veni Madhavan: The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach. FSTTCS 1985: 303-328 | |
| 1984 | ||
| j3 | C. E. Veni Madhavan: Secondary Attribute Retrieval Using Tree Data Structures. Theor. Comput. Sci. 33: 107-116 (1984) | |
| c2 | V. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan: Recognition and Top-Down Generation of beta-Acyclic Database Schemes. FSTTCS 1984: 344-366 | |
| c1 | C. E. Veni Madhavan: Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. FSTTCS 1984: 381-392 | |
| 1983 | ||
| j2 | C. E. Veni Madhavan, S. Krishna: Comments on "Optimal Design of Distributed Information Systems". IEEE Trans. Computers 32(12): 1200-1201 (1983) | |
| 1980 | ||
| j1 | V. Gopalakrishna, C. E. Veni Madhavan: Performance Evaluation of Attribute-Based Tree Organization. ACM Trans. Database Syst. 5(1): 69-87 (1980) | |
Colors in the list of coauthors
Last update Thu May 23 18:48:21 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page