K. V. S. V. N. Raju
K. V. S. V. N. Raju publishes mostly in Artificial Intelligence, Information Systems and Computer Networks and Communications, on topics such as Privacy-Preserving Technologies in Data, Cryptography and Data Security and Data Mining Algorithms and Applications.
- World rank
- #2,447,597 of 7,710,434 ranked researchers
- Rank in India
- #45,770 of 280,097
- Works
- 63
- Citations
- 873
- Citations per work
- 13.9
What does K. V. S. V. N. Raju research?
K. V. S. V. N. Raju's work is mostly in Computer Science (67%), Social Sciences (5%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences4267.3%
- Computer Science4267.3%
- Everything else1828.1%
- Social Sciences34.6%
- Social Sciences34.6%
- 1Artificial Intelligence21% of their works
- 2Information Systems17% of their works
- 3Computer Networks and Communications13% of their works
- 4Computer Vision and Pattern Recognition11% of their works
- 5Software5% of their works
- 6Sociology and Political Science5% of their works
Research topics
- Privacy-Preserving Technologies in Data
- Cryptography and Data Security
- Data Mining Algorithms and Applications
- Parallel Computing and Optimization Techniques
- Chaos-based Image/Signal Encryption
- Software Engineering Research
- Cryptographic Implementations and Security
- Distributed and Parallel Computing Systems
Which keywords describe K. V. S. V. N. Raju's research?
The keywords of their largest research topics: Machine Learning, Data Mining, Differential Privacy, Federated Learning, High-Performance Computing, Cryptanalysis, Security Analysis and Homomorphic Encryption.
- Grid Computing
- Block Ciphers
- Code Clone Detection
- Chaos
- Parallel Computing
- Association Rules
- Homomorphic Encryption
- Cryptanalysis
- Federated Learning
- Data Mining
- Machine Learning
- Differential Privacy
- High-Performance Computing
- Security Analysis
- Identity-Based Encryption
- Frequent Patterns
- Performance Optimization
- Image Encryption
- Refactoring
- Distributed Systems
- Hash Functions
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 21 words, with their numbers
- Machine Learning253 topics
- Data Mining202 topics
- Differential Privacy121 topic
- Federated Learning121 topic
- High-Performance Computing112 topics
- Cryptanalysis102 topics
- Security Analysis102 topics
- Homomorphic Encryption91 topic
- Identity-Based Encryption91 topic
- Association Rules81 topic
- Frequent Patterns81 topic
- Parallel Computing71 topic
- Performance Optimization71 topic
- Chaos61 topic
- Image Encryption61 topic
- Code Clone Detection51 topic
- Refactoring51 topic
- Block Ciphers41 topic
- Distributed Systems41 topic
- Grid Computing41 topic
- Hash Functions41 topic
Where does K. V. S. V. N. Raju work?
K. V. S. V. N. Raju's main affiliation in the publication record is Andhra University, India.
How many publications and citations does K. V. S. V. N. Raju have?
OpenAlex counts 63 works and 873 citations for K. V. S. V. N. Raju, an h-index of 11, ranking #2,447,597 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about K. V. S. V. N. Raju. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.