Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Atul Gupta

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 Ruchir Gupta

> Home > Persons > Atul Gupta

Publications

2022
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/icl/SharmaLGG22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/icl/SharmaLGG22
Abhinav Sharma, K. Lakshmanan, Ruchir Gupta, Atul Gupta:
Stochastic Arrow-Hurwicz Algorithm for Path Selection and Rate Allocation in Self-Backhauled mmWave Networks. IEEE Commun. Lett. 26(3): 716-720 (2022)
2021
[j22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/SharmaLGG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/SharmaLGG21
Abhinav Sharma, K. Lakshmanan, Ruchir Gupta, Atul Gupta:
Multi-Time Scale Smoothed Functional With Nesterov's Acceleration. IEEE Access 9: 113489-113499 (2021)
[j18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/symmetry/SharmaGLG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/symmetry/SharmaGLG21
Abhinav Sharma, Ruchir Gupta, K. Lakshmanan, Atul Gupta:
Transition Based Discount Factor for Model Free Algorithms in Reinforcement Learning. Symmetry 13(7): 1197 (2021)

a service of

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.