C. E. Veni Madhavan

Publication Activity (10 Years)

Years Active: 1980-2019
Publications (10 Years): 3

Top Topics

Least Significant Bit

Top Venues

Top. Cogn. Sci.

IACR Cryptol. ePrint Arch.

Publications

R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan
Undetectable least significant bit replacement steganography. Multim. Tools Appl. 78 (8) (2019)
Srikanth Ch, C. E. Veni Madhavan, Kumar Swamy H. V.
Family of PRGs based on Collections of Arithmetic Progressions. IACR Cryptol. ePrint Arch. 2017 (2017)
C. E. Veni Madhavan
Keynote address: Quo Vadis PKI? PKIA (2017)
Srinivas Vivek, C. E. Veni Madhavan
Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences. J. Symb. Comput. 64 (2014)
Prateek Nagwanshi, C. E. Veni Madhavan
Sarcasm Detection using Sentiment and Semantic Features. KDIR (2014)
Siddhartha Banerjee, Nitin Kumar, C. E. Veni Madhavan
Text Simplification for Enhanced Readability. KDIR/KMIS (2013)
R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan
Improved LSB stegananalysis based on analysis of adjacent pixel pairs. Signal Image Video Process. 7 (5) (2013)
Sudarshan Iyengar, C. E. Veni Madhavan, Katharina Anna Zweig, Abhiram Natarajan
Understanding Human Navigation Using Network Analysis. Top. Cogn. Sci. 4 (1) (2012)
Rama Badrinath, C. E. Veni Madhavan
Diversity in Ranking using Negative Reinforcement CoRR (2012)
V. Suresh, Avanthi Krishnamurthy, Rama Badrinath, C. E. Veni Madhavan
A Stylometric Study and Assessment of Machine Translators. IDA (2011)
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)
Rama Badrinath, Suresh Venkatasubramaniyan, C. E. Veni Madhavan
Improving Query Focused Summarization Using Look-Ahead Strategy. ECIR (2011)
R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan
Cover Image Preprocessing for More Reliable LSB Replacement Steganography. ICSAP (2010)
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)
R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan
Image Classification for More Reliable Steganalysis. CNSA (2010)
R. Arun, V. Suresh, C. E. Veni Madhavan
Stopword Graphs and Authorship Attribution in Text Corpora. ICSC (2009)
Sujit Gujar, C. E. Veni Madhavan
Measures for classification and detection in steganalysis CoRR (2009)
R. Arun, V. Suresh, C. E. Veni Madhavan
Clustering in Concept Association Networks. PReMI (2009)
V. Suresh, H. V. Shashidhara, C. E. Veni Madhavan
A perturbative resampling approach to image steganalysis. ICUMT (2009)
Anil Yekkala, C. E. Veni Madhavan
Bit Domain Encryption. ACIVS (2008)
Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan
Two New Families of Low-Correlation Interleaved QAM Sequences. SETA (2008)
Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan
Low correlation interleaved QAM sequences. ISIT (2008)
Anil Yekkala, C. E. Veni Madhavan
Bit Plane Encoding and Encryption. PReMI (2007)
V. Suresh, Narayanan Raghupathy, B. Shekar, C. E. Veni Madhavan
Discovering Mentorship Information from Author Collaboration Networks. Discovery Science (2007)
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)
Abhijit Das, C. E. Veni Madhavan
On the cubic sieve method for computing discrete logarithms over prime fields. Int. J. Comput. Math. 82 (12) (2005)
Indivar Gupta, Laxmi Narain, C. E. Veni Madhavan
Cryptological Applications of Permutation Polynomials. Electron. Notes Discret. Math. 15 (2003)
C. R. Subramanian, C. E. Veni Madhavan
General Partitioning on Random Graphs. J. Algorithms 42 (1) (2002)
P. Sreenivasa Kumar, C. E. Veni Madhavan
Clique tree generalization and new subclasses of chordal graphs. Discret. Appl. Math. 117 (1-3) (2002)
N. S. Narayanaswamy, C. E. Veni Madhavan
On Assigning Prefix Free Codes to the Vertices of a Graph. COCOON (2001)
N. S. Narayanaswamy, C. E. Veni Madhavan
Lower Bounds for OBDDs and Nisan's pseudorandom generator. Electron. Colloquium Comput. Complex. 8 (20) (2001)
R. Sai Anand, C. E. Veni Madhavan
An Online, Transferable E-Cash Payment System. INDOCRYPT (2000)
Abhijit Das, C. E. Veni Madhavan
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. ISAAC (1999)
C. R. Subramanian, Martin Fürer, C. E. Veni Madhavan
Algorithms for coloring semi-random graphs. Random Struct. Algorithms 13 (2) (1998)
P. Sreenivasa Kumar, C. E. Veni Madhavan
Minimal Vertex Separators of Chordal Graphs. Discret. Appl. Math. 89 (1-3) (1998)
S. Rengarajan, C. E. Veni Madhavan
Stack and Queue Number of 2-Trees. COCOON (1995)
C. R. Subramanian, C. E. Veni Madhavan
Coloring Semi-Random Graphs in Polynomial Expected Time. FSTTCS (1994)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
An algorithm for recognizing palm polygons. Vis. Comput. 10 (8) (1994)
Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3 (1993)
P. Pradeep Kumar, C. E. Veni Madhavan
Shortest Watchman Tours in Weak Visibility Polygons. CCCG (1993)
Martin Fürer, C. R. Subramanian, C. E. Veni Madhavan
Coloring Random Graphs in Polynomial Expected Time. ISAAC (1993)
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) (1992)
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)
V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
Circuits, Pebbling and Expressibility. Computational Complexity Conference (1990)
P. Sreenivasa Kumar, C. E. Veni Madhavan
A New Class of Separators and Planarity of Chordal Graphs. FSTTCS (1989)
Bhaskar DasGupta, C. E. Veni Madhavan
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. Inf. Process. Lett. 33 (1) (1989)
V. S. Lakshmanan, C. E. Veni Madhavan
An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases. Theor. Comput. Sci. 54 (1987)
P. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs. FSTTCS (1987)
V. S. Lakshmanan, C. E. Veni Madhavan
Binary Decompositions and Acyclic Schemes. FSTTCS (1986)
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. Manag. 21 (5) (1985)
V. S. Lakshmanan, C. E. Veni Madhavan
The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach. FSTTCS (1985)
C. E. Veni Madhavan
Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. FSTTCS (1984)
V. S. Lakshmanan, N. Chandrasekharan, C. E. Veni Madhavan
Recognition and Top-Down Generation of beta-Acyclic Database Schemes. FSTTCS (1984)
C. E. Veni Madhavan
Secondary Attribute Retrieval Using Tree Data Structures. Theor. Comput. Sci. 33 (1984)
C. E. Veni Madhavan, S. Krishna
Comments on "Optimal Design of Distributed Information Systems". IEEE Trans. Computers 32 (12) (1983)
V. Gopalakrishna, C. E. Veni Madhavan
Performance Evaluation of Attribute-Based Tree Organization. ACM Trans. Database Syst. 5 (1) (1980)