Armand Navabi

According to our database, Armand Navabi authored at least 8 papers between 2004 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Dependence analysis for safe futures.

Armand Navabi, Xiangyu Zhang, Suresh Jagannathan

Sci. Comput. Program., 2012

2011

The semantics and analysis of safe futures

Armand Navabi

PhD thesis, 2011

2009

Exceptionally Safe Futures.

Armand Navabi, Suresh Jagannathan

Proceedings of the Coordination Models and Languages, 11th International Conference, 2009

Alchemist: A Transparent Dependence Distance Profiling Infrastructure.

Xiangyu Zhang, Armand Navabi, Suresh Jagannathan

Proceedings of the CGO 2009, 2009

2008

Quasi-static scheduling for safe futures.

Armand Navabi, Xiangyu Zhang, Suresh Jagannathan

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008

2005

The evaluation of two software watermarking algorithms.

Ginger Myles, Christian S. Collberg, Zachary V. Heidepriem, Armand Navabi

Softw. Pract. Exp., 2005

Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes.

Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi

J. Graph Algorithms Appl., 2005

2004

Graphael: A System for Generalized Force-Directed Layouts.

David Forrester, Stephen G. Kobourov, Armand Navabi, Kevin Wampler, Gary V. Yee

Proceedings of the Graph Drawing, 12th International Symposium, 2004