Ramakanth Kavuluru
Calculated based on number of publications stored in Pure and citations from Scopus
20062024

Research activity per year

Search results

  • 2011

    RASP: Efficient multidimensional range query on attack-resilient encrypted databases

    Chen, K., Kavuluru, R. & Guo, S., 2011, CODASPY'11 - Proceedings of the 1st ACM Conference on Data and Application Security and Privacy. p. 249-260 12 p. (CODASPY'11 - Proceedings of the 1st ACM Conference on Data and Application Security and Privacy).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    20 Scopus citations
  • Semantic predications for complex information needs in biomedical literature

    Cameron, D., Kavuluru, R., Bodenreider, O., Mendes, P. N., Sheth, A. P. & Thirunarayan, K., 2011, Proceedings - 2011 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2011. p. 512-519 8 p. 6120494. (Proceedings - 2011 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2011).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    4 Scopus citations
  • 2009

    Characterization of 2 n -periodic binary sequences with fixed 2-error or 3-error linear complexity

    Kavuluru, R., Nov 2009, In: Designs, Codes, and Cryptography. 53, 2, p. 75-97 23 p.

    Research output: Contribution to journalArticlepeer-review

    9 Scopus citations
  • Lower bounds on error complexity measures for periodic LFSR and FCSR sequences

    Kavuluru, R. & Klapper, A., Apr 2009, In: Cryptography and Communications. 1, 1, p. 95-116 22 p.

    Research output: Contribution to journalArticlepeer-review

    2 Scopus citations
  • 2008

    2 n -Periodic binary sequences with fixed k-error linear complexity for k = 2 or 3

    Kavuluru, R., 2008, Sequences and Their Applications - SETA 2008 - 5th International Conference, Proceedings. p. 252-265 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5203 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    7 Scopus citations
  • Counting functions for the k-error linear complexity of 2 n-periodic binary sequences

    Kavuluru, R. & Klapper, A., 2008, Selected Areas in Cryptography - 15th International Workshop, SAC 2008, Revised Selected Papers. p. 151-164 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5381 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
    1 Scopus citations
  • 2007

    On the k-operation linear complexity of periodic sequences

    Kavuluru, R. & Klapper, A., 2007, Progress in Cryptology - INDOCRYPT 2007 - 8th International Conference on Cryptology in India, Proceedings. p. 322-330 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4859 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2006

    Numerical upper bounds on ropelengths of large physical knots

    Diao, Y., Ernst, C., Kavuluru, V. & Ziegler, U., May 5 2006, In: Journal of Physics A: Mathematical and General. 39, 18, p. 4829-4843 15 p.

    Research output: Contribution to journalArticlepeer-review

    7 Scopus citations
Your message has successfully been sent.
Your message was not sent due to an error.