Home Research-feed Channel Rankings GCT THU AI TR Open Data Must Reading

views: 8

Scott Roche

Northeastern University, Boston, MA, USA

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers6 papers

Sort

By YearBy Citation

Better Bounds for Coalescing-Branching Random Walks

Michael Mitzenmacher,Rajmohan Rajaraman,Scott Roche

ACM TRANSACTIONS ON PARALLEL COMPUTING, no. SP1 (2018)

Bibtex

Better bounds for coalescing-branching random walks

Michael Mitzenmacher,Rajmohan Rajaraman,Scott T. Roche

SPAA, no. 1 (2016)

Cited by11EIBibtex

On constructing DAG‐schedules with large areas

Scott T. Roche,Arnold L. Rosenberg,Rajmohan Rajaraman

Concurrency and Computation: Practice and Experience, no. 16 (2015)

Cited by9EIBibtex

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

John Augustine,Gopal Pandurangan,Peter Robinson,Scott T. Roche,Eli Upfal

IEEE Symposium on Foundations of Computer Science, pp.350-369, (2015)

Cited by26EIBibtex

On Constructing DAG-Schedules with Large AREAs

Scott T. Roche,Arnold L. Rosenberg,Rajmohan Rajaraman

Lecture Notes in Computer Science, (2014): 620-631

Cited by9EIBibtex

Coalescing-branching random walks on graphs

Chinmoy Dutta,Gopal Pandurangan,Rajmohan Rajaraman,Scott T. Roche

SPAA, no. 3 (2013): 176-185

Cited by14EIBibtex

View All

Base Info Papers Patents Projects