Harish Kumar

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nitish Mahajan

> Home > Persons > Harish Kumar

Publications

2023
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/icccnt/SainiMKK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icccnt/SainiMKK23
Pareena Saini, Nitish Mahajan, Sakshi Kaushal, Harish Kumar:
Decentralized Group Authentication of Devices Based on PhysicallyUnclonable Functions Using OneM2MArchitecture. ICCCNT 2023: 1-6
2022
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/monet/MahajanCKKS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/monet/MahajanCKKS22
Nitish Mahajan, Amita Chauhan, Harish Kumar, Sakshi Kaushal, Arun Kumar Sangaiah:
A Deep Learning Approach to Detection and Mitigation of Distributed Denial of Service Attacks in High Availability Intelligent Transport Systems. Mob. Networks Appl. 27(4): 1423-1443 (2022)
2021
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/concurrency/GuptaMKKKS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/concurrency/GuptaMKKKS21
Nishant Gupta, Nitish Mahajan, Sakshi Kaushal, Naresh Kumar, Harish Kumar, Arun Kumar Sangaiah:
Predictive model for hardware calibration to transmit real-time applications in VoIP networks. Concurr. Comput. Pract. Exp. 33(4) (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.