| Sadegh Nobari |
|
|||
| Computer Science Ph.D Candidate | ||||
| School of Computing, National University of Singapore | 2008-Current | |||
| B.Sc. in Computer Engineering (summa cum laude) | ||||
| School of Computer Engineering, Iran University of Science and Technology (IUST) | 2004-2008 |
| Research Interest | |
|
Parallel Algorithms (Many-core Architecture), Privacy (Social networks) and Graph processing |
| Selected Research Papers | |
|
Scalable parallel minimum spanning forest computation [Project page] |
|
|
Fast Random Graph Generation [Project page] |
|
|
On the privacy and utility of anonymized social networks |
|
|
Edit distance between XML and probabilistic XML documents |
|
|
A Data Parallel Minimum Spanning Tree Algorithm for Most Graphics Processing Units |
| Hobbies | |
|
Jogging, Football, Music (Listening & Playing), Learning new language |
| Graduate Courses | |
|
CS 6281 -
Special Topics in Computer Science: The Art of Doing Research |
|
|
CS 5225 -
Parallel & Distributed Databasesh |
|
| CS 5322 - Databases Security | |
| CS 5220 - Databases and the Web | |
| CS 5228 - Knowledge Discovery in Database | |
| CS 6230 - Advance Topics in Information Security | |
| CS 5201 - Foundation in Theoretical CS | |
| CS 5202 - Foundation in Computer Systems | |