Udit Agarwal

Orcid: 0009-0007-2446-1310

According to our database1, Udit Agarwal authored at least 21 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Energy-Efficient and QoS-Aware Data Routing in Node Fault Prediction Based IoT Networks.
IEEE Trans. Netw. Serv. Manag., December, 2023

Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model.
CoRR, 2023

Exploring Synergy of Blockchain and 6G Network for Industrial Automation.
IEEE Access, 2023

2022
Blockchain Technology for Secure Supply Chain Management: A Comprehensive Review.
IEEE Access, 2022

SPRoute 2.0: A detailed-routability-driven deterministic parallel global router with soft capacity.
Proceedings of the 27th Asia and South Pacific Design Automation Conference, 2022

2021
Optimizing Graph Transformer Networks with Graph-based Techniques.
CoRR, 2021

BiPart: a parallel and deterministic hypergraph partitioner.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

Nekara: Generalized Concurrency Testing.
Proceedings of the 36th IEEE/ACM International Conference on Automated Software Engineering, 2021

2020
BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitioner.
CoRR, 2020

Faster Deterministic All Pairs Shortest Paths in Congest Model.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
Distributed Weighted All Pairs Shortest Paths Through Pipelining.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

DistTC: High Performance Distributed Triangle Counting.
Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths.
CoRR, 2018

A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining.
CoRR, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n<sup>3/2</sup>) Rounds.
CoRR, 2018

Fine-grained complexity for sparse graphs.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2016
Fine-Grained Complexity and Conditional Hardness for Sparse Graphs.
CoRR, 2016

Finding k Simple Shortest Paths and Cycles.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Performance considerations of network functions virtualization using containers.
Proceedings of the 2016 International Conference on Computing, 2016

2015
On reachability in graphs with obstacles.
Discret. Math. Algorithms Appl., 2015


  Loading...