Saleh Khalaj Monfared
Cited by
Cited by
Fast AES Implementation: A High-throughput Bitsliced Approach
O Hajihassani, S Khalaj Monfared, SH Khasteh, S Gorgin
IEEE Transactions on Parallel and Distributed Systems, 2019
Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search
MS Kiarostami, MR Daneshvaramoli, SK Monfared, D Rahmati, S Gorgin
2019 IEEE Conference on Games (CoG), 1-4, 2019
Decentralized Communication-less Multi-Agent Task Assignment with Cooperative Monte-Carlo Tree Search
M Daneshvaramoli, MS Kiarostami, SK Monfared, H Karisani, ...
2020 6th International Conference on Control, Automation and Robotics (ICCAR …, 2020
BSRNG: A High Throughput Parallel BitSliced Approach for Random Number Generators
SK Monfared, O Hajihassani, MS Kiarostami, SM Zanjani, D Rahmati, ...
49th International Conference on Parallel Processing-ICPP: Workshops, 1-10, 2020
On Using Monte-Carlo Tree Search to Solve Puzzles
MS Kiarostami, M Daneshvaramoli, S Khalaj Monfared, A Visuri, ...
2021 7th International Conference on Computer Technology Applications, 18-26, 2021
Unlucky Explorer: A Complete non-Overlapping Map Exploration
MS Kiarostami, S Khalaj Monfared, M Daneshvaramoli, N Yousefian, ...
2021 The 3rd World Symposium on Software Engineering, 150-154, 2021
A TSX-Based KASLR Break: Bypassing UMIP and Descriptor-Table Exiting
MS Karvandi, S Khalaj Monfared, MS Kiarostami, D Rahmati, S Gorgin
International Conference on Risks and Security of Internet and Systems, 38-54, 2022
A High-throughput Parallel Viterbi Algorithm via Bitslicing
SK Monfared, O Hajihassani, V Mohsseni, D Rahmati, S Gorgin
ACM Transactions on Parallel Computing (TOPC) 8 (4), 1-25, 2021
HyperDbg: Reinventing Hardware-Assisted Debugging
MS Karvandi, MH Gholamrezaei, SK Monfared, S Medi, B Abbassi, ...
Preprints, 2022
A Study on Non-overlapping Multi-agent Pathfinding
M Daneshvaramoli, MS Kiarostami, SK Monfared, A Visuri, S Hosio, ...
Future of Information and Communication Conference, 1-18, 2022
The system can't perform the operation now. Try again later.
Articles 1–10