Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Harsh, Vipul
36  Ergebnisse:
Personensuche X
?
1

Optimal Round and Sample-Size Complexity for Partitioning i..:

, In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
Yang, Wentao ; Harsh, Vipul ; Solomonik, Edgar - p. 467-478 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Murphy: Performance Diagnosis of Distributed Cloud Applicat..:

, In: Proceedings of the ACM SIGCOMM 2023 Conference,
Harsh, Vipul ; Zhou, Wenxuan ; Ashok, Sachin... - p. 438-451 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Spineless Data Centers:

, In: Proceedings of the 19th ACM Workshop on Hot Topics in Networks,
Harsh, Vipul ; Jyothi, Sangeetha Abdu ; Godfrey, P. Brighten - p. 67-73 , 2020
Link: https://dl.acm.org/doi/1..
 
?
4

Histogram Sort with Sampling:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,
Harsh, Vipul ; Kale, Laxmikant ; Solomonik, Edgar - p. 201-212 , 2019
Link: https://dl.acm.org/doi/1..
 
?
5

Flock: Accurate network fault localization at scale:

Harsh, Vipul ; Meng, Tong ; Agrawal, Kapil.
http://arxiv.org/abs/2305.03348.  , 2023
Link: http://arxiv.org/abs/230..
 
?
6

Optimal Round and Sample-Size Complexity for Partitioning i..:

Yang, Wentao ; Harsh, Vipul ; Solomonik, Edgar
http://arxiv.org/abs/2204.04599.  , 2022
Link: http://arxiv.org/abs/220..
 
?
7

Expander Datacenters: From Theory to Practice:

Harsh, Vipul ; Jyothi, Sangeetha Abdu ; Singh, Inderdeep.
http://arxiv.org/abs/1811.00212.  , 2018
Link: http://arxiv.org/abs/181..
 
?
8

Histogram Sort with Sampling:

Harsh, Vipul ; Kale, Laxmikant ; Solomonik, Edgar
http://arxiv.org/abs/1803.01237.  , 2018
Link: http://arxiv.org/abs/180..
 
?
9

UIUC-PPL/charm: v7.0.0-rc1:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v7.0.0-rc1.  , 2021
Link: https://zenodo.org/recor..
 
?
10

UIUC-PPL/charm: v7.0.0-rc2:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v7.0.0-rc2.  , 2021
Link: https://zenodo.org/recor..
 
?
11

UIUC-PPL/charm: Charm++ version 7.0.0:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v7.0.0.  , 2021
Link: https://zenodo.org/recor..
 
?
12

UIUC-PPL/charm: v6.10.0:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v6.10.0.  , 2020
Link: https://zenodo.org/recor..
 
?
13

UIUC-PPL/charm: v6.10.1:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v6.10.1.  , 2020
Link: https://zenodo.org/recor..
 
?
14

UIUC-PPL/charm: Charm++ version 6.10.2:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v6.10.2.  , 2020
Link: https://zenodo.org/recor..
 
?
15

UIUC-PPL/charm: v6.11.0-beta1:

Laxmikant Kale ; Bilge Acun ; Seonmyeong Bak...
https://github.com/UIUC-PPL/charm/tree/v6.11.0-beta1.  , 2020
Link: https://zenodo.org/recor..
 
1-15