most citedThreshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication

51 citations · 97 across the 8 of their papers we have counts for

collaborators

8 papers

cond-mat.stat-mech20056 cited

Disaster Management in Scale-Free Networks: Recovery from and Protection Against Intentional Attacks

Behnam A. Rezaei, Nima Sarshar, P. Oscar Boykin +1

Susceptibility of scale free Power Law (PL) networks to attacks has been traditionally studied in the context of what may be termed as {\em instantaneous attacks}, where a randomly…

q-bio.MN20052 cited

Functionality Encoded In Topology? Discovering Macroscopic Regulatory Modules from Large-Scale Protein-DNA Interaction Networks

Riccardo Boscolo, Behnam A. Rezaei, P. Oscar Boykin +1

The promise of discovering a functional blueprint of a cellular system from large-scale and high-throughput sequence and experimental data is predicated on the belief that the same…

quant-ph200451 cited

Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication

T. Szkopek, P. O. Boykin, H. Fan +5

The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals…

cs.DC20044 cited

Balanced Overlay Networks (BON): Decentralized Load Balancing via Self-Organized Random Networks

Jesse S. A. Bridgewater, P. Oscar Boykin, Vwani P. Roychowdhury

We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of hete…

cond-mat.dis-nn20045 cited

A Statistical Mechanical Load Balancer for the Web

Jesse S. A. Bridgewater, P. Oscar Boykin, Vwani P. Roychowdhury

The maximum entropy principle from statistical mechanics states that a closed system attains an equilibrium distribution that maximizes its entropy. We first show that for graphs w…

cond-mat.dis-nn200426 cited

Scalable Percolation Search in Power Law Networks

Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury

We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched usi…