Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

First Page		Document Content
Date: 2015-05-29 10:12:12 Computational complexity theory Analysis of algorithms Theory of computation Mathematics Edsger W. Dijkstra Algorithm Mathematical logic Theoretical computer science Time complexity Shortest path problem Asymptotically optimal algorithm Randomized algorithm		Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 330,43 KB Share Document on Facebook

	An Interview with Edsger W. Dijkstra OH 330 Conducted by Philip L. Frana on DocID: 1t5Ar - View Document
	What can we learn from Edsger W. Dijkstra? by Tony Hoare. 0. Preamble I would like to start by joining all of you in the expression of deep gratitude to Schlumberger for the grant which set up a series of lectures to hon DocID: 1stfp - View Document
	PADTAD 2012 Curriculum for software development with concurrency - Jeremy S. Bradbury, João M. Lourenço, Ok-Kyoon Ha, In-Bon Kuh, Yong-Kee Jun Funding provided by: Concurrency – Education DocID: 1rqUv - View Document
	Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE DocID: 1rqFm - View Document
	Call for Papers Programming for Separation of Concerns (6th edition) http://www.dmi.unict.it/~tramonta/PSC10/ DocID: 1rpw5 - View Document