doi:[removed]j.tcs[removed]

First Page		Document Content
Date: 2007-11-27 04:57:32 Complexity classes Analysis of algorithms Network theory Shortest path problem Algorithm Parallel computing Distributed computing SL P Theoretical computer science Computational complexity theory Applied mathematics		doi:[removed]j.tcs[removed] Add to Reading List Source URL: www.cs.ucy.ac.cy Download Document from Source Website File Size: 359,22 KB Share Document on Facebook

	Millisort: An Experiment in Granular Computing Seo Jin Park with Yilong Li, Collin Lee and John Ousterhout Massively Parallel Granular Computing DocID: 1xUyt - View Document
	arXiv:1803.04432v1 [cs.DC] 12 MarMemory Models for C/C++ Programmers Manuel P¨oter Jesper Larsson Tr¨aff Research Group Parallel Computing DocID: 1xTxL - View Document
	FEIIC International Journal of Engineering and Technology, Vol. 13, No.2, 2016, ppSURVEY ANALYSIS ON THE EMBEDDED TCPP CURRICULUM IN PARALLEL AND DISTRIBUTED COMPUTING COURSE DocID: 1vq34 - View Document
	Parallel Computing with IPython: an application to air pollution modeling DocID: 1vlLp - View Document
	Multi-EM Multi-Method Inversion to Determine the Electrical Conductivity Distribution of the Subsurface Using Parallel Computing Architectures Multi-EM DocID: 1uVPD - View Document