1. J. Barnat, P. Bauch, L. Brim & M. Češka (2010): Employing Multiple CUDA Devices to Accelerate LTL Model Checking. In: Proceedings of the 16th International Conference on Parallel and Distributed Systems. IEEE Computer Society, Los Alamitos, CA, USA, pp. 259–266, doi:10.1109/ICPADS.2010.82.
  2. J. Barnat, P. Bauch, L. Brim & M. Češka (2011): Computing Strongly Connected Components in Parallel on CUDA. In: Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS'11). IEEE Computer Society, pp. 541–552.
  3. J. Barnat, L. Brim, M. Češka & P. Ročkai (2010): DiVinE: Parallel Distributed Model Checker (Tool paper). In: Proceedings of joint HiBi/PDMC workshop, HiBi/PDMC 2010. IEEE, pp. 4–7.
  4. S. M. Burns (1991): Performance Analysis and Optimization of Asynchronous Circuits. California Intitute of Technology, Pasadena.
  5. S. M. Burns, H. Hulgaard, T. Amon & G. Borriello (1995): An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems. IEEE Transaction on Computers 44(11), pp. 1306–1317, doi:10.1109/12.475126.
  6. J. Chaloupka (2006): Distributed Algorithms for the Minimum Mean Weight Cycle Problem. Masaryk University, Faculty of Informatics, Brno.
  7. S. Chatterjee, G. E. Blelloch & M. Zagha (1990): Scan Primitives for Vector Computers. In: Proceedings of the 2nd International Conference for High Performance Computing, Networking, Storage and Analysis (SC '90). IEEE Computer Society, Los Alamitos, CA, USA, pp. 666–675.
  8. B. V. Cherkassky, L. Georgiadis, A. V. Goldberg, R. E. Tarjan & R. F. Werneck (2010): Shortest Path Feasibility Algorithms: An Experimental Evaluation. Journal of Experimental Algorithmics 14, pp. 118–132.
  9. (April 2011): NVIDIA CUDA Compute Unified Device Architecture - Programming Guide Version 4.0.
  10. A. Dasdan & R. K. Gupta (1997): Faster Maximum and Minimum Mean Cycle Algorithms for System Performance Analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, pp. 889–899, doi:10.1109/43.728912.
  11. A. Dasdan, S. S. Irani & R. K. Gupta (1999): Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proceedings of the 36th annual ACM/IEEE Design Automation Conference, DAC '99. ACM, pp. 37–42, doi:10.1145/309847.309862.
  12. P. Harish & P. Narayanan (2007): Accelerating Large Graph Algorithms on the GPU Using CUDA. In: High Performance Computing (HiPC'07), Lecture Notes in Computer Science 4873. Springer Berlin / Heidelberg, pp. 197–208, doi:10.1007/978-3-540-77220-0_21.
  13. W. D. Hillis (1987): The Connection Machine. Scientific American 256(6), pp. 108–115, doi:10.1038/scientificamerican0687-108.
  14. R. A. Howard (1960): Dynamic Programming and Markov Processes. MIT Press, Cambridge, MA.
  15. K. Ito & K. K. Parhi (1995): Determining the Minimum Iteration Period of an Algorithm. The Journal of VLSI Signal Processing 11(3), pp. 229–244, doi:10.1007/BF02107055.
  16. L. Kleinrock (1975): Queueing Systems, Volume 1: Theory. Wiley-Interscience, New York.
  17. E. L. Lawler (1976): Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY.
  18. R. Lu & C. Koh (2006): Performance Analysis of Latency-Insensitive Systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(3), pp. 469–483, doi:10.1109/TCAD.2005.854636.
  19. A. Mathur, A. Dasdan & R. K. Gupta (1998): Rate Analysis for Embedded Systems. ACM Transaction on Design Automation of Electronic Systems 3(3), pp. 408–436, doi:10.1145/293625.293631.
  20. M. K. Molloy (1982): Performance Analysis Using Stochastic Petri Nets. IEEE Transactions on Computers 31(9), pp. 913–917, doi:10.1109/TC.1982.1676110.
  21. S. Patidar & P. J. Narayanan (2009): Scalable Split and Gather Primitives for the GPU. Technical Report IIT/TR/2009/99. Centre for Visual Information Technology, Hyderabad, INDIA.
  22. C. V. Ramamoorthy & G. S. Ho (1980): Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets. IEEE Transaction of Software Engineering 6(5), pp. 440–449, doi:10.1109/TSE.1980.230492.
  23. R. Tarjan (1971): Depth-First Search and Linear Graph Algorithms. In: Proceedings of the 12th Annual Symposium on Switching and Automata Theory. IEEE Computer Society, Los Alamitos, CA, USA, pp. 114–121, doi:10.1109/SWAT.1971.10.

Comments and questions to:
For website issues: