Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

Are Edge MicroDCs Equipped to Tackle Memory Contention?

Published in HotStorage'25, 2025

Recommended citation: Tran, L., Bartz, R., Durairajan, R., Kremer, U. and Kannan, S., 2025, July. Are Edge MicroDCs Equipped to Tackle Memory Contention?. In Proceedings of the 17th ACM Workshop on Hot Topics in Storage and File Systems (pp. 38-44).
Download Paper

talks

teaching

Design and Analysis of Computer Algorithms

Undergraduate course, Rutgers - New Brunswick, 2024

Course Description

This course is an introduction to the design and analysis of computer algorithms.

  • Topics covered:
    • Asymptotic notation
    • Divide and conquer
    • Dynamic programming
    • Graph algorithms
    • Greedy algorithms
    • NP-complete problems