Computer systems · concurrency · memory management
Building safer and faster concurrent software.
I am an Assistant Teaching Professor in Computer Science and Engineering at New Mexico Tech. My research focuses on non-blocking data structures, safe memory reclamation, and high-performance multicore systems.
About me
I earned my Ph.D. in Computer Science and Engineering from Penn State in Summer 2026, where I worked with Professor Ruslan Nikolaev. My dissertation, Bridging the Gap Between Safe Memory Management and Non-Blocking Data Structures, studies a practical systems problem: how can concurrent data structures remain safe and fast when threads remove, reclaim, and reuse shared memory?
My work develops algorithms, correctness and progress arguments, and reproducible C and C++ research artifacts. I evaluate these ideas on modern multicore hardware and study the tradeoffs among memory use, robustness, and performance. Before graduate school, I spent more than six years in the software industry building and maintaining production web systems.
RRR-SMR
Safe node reuse
Copy-free reuse and transfer of nodes across recyclable lock-free queues, linked lists, and trees.
SCOT
Robust traversal
Data-structure adaptations that make optimistic traversals compatible with robust memory reclamation.
R-SCOT
Recyclable structures
A unified approach to node recycling and efficient optimistic traversal in non-blocking data structures.
Current work
My next research steps include reusable concurrent-data-structure libraries, stronger traversal methods, and simpler interfaces between data structures and memory reclamation. I am also interested in projects that allow undergraduate and graduate students to enter systems research through testing, benchmarking, implementation, and correctness reasoning.
Recent highlights
- August 2026: Joined New Mexico Tech as an Assistant Teaching Professor of Computer Science and Engineering.
- SPAA 2026: Published the brief announcement Recyclable Optimistic-Traversal Data Structures.
- PPoPP 2026: Published and presented Fixing Non-Blocking Data Structures for Better Compatibility with Memory Reclamation Schemes.
- PLDI 2025: Published and presented RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures.
Selected publications
Fixing Non-Blocking Data Structures for Better Compatibility with Memory Reclamation Schemes
Md Amit Hasan Arovi and Ruslan Nikolaev.
RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures
Md Amit Hasan Arovi and Ruslan Nikolaev.
Teaching
At New Mexico Tech, I teach introductory computing, programming fundamentals in C, and assembly language and machine organization. At Penn State, I supported systems programming and operating systems courses. I aim to explain difficult ideas step by step, give students regular practice and feedback, and create a classroom where questions are welcome.