PhDElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/183888/2/6505369.pd
The classical method of solving random walk problems involves using Markov chain theory. When the pa...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
Ph.D.Electrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp:...
http://deepblue.lib.umich.edu/bitstream/2027.42/7322/5/bad1620.0001.001.pdfhttp://deepblue.lib.umich...
Abstract—This article summarizes the basic concept of random walk algorithm. Random walk algorithm’s...
PhDElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://...
AbstractWe develop some general techniques for converting randomized parallel algorithms into determ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
A behavioural theory comprises a set of postulates that characterise a particular class of algorith...
This dissertation focuses on scalable parallel algorithms for irregular communication, random data a...
http://deepblue.lib.umich.edu/bitstream/2027.42/7309/5/bap3247.0001.001.pdfhttp://deepblue.lib.umich...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Random walks on graphs are a staple of many ranking and recommendation algorithms. Simulating random...
Performing random walks in networks is a fundamental primitive that has found applications in many a...
The classical method of solving random walk problems involves using Markov chain theory. When the pa...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
Ph.D.Electrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp:...
http://deepblue.lib.umich.edu/bitstream/2027.42/7322/5/bad1620.0001.001.pdfhttp://deepblue.lib.umich...
Abstract—This article summarizes the basic concept of random walk algorithm. Random walk algorithm’s...
PhDElectrical engineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://...
AbstractWe develop some general techniques for converting randomized parallel algorithms into determ...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
A behavioural theory comprises a set of postulates that characterise a particular class of algorith...
This dissertation focuses on scalable parallel algorithms for irregular communication, random data a...
http://deepblue.lib.umich.edu/bitstream/2027.42/7309/5/bap3247.0001.001.pdfhttp://deepblue.lib.umich...
This session explores, through the use of formal methods, the “intuition” used in creating a paralle...
Random walks on graphs are a staple of many ranking and recommendation algorithms. Simulating random...
Performing random walks in networks is a fundamental primitive that has found applications in many a...
The classical method of solving random walk problems involves using Markov chain theory. When the pa...
The mapping of Branch and Bound (BB) algorithms on Distributed Memory Multiprocessors (DMMs) is cons...
In this thesis we examine three problems in graph theory and propose efficient parallel algorithms f...
DOI
Add to ORKG