<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="Generator" content="Microsoft Word 15 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Aptos;
panose-1:2 11 0 4 2 2 2 2 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
font-size:12.0pt;
font-family:"Aptos",sans-serif;
mso-ligatures:standardcontextual;
mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:#467886;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Aptos",sans-serif;
color:windowtext;}
span.apple-converted-space
{mso-style-name:apple-converted-space;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:11.0pt;
mso-fareast-language:EN-US;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:72.0pt 72.0pt 72.0pt 72.0pt;}
div.WordSection1
{page:WordSection1;}
/* List Definitions */
@list l0
{mso-list-id:881865480;
mso-list-type:hybrid;
mso-list-template-ids:1648263270 67698703 67698713 67698715 67698703 67698713 67698715 67698703 67698713 67698715;}
@list l0:level1
{mso-level-tab-stop:18.0pt;
mso-level-number-position:left;
margin-left:18.0pt;
text-indent:-18.0pt;}
@list l0:level2
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:54.0pt;
mso-level-number-position:left;
margin-left:54.0pt;
text-indent:-18.0pt;}
@list l0:level3
{mso-level-number-format:roman-lower;
mso-level-tab-stop:90.0pt;
mso-level-number-position:right;
margin-left:90.0pt;
text-indent:-9.0pt;}
@list l0:level4
{mso-level-tab-stop:126.0pt;
mso-level-number-position:left;
margin-left:126.0pt;
text-indent:-18.0pt;}
@list l0:level5
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:162.0pt;
mso-level-number-position:left;
margin-left:162.0pt;
text-indent:-18.0pt;}
@list l0:level6
{mso-level-number-format:roman-lower;
mso-level-tab-stop:198.0pt;
mso-level-number-position:right;
margin-left:198.0pt;
text-indent:-9.0pt;}
@list l0:level7
{mso-level-tab-stop:234.0pt;
mso-level-number-position:left;
margin-left:234.0pt;
text-indent:-18.0pt;}
@list l0:level8
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:270.0pt;
mso-level-number-position:left;
margin-left:270.0pt;
text-indent:-18.0pt;}
@list l0:level9
{mso-level-number-format:roman-lower;
mso-level-tab-stop:306.0pt;
mso-level-number-position:right;
margin-left:306.0pt;
text-indent:-9.0pt;}
@list l1
{mso-list-id:1124692375;
mso-list-type:hybrid;
mso-list-template-ids:1767421944 426700978 67698713 67698715 67698703 67698713 67698715 67698703 67698713 67698715;}
@list l1:level1
{mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:18.0pt;
text-indent:-18.0pt;
mso-ansi-font-style:normal;
mso-bidi-font-style:italic;}
@list l1:level2
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:54.0pt;
text-indent:-18.0pt;}
@list l1:level3
{mso-level-number-format:roman-lower;
mso-level-tab-stop:none;
mso-level-number-position:right;
margin-left:90.0pt;
text-indent:-9.0pt;}
@list l1:level4
{mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:126.0pt;
text-indent:-18.0pt;}
@list l1:level5
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:162.0pt;
text-indent:-18.0pt;}
@list l1:level6
{mso-level-number-format:roman-lower;
mso-level-tab-stop:none;
mso-level-number-position:right;
margin-left:198.0pt;
text-indent:-9.0pt;}
@list l1:level7
{mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:234.0pt;
text-indent:-18.0pt;}
@list l1:level8
{mso-level-number-format:alpha-lower;
mso-level-tab-stop:none;
mso-level-number-position:left;
margin-left:270.0pt;
text-indent:-18.0pt;}
@list l1:level9
{mso-level-number-format:roman-lower;
mso-level-tab-stop:none;
mso-level-number-position:right;
margin-left:306.0pt;
text-indent:-9.0pt;}
ol
{margin-bottom:0cm;}
ul
{margin-bottom:0cm;}
--></style>
</head>
<body lang="EN-SG" link="#467886" vlink="#96607D" style="word-wrap:break-word">
<div class="WordSection1">
<p class="MsoNormal"><span lang="EN-US">Please forward to your qualified PhD student. Thanks!<o:p></o:p></span></p>
<p class="MsoNormal"><span lang="EN-US"><o:p> </o:p></span></p>
<p class="MsoNormal"><b><span lang="EN-US">Post Doctoral Position in GPU-Accelerated Optimization/Graph Algorithms<o:p></o:p></span></b></p>
<p class="MsoNormal"><b><span style="color:black">Job posting link:</span></b><span class="apple-converted-space"><span style="color:black"> </span></span><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fcareers.sutd.edu.sg%2Fjob-invite%2F1916%2F&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552496545%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=9w%2BiJU%2F4vRgPna%2BBujHgZrNRagQi%2Bzdkk6qI9pQqQmg%3D&reserved=0" originalSrc="https://careers.sutd.edu.sg/job-invite/1916/" shash="IZq9Xjjzt0a45ruQ/E2QYTYPUl6fZPLtDvfD4hGdc7JOC3ekWAx1U/B8DSOwCHRULSCyfaG94XgAPVBTJxOm4WhgbBewwLc3k+cjWxQ5jgyWPRQkiXz+CPmZXiqlztoCLQhqS8ouMggNqJNAqSKxyNVXPBQZ4+QlKsKc1gf3yQQ=" title="https://careers.sutd.edu.sg/job-invite/1916/"><span style="color:#467886">https://careers.sutd.edu.sg/job-invite/1916/</span></a><o:p></o:p></p>
<p class="MsoNormal"><b><span lang="EN-US"><o:p> </o:p></span></b></p>
<p class="MsoNormal"><span lang="EN-US">Engineering Systems and Design, Singapore University of Technology and Design<o:p></o:p></span></p>
<p class="MsoNormal"><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fsutd.edu.sg%2FAbout&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552514306%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=nNESpLCCFVLCSoFdBG7vh55w4tbPK6UXDfufhQMukKE%3D&reserved=0" originalSrc="https://sutd.edu.sg/About" shash="rNKXtkfvOKbJA1p0IY4uDu+g+rfJdAhe7vN4SecRqyDT3ASITX0YEvvrYxbMXU/BiU2EGeOsroPTZqyzTQy5zeDmkaRkFqwqnmrEYod0ry1o3rifVQf+nFNX4BpN7Xb3sqyRhUuh+31yXSnDIJbgICNq/A1pYpgqCj7OyXoQHko="><span lang="EN-US">https://sutd.edu.sg/About</span></a>
<span lang="EN-US"><o:p></o:p></span></p>
<p class="MsoNormal"><span lang="EN-US"><o:p> </o:p></span></p>
<p class="MsoNormal"><span lang="EN-GB">Graphics Processing Units (GPUs) have become pervasive computing devices. They are massively parallel machines that provide a cost-effective solution for high-performance computing applications. Their application in discrete
optimization and graph algorithms has not received much attention, however. Our</span> research group in ESD at Singapore University of Technology and Design (and ISE at University of Illinois, Urbana-Champaign) have been pursuing
<span lang="EN-GB">novel research in parallel algorithms with strong theoretical underpinnings, for the Compute Unified Device Architecture (CUDA) enabled NVIDIA GPUs, to solve large-scale Assignment Problems and Graph Algorithms. We also contribute to making
AI faster. (See below for past research.)<o:p></o:p></span></p>
<p class="MsoNormal"><span lang="EN-GB"><o:p> </o:p></span></p>
<p class="MsoNormal"><b>Job Responsibilities</b><o:p></o:p></p>
<p class="MsoNormal">Postdoctoral Fellows will have an opportunity to perform impactful research in parallel algorithms for (discrete) optimization and graph problems. Publishing highest quality research papers in top-ranked journals (and conferences) is to
be expected. <o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Minimum and Preferred Qualifications</b><o:p></o:p></p>
<p class="MsoNormal">A doctorate in Industrial and Systems Engineering, Operations Research, Computer Engineering, Computer Science, or closely related discipline is required at the start of the appointment. Prior publication credentials will be evaluated.
Knowledge of CUDA (and GPU hardware basics) will be a plus but not mandatory. Should have a desire to make break-through contributions, such as
<a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdeveloper.nvidia.com%2Fblog%2Faccelerate-large-linear-programming-problems-with-nvidia-cuopt%2F&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552528627%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=UvRUYJI1L059Qh8AIowQ%2B3UGeK9x26if2tsBjucnkfQ%3D&reserved=0" originalSrc="https://developer.nvidia.com/blog/accelerate-large-linear-programming-problems-with-nvidia-cuopt/" shash="Ujzk4QvhP4WcSONLUIL1F/FQUErfyoyUGlcVE47iAA1oFfrvmsmCNkPwhyVpKi6r7FngqEMieoDB7vooKvV8U7thbas3vXHPqy9mi0ImOJ6C8QHeB89qTnlS3lgnUzOHRc/GoaggRYDpkfimBXgCQX4S46gvEarA09+/EzUAkMQ=">
https://developer.nvidia.com/blog/accelerate-large-linear-programming-problems-with-nvidia-cuopt/</a>
<o:p></o:p></p>
<p class="MsoNormal"> <o:p></o:p></p>
<p class="MsoNormal"><b>Application Requirements</b><o:p></o:p></p>
<p class="MsoNormal">Interested applicants should submit: (1) a brief letter/email of interest; (2) curriculum vitae; (3) names and contact information for three references; and (4) research plan/proposal (up to two pages, not including references) to Prof.
Rakesh Nagi <a href="mailto:rakesh_nagi@sutd.edu.sg">rakesh_nagi@sutd.edu.sg</a>. SUTD will perform a background check before the employment can be finalized.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Details</b><o:p></o:p></p>
<p class="MsoNormal">Starting date as early as January 2025! Duration of 1+ years.
<o:p></o:p></p>
<p class="MsoNormal">Deadline: Jan 31, 2025 (or until position is filled).<o:p></o:p></p>
<p class="MsoNormal"><i>Successful candidates can look forward to competitive remuneration packages</i>.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal"><b>Past Research<o:p></o:p></b></p>
<ol style="margin-top:0cm" start="1" type="1">
<li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Kawtikwar, S. and Nagi, R. "HyLAC: Hybrid Linear Assignment solver in CUDA,"
<i>Journal of Parallel and Distributed Computing</i>, May 2024, Vol. 187, pp. 104838. (</span><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.jpdc.2024.104838&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552547146%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=KDhrCL3aTpwYQCIdBzbg%2FQXml5BWDP8be6gMqXFKlKs%3D&reserved=0" originalSrc="https://doi.org/10.1016/j.jpdc.2024.104838" shash="Z/BhujkPwxS1ElzkJ2OTXwPONXyzZn30sLHn0WhnWPUebsqlkH7AwJZMyKLTvzkotrD+BJV1Zx0iNxTlAjDUhULbIsCrzuBwaZ3NRICEM2Z3h9fSHNPCWh3BCALbVDdk9dM4LoOgMTyMdqX2oOOX8UO7WGxXioZdpqzNXPt4/e4="><span lang="EN-US">Link</span></a><span lang="EN-US">)
<b>[Reigning fastest LAP solver]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Mahajan, M. and Nagi, R. "GPU-Accelerated Transportation Simplex Algorithm,"
<i>Journal of Parallel and Distributed Computing</i>, February 2024, Vol. 184, pp. 104790. (</span><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdoi.org%2F10.1016%2Fj.jpdc.2023.104790&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552561896%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=wCKj%2BkRXaU734w3wbalNCUx8UJ5U5aUUFIWKU9I3ITg%3D&reserved=0" originalSrc="https://doi.org/10.1016/j.jpdc.2023.104790" shash="TN9MwkqEWoMHAhJJ8Mx4Txkiph9OOVcj9sM0lktspIf87R0DzSD/M72iUhH2kXreH314CJr/EZfmJAowxNDkEiRzWM4H0ER0HAU3CYuIPZiZxYf9OIObkeV9fXB7CZJS7bURzDmNo1zD5Cz5C+87kn5whblyAQyiuG+yuzXLcZ0="><span lang="EN-US">Link</span></a><span lang="EN-US">)<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Vadrevu, S. and Nagi, R. "A GPU accelerated algorithm for solving the Multi-dimensional Assignment Problem for a Multi-Target Tracking application,"
<i>IEEE Transactions on Automation, Science and Engineering</i>, June 2023, Vol. 20(3), pp. 1706 - 1720.
<b>[(near-)optimal solution to 25 billion variable NP-hard problem]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Natu, S., Date, K. and Nagi, R. "GPU-accelerated Lagrangian Heuristic for Multidimensional Assignment Problems with Decomposable Costs,"
<i>Parallel Computing</i>, Sept. 2020, Vol. 97, pp. 102666.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Date, K. and Nagi, R. "Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing
Unit Clusters," <i>INFORMS Journal of Computing</i>, Fall 2019, Vol. 31(4), pp. 771-789.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l0 level1 lfo1"><span lang="EN-US">Date, K. and Nagi, R. "A GPU Accelerated Hungarian Algorithm for the Linear Assignment Problem,"
<i>Parallel Computing</i>, September 2016, Vol. 57, pp. 52-72. <b>[Transitioned to NVIDIA Rapids]</b><o:p></o:p></span></li></ol>
<p class="MsoNormal"><b><span lang="EN-US">Graph Algorithms<o:p></o:p></span></b></p>
<ol style="margin-top:0cm" start="1" type="1">
<li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Almasri, M., Chang, Y.-H, El Hajj, I., Nagi, R., Xiong, J., and Hwu, W-M. "Parallelizing Maximal Clique Enumeration on GPUs," 3<i>2nd International Conference on Parallel
Architectures and Compilation Techniques (PACT 2023)</i>, October 21–25, 2023, Vienna, Austria.<i><o:p></o:p></i></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Kawtikwar, S., Almasri, M., Hwu, W-M., Nagi, R., and Xiong, J. "BEEP: Balanced Efficient subgraph Enumeration in Parallel,"
<i>52<sup>nd</sup> </i><i>International Conference on Parallel Processing (ICPP 2023)</i>, August 7-10, 2023, Salt Lake City, Utah.<i><o:p></o:p></i></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Kawtikwar, S. and Nagi, R. "Multi-Target Tracking with GPU-Accelerated Data Association Engine,"
<i>26th International Conference on Information Fusion</i>, Charleston, SC, June 27-30, 2023.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Almasri, M., El Hajj, I., Nagi, R., Xiong, J., and Hwu, W-M. "Parallel K-Clique Counting on GPUs,"
<i>36th ACM International Conference on Supercomputing (ICS) (ICS'22)</i>, June 27 – June 30, 2022, virtual.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Dodeja, V., Almasri, M., Nagi, R., Xiong, J., and Hwu, W-M. "PARSEC: PARallel Subgraph Enumeration in CUDA,"
<i>IPDPS 2022, 36th IEEE International Parallel & Distributed Processing Symposium</i>, May 30 – June 3, 2022, Lyon, France.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">AlMasri, M., Vasudeva, N., Nagi, R., Xiong, J., and Hwu, W-M. "HyKernel: A Hybrid Selection of One/Two-Phase Kernels for Triangle Counting on GPUs,"
<i>High Performance Extreme Computing Conference (HPEC), 2021 IEEE</i>, Waltham, MA, 21-23 September 2021.
<b>[DARPA Graph Challenge Student Innovation Award.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Hiyadetoglu, M., Mailthody, V.S., Pearson, C., Ebrahimi, E., Xiong, J., Nagi, R., and Hwu, W-M. "Efficient Inference on GPUs for the Sparse Deep Neural Network Graph
Challenge 2020," <i>High Performance Extreme Computing Conference (HPEC), 2020 IEEE</i>, Waltham, MA, 24-26 September 2020.<b> [DARPA Graph Challenge Champion!]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Kim, D., Chen, D., and Nagi, R. "Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition,"
<i>25th Asia and South Pacific Design Automation Conference ASP DAC 2020</i>, Beijing, China, 13-16 January 2020.<o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Almasri, M., Anjum, O., Pearson, C., Qureshi, Z., Mailthody, V.S., Nagi, R., Xiong, J., and Hwu, W-M. "Update on
<i>k</i>-truss Decomposition on GPU," <i>High Performance Extreme Computing Conference (HPEC), 2019 IEEE</i>, Waltham, MA, 24-26 September 2019.
<b>[DARPA Graph Challenge Student Innovation Award.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Pearson, C., Almasri, M., Anjum, O., Qureshi, Z., Mailthody, V.S., Nagi, R., Xiong, J., and Hwu, W-M. Update on triangle counting on GPU.
<i>High Performance Extreme Computing Conference (HPEC), 2019 IEEE</i>, Waltham, MA, 24-26 September 2019.
<b>[DARPA Graph Challenge Honorable Mention.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Huang, S., Pearson, C., Nagi, R., Xiong, J., Chen, D., and Hwu, W-M. Accelerating Sparse Deep Neural Networks on FPGAs.
<i>High Performance Extreme Computing Conference (HPEC), 2019 IEEE</i>, Waltham, MA, 24-26 September 2019.
<b>[DARPA Graph Challenge Honorable Mention.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Mailthody, V.S., Date, K., Qureshi, Z., Pearson, C., Nagi, R., Xiong, J., and Hwu, W-M. Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition.
<i>High Performance Extreme Computing Conference (HPEC), 2018 IEEE</i>, Waltham, MA, 25-27 September 2018.
<b>[DARPA Graph Challenge Finalist.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Huang, S., El-Hadedy, M., Hao, C., Li, Q., Mailthody, V., Date, K., Xiong, J., Chen, D., Nagi, R., and Hwu, W-M. Triangle counting and truss decomposition using FPGA.
<i>High Performance Extreme Computing Conference (HPEC), 2018 IEEE</i>, Waltham, MA, 25-27 September 2018.
<b>[DARPA Graph Challenge Student Innovation Award.]</b><o:p></o:p></span></li><li class="MsoNormal" style="margin-left:-18.0pt;mso-list:l1 level1 lfo2"><span lang="EN-US">Date, K., Feng, K., Nagi, R., Xiong, J., Kim, N.S., and Hwu, W-M. Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition on the Minsky architecture.
<i>High Performance Extreme Computing Conference (HPEC), 2017 IEEE</i>, Waltham, MA, 12-14 September 2017.
<b>[DARPA Graph Challenge Honorable Mention.]</b><o:p></o:p></span></li></ol>
<p class="MsoNormal"><span style="font-size:11.0pt"><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt">Rakesh<o:p></o:p></span></p>
<div>
<div>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;mso-ligatures:none;mso-fareast-language:EN-GB">-- <o:p></o:p></span></p>
</div>
<div>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB">Head of Pillar and Professor, Engineering Systems and Design (ESD)<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB">Director, Aviation Studies Institute (ASI)</span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB">Singapore University of Technology and Design (SUTD) </span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB">8 Somapah Road Singapore 487372</span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB">Room 1.702-16; Tel: <a href="tel:+6564997221"><span style="color:#0078D7">+65 6499 7221</span></a></span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB"><a href="mailto:rakesh_nagi@sutd.edu.sg" title="mailto:rakesh_nagi@sutd.edu.sg"><span style="color:#0563C1">rakesh_nagi@sutd.edu.sg</span></a></span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none;mso-fareast-language:EN-GB"><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fesd.sutd.edu.sg%2Fpeople%2Ffaculty%2Frakesh-nagi%2F&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552580544%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=OiRdbeaNwg%2BLvNSmz73otatDqlZdfSz%2BUFQu0%2F6gdEs%3D&reserved=0" originalSrc="https://esd.sutd.edu.sg/people/faculty/rakesh-nagi/" shash="gQfZovdBOwDeBB4gJTkjgXenJcq24Ejq1VEZv7ZotZpfW79GuKjof9ptJXw7ozi0dbIRKTK+0+Urk4aHJCzZaYnSgZl5V10d3SgSHXb28CGQ3SkXSq21sJPadCOMhxRTbY5am/9+JLqAB20MDVsGvRtj+31LK9vm78qvvIpMjYo=" title="https://esd.sutd.edu.sg/people/faculty/rakesh-nagi/"><span style="color:#0563C1">https://esd.sutd.edu.sg/people/faculty/rakesh-nagi/</span></a></span><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:#212121;mso-ligatures:none;mso-fareast-language:EN-GB"><o:p></o:p></span></p>
</div>
</div>
<p class="MsoNormal"><span style="font-size:11.0pt;font-family:"Calibri",sans-serif;color:black;mso-ligatures:none"><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fsutd.edu.sg%2FAbout%2FPeople%2FSUTD-Leadership%2FProfessor-Rakesh-Nagi&data=05%7C02%7CIEFac.list%40mailman.clemson.edu%7C821175ce565949b1c4cf08dd338501a2%7C0c9bf8f6ccad4b87818d49026938aa97%7C0%7C0%7C638723368552596199%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=0b2zDe2x%2Fh0a3AdGyz1YS%2BY7V0IEud2%2FA%2FJ2ldkKBtU%3D&reserved=0" originalSrc="https://sutd.edu.sg/About/People/SUTD-Leadership/Professor-Rakesh-Nagi" shash="MbvMsCPKXssbI+0wqWgaMRJqxdJ4Ish5S7ruvHIa+CxzZexXjbxA8S+MkHb6Wj0ZRM47azRnHrLs4RbBNSg+EIJL5HnXngXtGLbLU0qZKS0Q+7Q2SY12nkSabpQMuZZ1iDaeXPWijuZcc09qcx40bXIdbd1z0x5fLYlkypuBv7w=" title="https://sutd.edu.sg/About/People/SUTD-Leadership/Professor-Rakesh-Nagi"><span style="color:#0563C1">https://sutd.edu.sg/About/People/SUTD-Leadership/Professor-Rakesh-Nagi</span></a></span><span style="font-size:11.0pt"><o:p></o:p></span></p>
<p class="MsoNormal"><span lang="EN-US" style="font-size:11.0pt"><o:p> </o:p></span></p>
</div>
<div style="font-size:9pt; font-family: 'Calibri',sans-serif;">
<p style="color:#808080">This email may contain confidential and/or proprietary information that is exempt from disclosure under applicable law and is intended for receipt and use solely by the addressee(s) named above. If you are not the intended recipient,
you are notified that any use, dissemination, distribution, or copying of this email, or any attachment, is strictly prohibited. Please delete the email immediately and inform the sender. Thank You</p>
</div>
</body>
</html>