My name is Peyman Nayeri and I'm a PHD student in the field of Computer Science at Arizona State University. I got my BS in Computer Engineering from Sharif University of Technology in 2003. I've been working on my PHD at ASU since Fall of 2005 and my supervisor is Professor Konjevod.

My main research is currently regarding optimizing covering arrays. Here is a basic introduction to covering arrays. A good page to keep track of the best known results would be here

Another aspect of my research is regarding the path finding problem on a network with dynamic cost. This could be used in conjunction with a traffic micro simulator to simulate millions of trips in a town which was my main task in the Digital Phoenix project.

My main research interest has always been in algorithms. I'm also interested in artificial intelligence specially in the design and synchronization issues of multi-agent environments.

I've put together some of my favourite quotes which I'll add to from time to time.