Publications of K. Gopalakrishnan
last modified Dec. 3, 2008
- The items are listed in reverse chronological order.
- Articles which are accepted but yet to be published,
which are submitted but yet to be reviewed and which are
under preparation are NOT listed.
- Most of the publications are made available as pdf files or
postscript files. Some presentations are also available.
- K. Gopalakrishnan and D. R. Stinson.
Applications of Orthogonal Arrays to Computer Science
Ramanujan Mathematical Society, Lecture Notes Series in Mathematics,
Vol. 7, 2008, 149--164. Here are the slides of
the corresponding invited talk given at the
International
Conference on Discrete Mathematics (ICDM)
(held at Indian Institute of
Science, Bangalore, India in Dec. 2006.)
- K. Gopalakrishnan, N. Theriault and Chui Zhi Yao.
Solving Discrete Logarithms from Partial Knowledge of the Key
Progress in Cryptology
-- INDOCRYPT 2007 , Proceedings of the 8th International
Conference on Cryptology in India (held at Indian Institute of
Technology - Madras, Chennai, India in Dec. 2007), Lecture Notes in
Computer Science, 4859 (2007), 224--237, Springer verlag.
Here are the slides of the talk given there.
- K. Gopalakrishnan and D. R. Stinson, Correlation-immune and
Resilient Functions Handbook of
Combinatorial Designs , Edited by C. J. Colbourn and
J. H. Dinitz, Chapman & Hall/CRC, Second Edition, Nov. 2006, 355--357.
- K. Gopalakrishnan and D. R. Stinson, Derandomization
Handbook of
Combinatorial Designs , Edited by C. J. Colbourn and
J. H. Dinitz, Chapman & Hall/CRC, Second Edition, Nov. 2006, 389--391.
- K. Gopalakrishnan and D. R. Stinson, Secrecy and
Authentication Codes Handbook of
Combinatorial Designs , Edited by C. J. Colbourn and
J. H. Dinitz, Chapman & Hall/CRC, Second Edition, Nov. 2006, 606--611.
- K. Gopalakrishnan and D. R. Stinson, Threshold and
Ramp Schemes Handbook of
Combinatorial Designs , Edited by C. J. Colbourn and
J. H. Dinitz, Chapman & Hall/CRC, Second Edition, Nov. 2006, 635--639.
- K. Gopalakrishnan Derandomization via Matroidal
Sample Spaces Congressus Numerantium,
Vol. 168, 2004, 177--190. (This paper was also presented at the
Thirty-Fifth Southeastern International Conference on Combinatorics,
Graph Theory and Computing held at the Florida Atlantic
University, Boca Raton, FL in Mar. 2004)
- K. Gopalakrishnan, Nasir D. Memon and Poorvi Vora.
Protocols for Watermark Verification. IEEE Multimedia,
Vol. 8, No. 4, October-December 2001, 66--70. Here is the
guest editor's introduction. ( A preliminary
version of this paper was published in Proceedings of
the Multimedia and Security Workshop , GMD Report No. 85,
Dec. 1999, 91--94. The
workshop was a part of the seventh annual
ACM International Multimedia Conference held in Oct. 1999 at Orlando, Florida)
- Jitender S. Deogun and K. Gopalakrishnan.
Consecutive Retrieval Property - Revisited.
Information Processing Letters. 69 (1999), 15--20.
(A preliminary version was presented at the Tenth Midwestern Conference
on Combinatorics, Cryptography and Computing held at the Southern
Illinois University, Carbondale in Oct. 1995)
- J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson.
A Note on the Duality of Linear Programming Bounds for Orthogonal Arrays and
Codes.
Bulletin of the Institute of Combinatorics and its Applications.
22 (1998), 17--24. (Also, presented at the Twelfth Midwestern Conference on
Combinatorics, Cryptography and Computing held at the Indiana State
University, Terre Haute in Oct. 1997)
- K. Gopalakrishnan and D. R. Stinson. A Simple Analysis of
the Error Probability of Two-point Based Sampling.
Information Processing Letters. 60 (1996), 91--96.
(Also, presented at the Twenty-Seventh Southeastern International Conference on
Combinatorics, Graph Theory and Computing held at the
Louisiana State University, Baton Rouge in Feb. 1996.)
- J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson.
Orthogonal Arrays, Resilient Functions, Error Correcting Codes and
Linear Programming Bounds.
SIAM Journal of Discrete Mathematics. 9 (1996),
424--452.
- K. Gopalakrishnan and D. R. Stinson. A Short Proof of
the Non-Existence of Certain Cryptographic Functions.
Journal of Combinatorial Mathematics and Combinatorial
Computing 20 (1996), 129--137.
(Also, presented
at the Eighth Midwestern Conference on Combinatorics,
Cryptography and Computing held at the Wichita State
University, Wichita in Oct 1993.)
- K. Gopalakrishnan and D. R. Stinson. Derandomization.
The CRC Handbook of
Combinatorial Designs, Edited by C. J. Colbourn and
J. H. Dinitz, CRC Press, Inc., 1996, 558--560.
- K. Gopalakrishnan and D. R. Stinson. Application of
Designs to Cryptography.
The CRC Handbook of
Combinatorial Designs, Edited by C. J. Colbourn and
J. H. Dinitz, CRC Press, Inc., 1996, 549--557.
- K. Gopalakrishnan and D. R. Stinson. Three Characterizations
of Non-Binary Correlation Immune and Resilient Functions.
International Journal of Designs, Codes and Cryptography 5 (1995), 241--251.
- J. Bierbrauer, K. Gopalakrishnan and D. R. Stinson.
Bounds for resilient functions and orthogonal arrays. Lecture Notes in
Computer Science, 839 (1994), 247--256 ( Advances in Cryptology
-- CRYPTO '94, Proceedings of the 14th Annual International Cryptology
Conference held at the University of California, Santa Barbara
in Aug. 1994).
- K. Gopalakrishnan, D. G. Hoffmann and D. R. Stinson. A note
on a Conjecture concerning Symmetric Resilient Functions.
Information Processing Letters 47 (1993), 139--143.
- K. Gopalakrishnan and B. B. Bhattacharya. Non-Checkpoint
Target Faults - How to order them? Proceedings of the 34th
Midwest Symposium on Circuits and Systems,
IEEE Press, 619--622 (held at the
Montery Sheraton Hotel, Montery in May 1991)
- K. Gopalakrishnan, P. Srinivasa Rao and K. V. Gopalakrishnan.
Vegetable Oils as Diesel Engine Fuels. Proceedings of the Tenth
National Conference on I. C. Engines and Combustion ,
AF-121 to AF-132 (held at the Prototype Development and
Training Centre, Rajkot, India in Dec. 1987).
Back
Page Maintained by gopal@cs.ecu.edu