dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Ramakanth Kavuluru Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru, Christopher Thomas, Amit P. Sheth, Victor Chan, Wenbo Wang, Alan Smith, Armando Soto, Amy Walters: An up-to-date knowledge-based literature search and exploration framework for focused bioscience domains. IHI 2012: 275-284
2011
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDelroy Cameron, Ramakanth Kavuluru, Olivier Bodenreider, Pablo N. Mendes, Amit P. Sheth, Krishnaprasad Thirunarayan: Semantic Predications for Complex Information Needs in Biomedical Literature. BIBM 2011: 512-519
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKeke Chen, Ramakanth Kavuluru, Shumin Guo: RASP: efficient multidimensional range query on attack-resilient encrypted databases. CODASPY 2011: 249-260
2009
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru, Andrew Klapper: Lower bounds on error complexity measures for periodic LFSR and FCSR sequences. Cryptography and Communications 1(1): 95-116 (2009)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru: Characterization of 2n-periodic binary sequences with fixed 2-error or 3-error linear complexity. Des. Codes Cryptography 53(2): 75-97 (2009)
2008
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru: 2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k=2 or 3. SETA 2008: 252-265
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru, Andrew Klapper: Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences. Selected Areas in Cryptography 2008: 151-164
2007
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamakanth Kavuluru, Andrew Klapper: On the k -Operation Linear Complexity of Periodic Sequences. INDOCRYPT 2007: 322-330

Coauthor Index

1Olivier Bodenreider [7]
2Delroy Cameron [7]
3Victor Chan [8]
4Keke Chen [6]
5Shumin Guo [6]
6Andrew Klapper [1] [2] [5]
7Pablo N. Mendes [7]
8Amit P. Sheth [7] [8]
9Alan Smith [8]
10Armando Soto [8]
11Krishnaprasad Thirunarayan [7]
12Christopher Thomas [8]
13Amy Walters [8]
14Wenbo Wang [8]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page