default search action
Udit Agarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Hemant Palivela
, Vinay Rishiwal
Optimization of Deep Learning-Based Model for Identification of Credit Card Frauds. IEEE Access 12: 125629-125642 (2024) - [j8]Vinay Rishiwal
Exploring Secure V2X Communication Networks for Human-Centric Security and Privacy in Smart Cities. IEEE Access 12: 138763-138788 (2024) - [j7]Udit Agarwal
Exploring Blockchain and Supply Chain Integration: State-of-the-Art, Security Issues, and Emerging Directions. IEEE Access 12: 143945-143974 (2024) - [j6]Preeti Yadav, Vinay Rishiwal, Mano Yadav, Aziz Alotaibi, Vinay Maurya, Udit Agarwal, Satyam Sharma:
Investigation and Empirical Analysis of Transfer Learning for Industrial IoT Networks. IEEE Access 12: 173351-173379 (2024) - [j5]Udit Agarwal
Blockchain and crypto forensics: Investigating crypto frauds. Int. J. Netw. Manag. 34(2) (2024) - 2023
- [j4]Mano Yadav, Udit Agarwal
Exploring Synergy of Blockchain and 6G Network for Industrial Automation. IEEE Access 11: 137163-137187 (2023) - [j3]Neha Sharma
Energy-Efficient and QoS-Aware Data Routing in Node Fault Prediction Based IoT Networks. IEEE Trans. Netw. Serv. Manag. 20(4): 4585-4599 (2023) - [i9]Udit Agarwal:
Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model. CoRR abs/2310.00782 (2023) - 2022
- [j2]Udit Agarwal
Blockchain Technology for Secure Supply Chain Management: A Comprehensive Review. IEEE Access 10: 85493-85517 (2022) - [c10]Jiayuan He, Udit Agarwal, Yihang Yang, Rajit Manohar, Keshav Pingali:
SPRoute 2.0: A detailed-routability-driven deterministic parallel global router with soft capacity. ASP-DAC 2022: 586-591 - 2021
- [c9]Udit Agarwal, Pantazis Deligiannis
Nekara: Generalized Concurrency Testing. ASE 2021: 679-691 - [c8]Sepideh Maleki, Udit Agarwal, Martin Burtscher, Keshav Pingali:
BiPart: a parallel and deterministic hypergraph partitioner. PPoPP 2021: 161-174 - [i8]Loc Hoang, Udit Agarwal, Gurbinder Gill, Roshan Dathathri, Abhik Seal, Brian Martin, Keshav Pingali:
Optimizing Graph Transformer Networks with Graph-based Techniques. CoRR abs/2106.08500 (2021) - 2020
- [c7]Udit Agarwal, Vijaya Ramachandran:
Faster Deterministic All Pairs Shortest Paths in Congest Model. SPAA 2020: 11-21 - [i7]Udit Agarwal, Vijaya Ramachandran:
Faster Deterministic All Pairs Shortest Paths in Congest Model. CoRR abs/2005.09588 (2020) - [i6]Sepideh Maleki, Udit Agarwal, Martin Burtscher, Keshav Pingali:
BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitioner. CoRR abs/2012.13618 (2020)
2010 – 2019
- 2019
- [c6]Loc Hoang, Vishwesh Jatala, Xuhao Chen, Udit Agarwal, Roshan Dathathri, Gurbinder Gill, Keshav Pingali:
DistTC: High Performance Distributed Triangle Counting. HPEC 2019: 1-7 - [c5]Udit Agarwal, Vijaya Ramachandran:
Distributed Weighted All Pairs Shortest Paths Through Pipelining. IPDPS 2019: 23-32 - 2018
- [c4]Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. PODC 2018: 199-205 - [c3]Udit Agarwal, Vijaya Ramachandran:
Fine-grained complexity for sparse graphs. STOC 2018: 239-252 - [i5]Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n3/2) Rounds. CoRR abs/1804.05441 (2018) - [i4]Udit Agarwal, Vijaya Ramachandran:
A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. CoRR abs/1807.08824 (2018) - [i3]Udit Agarwal, Vijaya Ramachandran:
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR abs/1810.08544 (2018) - 2016
- [c2]Jason W. Anderson, Hongxin Hu, Udit Agarwal, Craig Lowery, Hongda Li, Amy W. Apon:
Performance considerations of network functions virtualization using containers. ICNC 2016: 1-7 - [c1]Udit Agarwal, Vijaya Ramachandran:
Finding k Simple Shortest Paths and Cycles. ISAAC 2016: 8:1-8:12 - [i2]Udit Agarwal, Vijaya Ramachandran:
Fine-Grained Complexity and Conditional Hardness for Sparse Graphs. CoRR abs/1611.07008 (2016) - 2015
- [j1]Udit Agarwal, Kalpesh Kapoor:
On reachability in graphs with obstacles. Discret. Math. Algorithms Appl. 7(4): 1550059:1-1550059:22 (2015) - [i1]Udit Agarwal, Vijaya Ramachandran:
Finding $k$ Simple Shortest Paths and Cycles. CoRR abs/1512.02157 (2015)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: