SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy

Chenhua Fan; Honghao Wei; Janardhan Rao Doppa; Yassine Chemingui

REVIEW 4 major objections 4 minor 300 references

SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy

T0 review · 4 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper argues that tail risk in safe reinforcement learning can be certified—and controlled—by comparing the rollout cost distribution to a safe reference with kernelized Stein discrepancy, without estimating the tail.

desk verdict A genuinely novel empirical idea with a load-bearing gap between the theoretical certificate and the implemented algorithm; worth sending to review, but the formal guarantee as written does not cover what is actually run. read the letter →

arxiv 2607.13175 v1 pith:JXGSMW36 submitted 2026-07-14 cs.LG cs.AI

Yassine Chemingui , Chenhua Fan , Honghao Wei , Janardhan Rao Doppa This is my paper · ORCID

classification cs.LGcs.AI

keywords safereinforcementlearningtailriskSteindiscrepancydistributionalsafetycertificateconstrainedMarkovdecisionprocessrare-eventconstraintskernelizedbang-bangcontrol

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that tail-sensitive safety in reinforcement learning—the risk of rare but catastrophic constraint violations—can be certified without fitting the tail of the cost distribution. Its proposal is to compare the distribution of observed rollout costs against a user-specified safe reference using kernelized Stein discrepancy, and to use the resulting upper bound on tail risk as a binary switch: keep optimizing reward while the certificate holds, switch to cost recovery when it breaks. The authors prove a concentration inequality for the empirical certificate and a trust-region theorem stating that, when the Stein scale factor is large enough, each policy update preserves the tail-risk budget with high probability. A sympathetic reader would care because this offers a distributional safety guarantee for online RL without fragile parametric tail estimation, and the experiments suggest fewer and less severe violations during training at competitive returns.

What carries the argument

The load-bearing object is the hybrid Stein certificate U(θ) = E_{p_ref}[h(C)] + λ SD_tot(q_{πθ} || p_ref), where SD_tot is a split discrepancy: a one-sided boundary penalty on probability mass at the zero-cost and full-violation atoms, plus a kernelized Stein discrepancy (KSD) computed on the interior of the normalized cost interval. The operator that carries the argument is the Langevin–Stein operator applied to a hybrid safe reference p_ref = a0 δ0 + a1 δ1 + (1−a0−a1) p_int, which accounts for cost clipping without parametric tail fitting. This object's work is to make the certificate a genuine upper bound on tail risk via the Stein equation, and to give the switching controller a signal

What would settle it

During training, log the empirical tail risk E_{C∼q}[h(C)] and the certificate U(θ) on every batch. If U(θ) is ever smaller than the empirical tail risk while the gate is in reward-maximization mode, the certificate is not one-sided and the safety guarantee fails. A second check: disable the empirical-guard override in Algorithm 2 and compare violation rates; if violations rise without the guard, the empirical override was doing the safety work, not the Stein bound.

Watch

Extended reading notes

Core claim

The central claim is that the tail-risk functional E_{τ∼π}[h(C(τ))] is upper-bounded by the reference expectation E_{p_ref}[h(C)] plus a Stein-discrepancy term, provided the reference is a hybrid distribution with boundary atoms at zero cost and at the violation threshold. The paper argues this bound is computable from rollout samples and the reference score function, is one-sided and monotone in distributional drift, and can serve as a real-time distributional safety certificate. Its main theorem states that if the current cost distribution forms a Stein margin and the next policy respects a trust-region constraint with that margin, the post-update tail risk stays under the budget with high

Load-bearing premise

The guarantee depends on whether the number the algorithm actually computes truly upper-bounds the rare-event risk, and whether each policy update in practice obeys the safety condition used in the proof; neither is shown for the fixed certificate weights used in experiments.

Editorial extensions

If this is right

If the certificate is a true upper bound, then monitoring U(θ) gives real-time tail-risk monitoring from on-policy samples alone, with no density estimation and no rare-event fitting.
Under the trust-region condition of Theorem 4.3, each policy update preserves the risk budget with high probability, so the gate enforces lexicographic safety priority: reward gradients are used only when the certificate is satisfied.
Because the boundary term is one-sided, losing zero-cost mass or gaining violation mass raises the certificate, while harmless shifts toward fewer violations do not trigger recovery.
The concentration bound shows the empirical certificate error decays as roughly O(1/√m + (1+SD_int)/√n), so the gate can be evaluated with small on-policy batch sizes.
The reported experiments on continuous-control benchmarks indicate lower violation frequency and severity during training, with competitive returns compared with expectation-based and tail-modeling baselines.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A testable extension the authors leave implicit: the same certificate could serve as a generic distributional-shift monitor in cost space, flagging when the environment or task changes, provided the reference is re-specified.
In the theorem, the required Stein scale factor λ_k is inversely proportional to SD+_tot(q_{π_k}||p_ref), so when the rollout distribution is already very close to the safe reference the lower bound can blow up; a practical implementation would need adaptive λ or else the guarantee is vacuous exactly in the safest regime.
Algorithm 2's empirical guard, which replaces the Stein bound with raw empirical risk in trivially safe regimes, is a sensible variance reduction but breaks the one-sidedness of the certificate; an ablation that removes the guard would show whether the guard, rather than the bound, is responsible for the observed safety.
The boundary-aware hybrid reference could be adapted to other clipped cumulative quantities, such as budget-constrained resource consumption, by reinterpreting the atoms at 0 and 1 as 'unused budget' and 'budget exhausted'.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Mark: the paper is worth reading for the empirical phenomenon, but not for its central claim. The genuinely new pieces are the hybrid reference with boundary atoms, the one-sided split discrepancy, and the bang-bang gate. Those are real ideas, and the experiments on Safety Gym and Safety MuJoCo show lower violation rates than CPO and less conservatism than EVO, so the method has practical texture.

The soft spot is exactly where the stress-test note points. The U that Algorithm 2 actually computes is not the U from Proposition B.1. The proposition requires lambda >= max{1, B_int} and uses w(q)*SD_int; the algorithm sets lambda_stein=0.10, drops the w(q) weight, and then the empirical guard on lines 17-22 replaces the bound with the raw empirical mean in the safe-looking regime. For Beta(2,5), B_int is likely well above 1, so the one-sided inequality can fail: there are rollout distributions where the gate says SAFE while the bound is actually violated. Theorem 4.3 also assumes a trust-region safety constraint that Algorithm 1 does not enforce. So the 'rigorous distributional safety certificate' is a certificate for a hypothetical algorithm, not for the evaluated one. That is a load-bearing gap, not a presentation issue.

The stress-test note lands on reading the paper. The appendix tries to connect the pieces, but the connection is missing exactly where the constants meet the implementation. This is fixable in principle - derive the certificate constants from the reference, enforce or drop the trust-region condition, and validate the empirical guard - but as written, the theory and the algorithm are not the same object.

I would still send this to peer review. The problem is real, the method is novel enough to deserve referee time, and the empirical comparison is careful about baselines. But I would expect major revision, and I would not let the formal guarantee stand without the missing derivations. For a reading group, maybe; I would not cite it yet in its current form. My take: solid empirical idea, unsupported certificate.

Referee Report

4 major / 4 minor

Summary. The paper proposes SteinGate, a distributional safety certificate for safe RL that upper-bounds a tail-sensitive risk functional E_q[h(C)] by comparing the rollout cost distribution q to a user-specified hybrid reference p_ref with atoms at the clipped boundaries 0 and 1. The certificate is used as a bang-bang gate: reward-maximizing updates when the certificate is below a budget, and recovery updates otherwise. The authors prove a hybrid Stein certificate (Prop. B.1), concentration bounds for the empirical certificate (Prop. B.3), and a trust-region safety bound (Theorem 4.3). Experiments on Safety Gymnasium and Safety MuJoCo report lower violation rates than CPO/EVO baselines. The central advertised claim is that SteinGate provides a rigorous, real-time tail-risk certificate.

Significance. The idea of certifying tail risk through a boundary-aware, KSD-based distributional comparison is attractive: it avoids density estimation of the implicit rollout distribution and is more tail-sensitive than expected-cost constraints. The paper supplies formal lemmas, concentration results, and code/ablations, which is commendable. However, the implemented algorithm is not the object analyzed by the paper's own theory. The certificate actually computed in Algorithm 2 drops the interior-mass weight from Prop. B.1, uses a hand-set λ_stein that is not connected to B_int, and adds an empirical guard that replaces the bound with an unbiased estimator. The main safety theorem assumes a trust-region safety constraint that Algorithm 1 never enforces. These are load-bearing disconnects, so the empirical results do not currently validate the proposed certificate.

major comments (4)

[Appendix C, Algorithm 2; Prop. B.1; Lemma 3] Algorithm 2 computes U_stein = h_ref + λ_disc D_disc + λ_stein D_ksd, with λ_disc=1.0 and λ_stein=0.10 (Table 2). Prop. B.1 requires λ ≥ max{1, B_int} and an interior term weighted by w(q): SD_tot = [a0*-a0(q)]_+ + [a1(q)-a1*]_+ + w(q) SD_int. The algorithm drops the w(q) factor entirely and scales the unweighted KSD by 0.10. For the default Beta(2,5) interior, Lemma 3 gives M_p=1 and K_p>0, so B_int = 2(K_p + 1/4 + K_p) is about 2, far above 0.10. Thus the hypothesis of Prop. B.1 is not met and E_q[h(C)] ≤ U is not established for the implemented estimator; the gate can label a rollout SAFE when the stated certificate bound is actually violated.
[Theorem 4.3; Appendix B.4, Eq. (42); Algorithm 1] Theorem 4.3's conclusion holds only under the trust-region safety constraint (42) and a problem-dependent lower bound λ_k ≥ 2H ε ... · D_TV(...) / SD+_tot(qπ_k || p_ref). Algorithm 1 never enforces constraint (42), and Algorithm 2 uses the fixed λ_stein=0.10 from Table 2 with no adaptation to the required lower bound. Moreover, when SD+_tot is small, the required λ_k can be arbitrarily large. Hence the theorem does not apply to the algorithm that was actually run and evaluated.
[Algorithm 2, line 6; Eq. (9), Eq. (11)] The reference risk is defined in Eq. (11) as E_{C∼p_ref}[h(C)] for the hybrid reference p_ref = a*_0 δ_0 + a*_1 δ_1 + (1-a*_0-a*_1) p_int. Algorithm 2 line 6 instead computes h_ref ← E_{z∼Beta(α,β)}[σ(z)], omitting the atom masses a*_0 and a*_1. This changes the baseline by a*_0 h(0)+a*_1 h(1)-(a*_0+a*_1) E_{p_int}[h], which is not negligible for the reported a* values. The implemented certificate is therefore not the one for which the one-sided bound was proved.
[Algorithm 2, lines 17-22] The 'empirical guard' replaces the Stein upper bound with the raw empirical mean ĥ_emp whenever â_1≈0 and ĥ_emp≤h_ref. The empirical mean is not an upper bound on E_q[h(C)]; with finite samples it can understate the true risk. This heuristic override therefore breaks the one-sidedness of the certificate and can return SAFE even when the theoretical guarantee would not hold. Since the empirical evaluation uses this override, the reported safety results cannot be attributed to the certified Stein bound.

minor comments (4)

[Appendix B.3, Eq. (29)] The boundary neighborhoods {c_i ≤ τ_0} and {c_i ≥ 1-τ_1} are not specified, and Algorithm 2 instead uses exact zeros and ones. Please define τ_0, τ_1 and reconcile the estimator with the bound.
[Table 2; Algorithm 2] The sigmoid risk mapping σ(·) is used in Algorithm 2 but never defined. Table 2 lists u_norm and eta without giving the functional form of σ.
[Section 5.2, Table 1] The text says SteinGate delivers 'substantially higher feasible returns (e.g., nearly 3× higher on PointGoal1 and 4× on CarGoal1)'. This is true only relative to EVO; CPO has higher feasible return on PointGoal1 (19.21 vs 9.77). Please scope the comparison explicitly.
[Section 4.2] The paper is explicit that p_ref is a safety specification rather than an estimate, but the implications for reference misspecification (persistent recovery mode, no formal method to choose a*) could be discussed more prominently as a limitation.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Stein certificate and Theorem 4.3 are derived from external Stein-method and trust-region results; the fixed weights and empirical guard are implementation gaps, not circular reductions.

full rationale

The paper's derivation chain is not circular. Lemma 1 is the standard Stein bound (Stein, 1972; Gorham and Mackey, 2015) and Proposition B.1 supplies a hybrid extension with an explicit condition lambda >= max{1, B_int} and the w(q)-weighted interior term; it does not define the target risk in terms of the certificate. Theorem 4.3 is derived from the performance-difference lemma of Achiam et al. (2017), which is cited as prior external work, and the displayed lower bound on lambda_k is a sufficient condition obtained by algebraically requiring the Stein margin m_k to dominate the trust-region error term. The certificate is therefore not equivalent to its inputs by construction. The practical Algorithm 2 uses hand-set weights lambda_disc=1.0, lambda_stein=0.10 and drops the w(q) weighting and B_int factor, so the implemented U may not satisfy the hypotheses of Prop. B.1; similarly, the empirical guard lines 17-22 replace the bound with the raw empirical mean in trivially-safe regimes. These are correctness/calibration gaps between the theory and the evaluated implementation, not circularity: no parameter is fitted to the target tail risk and then renamed as a prediction, and no load-bearing premise is justified solely by a self-citation. The self-citations (Chemingui et al. 2025a,b) appear only in the related-work enumeration of reductions to unconstrained RL and are not used to establish the certificate or the safety bound. The user-specified reference p_ref is a safety specification, and the guarantee is conditional on it; that is a modeling assumption, not a self-referential reduction. The central result remains an independent mathematical statement derived from standard, externally cited tools, so the appropriate finding is no significant circularity (score 0).

Assumptions & free parameters 7 free parameters · 5 assumptions · 1 invented entities

The central claim depends on several hand-set parameters (λ_disc, λ_stein, ε_target, Beta reference, boundary masses, sigmoid parameters, kernel bandwidth) plus assumptions about smooth interior densities and the trust-region constraint. The most serious is the ad hoc assumption that the optimizer update satisfies Eq. (42) with the Stein margin, which Algorithm 1 does not enforce.

free parameters (7)

certificate weight λ_disc = 1.0
Hand-set in Table 2; scales the boundary-mass penalty in the certificate.
certificate weight λ_stein = 0.10
Hand-set in Table 2; scales the interior Stein discrepancy. Not derived from the Stein-factor bound B(h,p).
gate risk budget ε_target = 0.10
Threshold for the switching decision; hand-set, no calibration against actual violation probability.
interior reference Beta parameters (α, β) = α=2.0, β=5.0 default
Shape of the interior reference density; ablations use Beta(1,10) and logit-normal, showing sensitivity.
reference boundary masses a*_0, a*_1 = not reported
Required by Algorithm 2 but not listed in the hyperparameter table; presumably hand-set in code.
sigmoid risk-mapping parameters (u_norm, eta) = u_norm=0.5, eta=0.02
Shape the test function h; chosen in Table 2 without a principled derivation.
KSD kernel bandwidth = unspecified
Only min_bandwidth=0.05 and interior_clip=1e-5 are given; the actual RBF bandwidth used in KSD is not specified.

assumptions (5)

standard math Stein identity and integration by parts hold for the reference and interior conditional distributions; boundary terms vanish after clipping.
The certificate rests on the Langevin–Stein operator identity E_p[A_p f]=0 (Section 3, Eq. (6)-(7); Definition A.2).
domain assumption The interior conditional rollout distribution q_int has a smooth density on (0,1) so that KSD and the Stein equation apply.
Clipped episodic costs can produce atoms and non-smooth interior mass; the hybrid operator assumes a continuous component with a density (Section 4.1, 4.2).
ad hoc to paper The backbone update π_{k+1} satisfies the trust-region safety constraint (42) with the Stein margin m_k = λ_k SD+_tot.
Algorithm 1 only gates on U(θ); it does not enforce this surrogate constraint in the optimizer, so the theorem's sufficient condition is not shown to hold in training.
domain assumption Rollout cost samples are i.i.d. or 'approximately independent mini-batch samples' for Hoeffding/McDiarmid concentration.
Correlated trajectory costs reduce effective sample size; the paper handwaves this with a short parenthetical in Appendix B.3.
domain assumption The Stein kernel is bounded on the clipped interior, |u_pint(x,y)| ≤ M_u.
Assumption 4.1 is needed for the McDiarmid bound on the V-statistic; it is assumed rather than verified for the chosen Beta/RBF kernels after clipping.

invented entities (1)

User-specified hybrid safe reference distribution p_ref = a*_0 δ0 + a*_1 δ1 + (1-a*_0-a*_1) p_int
purpose: Defines acceptable cost behavior; serves as the target distribution for the Stein certificate and the gate.
A normative modeling choice. Whether closeness to p_ref bounds tail risk depends on unverified constants (B, λ); no falsifiable external handle is provided for the reference's correctness.

how reviews work

0 comments

Cite this review

Pith. "Pith review of SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy." pith.science (2026). https://pith.science/paper/JXGSMW36

@misc{pith2026260713175,
  author       = {Pith},
  title        = {Pith review of: SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JXGSMW36}},
  note         = {Machine review of arXiv:2607.13175}
}

read the original abstract

Safe reinforcement learning typically enforces safety by bounding expected cumulative costs, a criterion that often fails to detect rare but catastrophic tail events. To overcome these limitations, this paper introduces SteinGate, a boundary-aware distributional safety certificate that replaces fragile tail fitting with a robust consistency check using Kernelized Stein Discrepancy while accounting for boundary atoms induced by clipped costs. SteinGate evaluates whether observed policy rollout costs remain consistent with a safe reference distribution, providing a non-parametric safety certificate. This certificate is used to dynamically adapt the learning regime: favoring reward-improving policy updates when rollouts remain consistent with the safe reference and switching to recovery behavior when the cost tail deviates. Experiments on continuous-control benchmarks demonstrate that SteinGate significantly reduces both the frequency and severity of constraint violations during training while maintaining competitive returns relative to state-of-the-art baselines.

Figures

Figures reproduced from arXiv: 2607.13175 by the authors.

**Figure 2.** Results comparing SteinGate and baselines on Safety Gym tasks. The x-axis denotes the total training steps, and [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

**Figure 3.** Cost-limit sensitivity of SteinGate on SafetyPointGoal1-v0. The plots show episodic return (left) and episodic cost (right) during training under different cost limits (κ =10, 25, 40). Dashed lines indicate the corresponding cost thresholds. three specifications, the costs remain relatively consistent, suggesting that the mechanism for constraint enforcement is not highly sensitive to the specific choice of referen… view at source ↗

Figures from the paper (5 more)

**Figure 4.** Figure 4: SteinGate safe reference ablation on SafetyPointGoal1-v0. Episodic return (left) and episodic cost (right) during training for three interior reference distributions: Beta(1,10), Beta(2,5), and logit-normal. like tail-modeling approaches (e.g., EVO) that often require…

**Figure 5.** Figure 5: SteinGate sample size ablation on SafetyCarGoal1- [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]

**Figure 6.** Figure 6: Performance on velocity benchmarks. The top row shows episodic return and the bottom row shows episodic cost [PITH_FULL_IMAGE:figures/full_fig_p021_6.png]

**Figure 7.** Figure 7: Comparison of SteinGate with additional baselines. The top row shows episodic return, and the bottom row shows [PITH_FULL_IMAGE:figures/full_fig_p022_7.png]

**Figure 8.** Figure 8: Comparison of SteinGate with CPO variants. The top row shows episodic return and the bottom row shows [PITH_FULL_IMAGE:figures/full_fig_p022_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 1 canonical work pages

[1]

2006 , month =

3GPP TR 25.913 , title =. 2006 , month =

2006
[2]

Vannithamby and G

R. Vannithamby and G. Li and H. Yin and and S. Ahmadi , journal =
[3]

Aalto and P

S. Aalto and P. Lassila , title =. Proc. Teletraffic Conference on Managing traffic performance in converged networks , year =
[4]

and Lassila, P

Aalto, S. and Lassila, P. , title =. Next Generation Internet (NGI), 2010 6th EURO-NF Conference on , year =

2010
[5]

D. J. Abadi and Y. Ahmad and M. Balazinska and U. C etintemel and M. Cherniack and J.-H. Hwang and W. Lindner and A. Maskey and A. Rasin and E. Ryvkina and N. Tatbul and Y. Xing and S. B. Zdonik , title =. 2005 , address =

2005
[6]

and Yi Lu and Campbell, R.H

Abad, C.L. and Yi Lu and Campbell, R.H. , title =. 2011 , pages =

2011
[7]

and Cuomo, F

Abbagnale, A. and Cuomo, F. , title =. 2010 , pages =

2010
[8]

2011 , volume =

Abdallah, Yara and Latif, Mohamed Abdel and Youssef, Moustafa and Sultan, Ahmed and El Gamal, Hesham , title =. 2011 , volume =

2011

Show all 300 references

[9]

Abe and A

N. Abe and A. Biermann and P. Long , title =. Algorithmica , year =
[10]

Abrams and H

Z. Abrams and H. L. Chen and L. Guibas and J. Liu and F. Zhao , title =. 2006 , pages =

2006
[11]

2006 , pages =

Zoe Abrams and Jie Liu , title =. 2006 , pages =

2006
[12]

and Lobel, Ilan and Ozdaglar, Asuman , title =

Acemoglu, Daron and Dahleh, Munther A. and Lobel, Ilan and Ozdaglar, Asuman , title =. Review of Econ. Stud. , year =
[13]

Adireddy and L

S. Adireddy and L. Tong , title =. 2005 , number =

2005
[14]

Adlakha, Sachin and Johari, Ramesh , title =
[15]

Aeron and V

S. Aeron and V. Saligrama , title =. 2007 , number =

2007
[16]

Agarwal and P

A. Agarwal and P. R. Kumar , title =. Wireless Communications and Mobile Computing , year =
[17]

SPIE Optical Engineering and Applications , year =

Agaskar, Ameya and Lu, Yue M , title =. SPIE Optical Engineering and Applications , year =
[18]

, title =

Agrawal, Dakshi and Aggarwal, Charu C. , title =. 2001 , pages =

2001
[19]

2000 , pages =

Agrawal, Rakesh and Srikant, Ramakrishnan , title =. 2000 , pages =

2000
[20]

Ahmad and U

Y. Ahmad and U. Cetintemel , title =. 2004 , pages =

2004
[21]

Aikat and J

J. Aikat and J. Kaur and F. D. Smith and K. Jeffay , title =. Proc. ACM Sigcomm, Internet Measurement Conference , year =
[22]

S. M. Aji and R. J. McEliece , title =. 2000 , volume =

2000
[23]

and Tanaka, A

Ajiro, Y. and Tanaka, A. , title =. International Conference for the Computer Measurement Group , year =
[24]

and Andrews, M

Akyol, U. and Andrews, M. and Gupta, P. and Hobby, J. and Saniee, I. and Stolyar, A. , title =. 2008 , pages =

2008
[25]

and Lee, W.Y

Akyildiz, I.F. and Lee, W.Y. and Vuran, M.C. and Mohanty, S. , title =. Communications Magazine, IEEE , year =
[26]

Albert and H

R. Albert and H. Jeong and A.-L. Barabasi , title =. 2000 , volume =

2000
[27]

, title =

Aldous, David J. , title =. \'Ecole d'\'Et\'e de Probabilit\'es de Saint--Flour XIII --- 1983 , publisher =. 1985 , volume =

1983
[28]

2008 , pages =

Al-Fares, Mohammad and Loukissas, Alexander and Vahdat, Amin , title =. 2008 , pages =

2008
[29]

and Basar, T

Altman, E. and Basar, T. and Srikant, R. , title =. 2002 , volume =

2002
[30]

and Basar, T

Altman, E. and Basar, T. and Srikant, R. , title =. Automatica , year =
[31]

Differential Privacy: On the Trade-Off between Utility and Information Leakage , booktitle =

Alvim, M\'. Differential Privacy: On the Trade-Off between Utility and Information Leakage , booktitle =. 2012 , volume =

2012
[32]

User Modeling, Adaptation, and Personalization , publisher =

Amatriain, Xavier and Pujol, Josep M and Oliver, Nuria , title =. User Modeling, Adaptation, and Personalization , publisher =. 2009 , pages =

2009
[33]

M. M. Amble and P. Parag and S. Shakkottai and L. Ying , title =. 2011 , address =

2011
[34]

2011 , pages =

Ananthanarayanan, Ganesh and Agarwal, Sameer and Kandula, Srikanth and Greenberg, Albert and Stoica, Ion and Harlan, Duke and Harris, Ed , title =. 2011 , pages =

2011
[35]

Probability in the engineering and informational sciences , year =

Anantharam, V and Benchekroun, M , title =. Probability in the engineering and informational sciences , year =
[36]

2012 , pages =

Ananthanarayanan, Ganesh and Ghodsi, Ali and Wang, Andrew and Borthakur, Dhruba and Kandula, Srikanth and Shenker, Scott and Stoica, Ion , title =. 2012 , pages =

2012
[37]

2010 , pages =

Ananthanarayanan, Ganesh and Kandula, Srikanth and Greenberg, Albert and Stoica, Ion and Lu, Yi and Saha, Bikas and Harris, Edward , title =. 2010 , pages =

2010
[38]

Anderegg and S

L. Anderegg and S. Eidenbenz , title =. 2003 , pages =

2003
[39]

Andrews and K

M. Andrews and K. Kumaran and K. Ramanan and A.L. Stolyar and R. Vijayakumar and P. Whiting , title =. 2004 , volume =

2004
[40]

Andrews and K

M. Andrews and K. Kumaran and K. Ramanan and A.L. Stolyar and R. Vijayakumar and P. Whiting , title =. Bell Labs Tech. Memo , year =
[41]

and Shakkottai, S

Andrews, J. and Shakkottai, S. and Heath, R. and Jindal, N. and Haenggi, M. and Berry, R. and Guo, D. and Neely, M. and Weber, S. and Jafar, S. and Yener, A. , title =. IEEE Communications Magazine , year =
[42]

Anshelevich and A

E. Anshelevich and A. Dasgupta and E. Tardos and T. Wexler , title =. 2003 , pages =

2003
[43]

IEEE Data Engineering Bulletin, , year =

Arasu, Arvind and Babcock, Brian and Babu, Shivnath and Datar, Mayur and Ito, Keith and Nishizawa, Itaru and Rosenstein, Justin and Widom, Jennifer , title =. IEEE Data Engineering Bulletin, , year =
[44]

2013 , pages =

Argyraki, Katerina and Diggavi, Suhas and Duarte, Melissa and Fragouli, Christina and Gatzianas, Marios and Kostopoulos, Panagiotis , title =. 2013 , pages =

2013
[45]

Arisoylu and T

M. Arisoylu and T. Javidi and R. Cruz , title =. 2006 , month =

2006
[46]

Armony and N

M. Armony and N. Bambos , title =. Queueing Systems: Theory and Applications , year =
[47]

and Fox, A

Armbrust, M. and Fox, A. and Griffith, R. and Joseph, A.D. and Katz, R.H. and Konwinski, A. and Lee, G. and Patterson, D.A. and Rabkin, A. and Stoica, I. and others , title =. 2009 , note =

2009
[48]

2003 , author =

Applied Probability and Queues , publisher =. 2003 , author =

2003
[49]

A diffusion regime with nondegenerate slowdown , author=
[50]

and Bui, L

Athanasopoulou, E. and Bui, L. and Ji, T. and Srikant, R. and Stoylar, A. , title =. Arxiv preprint arXiv:1005.4984 , year =

arXiv
[51]

and Bui, L

Athanasopoulou, E. and Bui, L. and Ji, T. and Srikant, R. and Stoylar, A. , title =. 2013 , volume =

2013
[52]

Athreya and Soumendra N

Krishna B. Athreya and Soumendra N. Lahiri , address =. Measure Theory and Probability Theory , publisher = springer, year =
[53]

AT&T Mobile TV , note =
[54]

Auer and N

P. Auer and N. Cesa-Bianchi and Y. Freund and R. Schapire , title =. SIAM Journal on Computing , year =
[55]

and Azar, Y

Avrahami, N. and Azar, Y. , title =. Proc. 15th Symp. on Parallel Algorithms and Architectures (SPAA , year =
[56]

Axelrod , title =

R. Axelrod , title =. The American Political Science Review , year =
[57]

and Erausquin, M

Ayesta, U. and Erausquin, M. and Jacko, P. , title =. Performance Evaluation , year =
[58]

2007 , pages =

Azimi-Sadjadi, Babak and Kiayias, Aggelos and Mercado, Alejandra and Yener, Bulent , title =. 2007 , pages =

2007
[59]

2009 , author =

Stochastic Geometry and Wireless Networks , publisher =. 2009 , author =

2009
[60]

and Khude, N

Baccelli, F. and Khude, N. and Laroia, R. and Li, J. and Richardson, T. and Shakkottai, S. and Tavildar, S. and Wu, X. , title =. 2012 , pages =

2012
[61]

and Li, J

Baccelli, F. and Li, J. and Richardson, T. and Shakkottai, S. and Subramanian, S. and Wu, X. , title =. 2011 , pages =

2011
[62]

and Har-Peled, S

Badoiu, M. and Har-Peled, S. and Indyk, P. , title =. 2002 , pages =

2002
[63]

1975 , author =

The mathematical theory of infectious diseases and its applications , publisher =. 1975 , author =

1975
[64]

Ballester and A

C. Ballester and A. Calvo-Armengol and Y. Zenou , title =. Econometrica , year =
[65]

Bala and S

V. Bala and S. Goyal , title =. Review of Economic Studies , year =
[66]

Balasubramanian and B

A. Balasubramanian and B. N. Levine and A. Venkataramani , title =
[67]

Bansal and M

N. Bansal and M. Harchol-Balter , title =. 2001 , pages =

2001
[68]

Bansal and Z

N. Bansal and Z. Liu , title =. 2003 , address =

2003
[69]

1988 , pages =

Barbour, Andrew D , title =. 1988 , pages =

1988
[70]

Barabasi and R

A.-L. Barabasi and R. Albert , title =. 1999 , volume =

1999
[71]

2005 , publisher=

An Introduction to Stein's Method , author=. 2005 , publisher=

2005
[72]

Barroso, L.A. and H. The datacenter as a computer: An introduction to the design of warehouse-scale machines , journal = slca, year =
[73]

Journal of statistical physics , year =

Baccelli, F and Karpelevich, FI and Kelbert, M Ya and Puhalskii, AA and Rybko, AN and Suhov, Yu M , title =. Journal of statistical physics , year =
[74]

New York Times , year =

Barbaro, Michael and Zeller, Tom , title =. New York Times , year =
[75]

2015 , pages =

Bassily, Raef and Smith, Adam , title =. 2015 , pages =

2015
[76]

Bayati and B

M. Bayati and B. Prabhakar and D. Shah and M. Sharma , title =. 2007 , address =

2007
[77]

Bayati and D

M. Bayati and D. Shah and M. Sharma , title =. 2008 , volume =

2008
[78]

and Buyya, R

Beloglazov, A. and Buyya, R. , title =. 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing , year =

2010
[79]

Benson and A

T. Benson and A. Akella and D. A. Maltz , title =. 10th annual conference on Internet measurement , year =
[80]

Approximating st minimum cuts in

Bencz. Approximating st minimum cuts in. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , year =
[81]

and Peres, Y

Benjamini, I. and Peres, Y. , title =. 1994 , volume =

1994
[82]

1999 , author =

Nonlinear Programming , publisher =. 1999 , author =

1999
[83]

Berry and R

R. Berry and R. G. Gallager , title =. 2002 , volume =

2002
[84]

Tsitsiklis , title =

Dimitris Bertsimas and David Gamarnik and John N. Tsitsiklis , title =
[85]

Bertsimas and I

D. Bertsimas and I. Ch. Paschalidis and J. N. Tsitsiklis , title =. 1989 , volume =

1989
[86]

1989 , author =

Parallel and Distributed Computation: Numerical Methods , publisher =. 1989 , author =

1989
[87]

Bettesh and S

I. Bettesh and S. Shamai , title =. 2006 , volume =

2006
[88]

2012 , pages =

Bhaskara, Aditya and Dadush, Daniel and Krishnaswamy, Ravishankar and Talwar, Kunal , title =. 2012 , pages =

2012
[89]

and Kempe, D

Bharathi, S. and Kempe, D. and Salek, M. , title =. Internet and Network Economics , pages =
[90]

Bhatia and M

R. Bhatia and M. Kodialam , title =
[91]

1992 , volume =

Bikhchandani, Sushil and Hirshleifer, David and Welch, Ivo , title =. 1992 , volume =

1992
[92]

Philadelphia: SIAM , year =

Billingsley, Patrick , title =. Philadelphia: SIAM , year =
[93]

2012 , volume =

Birand, Berk and Chudnovsky, Maria and Ries, Bernard and Seymour, Paul and Zussman, Gil and Zwols, Yori , title =. 2012 , volume =

2012
[94]

, title =

Blahut, Richard E. , title =. 1972 , volume =

1972
[95]

PRISM: Privacy-preserving Search in Mapreduce , booktitle = pets, year =

Blass, Erik-Oliver and Di Pietro, Roberto and Molva, Refik and \". PRISM: Privacy-preserving Search in Mapreduce , booktitle = pets, year =
[96]

2012 , pages =

Blocki, Jeremiah and Blum, Avrim and Datta, Anupam and Sheffet, Or , title =. 2012 , pages =

2012
[97]

2005 , pages =

Blum, Avrim and Dwork, Cynthia and McSherry, Frank and Nissim, Kobbi , title =. 2005 , pages =

2005
[98]

2008 , pages =

Blum, Avrim and Ligett, Katrina and Roth, Aaron , title =. 2008 , pages =

2008
[99]

and Kochut, A

Bobroff, N. and Kochut, A. and Beaty, K. , title =. 10th IFIP/IEEE International Symposium on Integrated Network Management , year =
[100]

Bodas and S

S. Bodas and S. Shakkottai and L. Ying and R. Srikant , title =. Proc. SIGMETRICS/Performance , year =
[101]

Bodas and S

S. Bodas and S. Shakkottai and L. Ying and R. Srikant , title =. 2010 , pages =

2010
[102]

Bodas and S

S. Bodas and S. Shakkottai and L. Ying and R. Srikant , title =. 2011 , pages =

2011
[103]

Bodas and S

S. Bodas and S. Shakkottai and L. Ying and R. Srikant , title =
[104]

S. H. Bokhari , title =. 1981 , volume =

1981
[105]

2001 , author =

Random graphs , publisher =. 2001 , author =

2001
[106]

Bonfils and P

B. Bonfils and P. Bonnet , title =. 2003 , pages =

2003
[107]

Bonald and S

T. Bonald and S. Borst and A. Proutiere , title =. 2004 , volume =

2004
[108]

Bonnet and J

P. Bonnet and J. Gehrke and P. Seshadri , title =. 2001 , pages =

2001
[109]

Borst , title =

S. Borst , title =. 2005 , volume =

2005
[110]

Borst , title =

S. Borst , title =. Philosophical Transactions A , year =
[111]

Performance Evaluation , year =

Bortolussi, Luca and Hayden, Richard A , title =. Performance Evaluation , year =
[112]

Borst and N

S. Borst and N. Hegde , title =. 2007 , pages =

2007
[113]

Borst and M

S. Borst and M. Jonckheere , title =. 2006 , volume =

2006
[114]

Networks and Heterogeneous Media (NHM) , year =

Charles Bordenave and David Mcdonald and Alexandre Proutiere , title =. Networks and Heterogeneous Media (NHM) , year =
[115]

2004 , author =

Convex Optimization , publisher =. 2004 , author =

2004
[116]

, journal=

Braverman, Anton and Dai, J. , journal=. High order steady-state diffusion approximation of the
[117]

Braverman, Anton and Dai, J. G. Stein's method for steady-state diffusion approximations of M/Ph/n+M systems. Ann. Appl. Probab. 2017. doi:10.1214/16-AAP1211

2017 doi
[118]

A model of public goods:. J. Economic Theory , pages =. 2007 , author =

2007
[119]

Bramson and Y

M. Bramson and Y. Lu and B. Prabhakar , title =. 2012 , volume =

2012
[120]

arXiv preprint arXiv:1512.09364 , year =

Braverman, Anton and Dai, JG and Feng, Jiekun , title =. arXiv preprint arXiv:1512.09364 , year =

arXiv
[121]

Brummitt, Charles D and D’Souza, Raissa M and Leicht, EA , title =. Proc. the National Academy of Sciences , year =
[122]

2008 , pages =

Brzezinski, Andrew and Zussman, Gil and Modiano, Eytan , title =. 2008 , pages =

2008
[123]

and Jain, N

Buchbinder, N. and Jain, N. and Menache, I. , title =. 10th International IFIP TC 6 Networking Conference , year =
[124]

Buche and H

R. Buche and H. J. Kushner , title =. 2004 , volume =

2004
[125]

Buchegger and J.-Y

S. Buchegger and J.-Y. Le Boudec , title =. 2002 , pages =

2002
[126]

, title =

Bu, Yingyi and Howe, Bill and Balazinska, Magdalena and Ernst, Michael D. , title =. 2010 , volume =

2010
[127]

Bui and R

L. Bui and R. Srikant and A. L. Stolyar , title =. the Philosophical Transactions of the Royal Society , year =
[128]

Bui and R

L. Bui and R. Srikant and A. L. Stolyar , title =
[129]

and Srikant, R

Bui, L.X. and Srikant, R. and Stolyar, A. L. , title =. 2011 , volume =

2011
[130]

Nature , year =

Buldyrev, Sergey V and Parshani, Roni and Paul, Gerald and Stanley, H Eugene and Havlin, Shlomo , title =. Nature , year =
[131]

2014 , pages =

Bun, Mark and Ullman, Jonathan and Vadhan, Salil , title =. 2014 , pages =

2014
[132]

, title =

Buracchini, E. , title =. 2000 , volume =

2000
[133]

2013 , pages =

Bu, Xiangping and Rao, Jia and Xu, Cheng-Zhong , title =. 2013 , pages =

2013
[134]

Burgess and B

J. Burgess and B. Gallagher and D. Jense and B. N. Levine , title =. Proc. IEEE INFOCOM , year =
[135]

and Hooke, A

Burleigh, S. and Hooke, A. and Torgerson, L. and Fall, K. and Cerf, V. and Durst, B. and Scott, K. and Weiss, H. , title =. 2003 , volume =

2003
[136]

Butty\'an and J.-P

L. Butty\'an and J.-P. Hubaux , title =. 2003 , volume =

2003
[137]

and Allemang, D

Bylander, T. and Allemang, D. and Tanner, M.C. and Josephson, J.R. , title =. 1991 , volume =

1991
[138]

V. R. Cadambe and S. A. Jafar , title =. 2007 , address =

2007
[139]

Calvo Armengol and M

A. Calvo Armengol and M. O. Jackson , title =. American Economic Review , year =
[140]

D. S. Callaway and M. E. J. Newmann and S. H. Strogatz and D. J.Watts , title =. 2000 , volume =

2000
[141]

E. J. Cand. Exact matrix completion via convex optimization , journal =. 2009 , volume =

2009
[142]

Blume, and D

L. Blume, and D. Easley, and J. Kleinberg, and R. Kleinberg, and E. Tardos, , title =. Proceedings of 52nd IEEE Symposium on Foundations of Computer Science , year =
[143]

and Marziale, L

Case, A. and Marziale, L. and Richard III, G.G. , title =. Digital Investigation , year =
[144]

2013 , volume =

Castet, Jean-Francois and Saleh, Joseph H , title =. 2013 , volume =

2013
[145]

Cecchi, F and Borst, S. C. and van Leeuwaardena, J. S. H. , title =. 2015 , volume =

2015
[146]

arXiv preprint arXiv:1611.09723 , year=

Mean-field limits for large-scale random-access networks , author=. arXiv preprint arXiv:1611.09723 , year=

arXiv
[147]

and Borst, S

Celik, G. and Borst, S. and Whiting, P. and Modiano, E. , title =. 2011 , pages =

2011
[148]

and Le, L.B

Celik, G. and Le, L.B. and Modiano, E. , title =. 2011 , pages =

2011
[149]

and Cuomo, F

Cesana, M. and Cuomo, F. and Ekici, E. , title =. Ad Hoc Networks , year =
[150]

Chandrasekaran and et.al

S. Chandrasekaran and et.al. , title =
[151]

Chandrasekhar, J

V. Chandrasekhar, J. G. Andrews and A. Gatherer , title =. 2012 , volume =

2012
[152]

2010 , pages =

Chatzikokolakis, Konstantinos and Chothia, Tom and Guha, Apratim , title =. 2010 , pages =

2010
[153]

Chang and P

C.-S. Chang and P. Heidelberger and S. Juneja and P. Shahabuddin , title =. Perform. Eval. , year =
[154]

Chaporkar and K

P. Chaporkar and K. Kar and S. Sarkar , title =. 2005 , pages =

2005
[155]

and Kwak, H

Cha, M. and Kwak, H. and Rodriguez, P. and Ahn, Y. Y. and Moon, S. , title =. Proceedings of the 7th ACM SIGCOMM conference on Internet measurement , year =
[156]

2009 , address=

The age of gossip: spatial mean field regime , author=. 2009 , address=

2009
[157]

Chang and Mingyan Liu , title =

Nicholas B. Chang and Mingyan Liu , title =. 2007 , pages =

2007
[158]

and Liu, M

Chang, N.B. and Liu, M. , title =. 2009 , volume =

2009
[159]

2007 , pages =

Chatzikokolakis, Konstantinos and Palamidessi, Catuscia and Panangaden, Prakash , title =. 2007 , pages =

2007
[160]

2009 , pages =

Chaporkar, Prasanna and Proutiere, Alexandre and Asnani, Himanshu and Karandikar, Abhay , title =. 2009 , pages =

2009
[161]

Chang and J

C.-S. Chang and J. A. Thomas , title =. 1999 , volume =

1999
[162]

2012 , pages =

Chen, Yanpei and Alspaugh, Sara and Borthakur, Dhruba and Katz, Randy , title =. 2012 , pages =

2012
[163]

2012 , volume =

Chen, Yanpei and Alspaugh, Sara and Katz, Randy , title =. 2012 , volume =

2012
[164]

2003 , location =

Cherniack, Mitch and Balakrishnan, Hari and Balazinska, Magdalena and Carney, Donald and Cetintemel, Ugur and Xing, Ying and Zdonik, Stanley B , title =. 2003 , location =

2003
[165]

and Berry, R

Chen, J. and Berry, R. and Honig, M. , title =. 2008 , volume =

2008
[166]

and Moran, Tal and Vadhan, Salil , title =

Chen, Yiling and Chong, Stephen and Kash, Ian A. and Moran, Tal and Vadhan, Salil , title =. 2013 , pages =

2013
[167]

and Lakshman, T

Chen, Fangfei and Kodialam, M. and Lakshman, T. V. , title =. 2012 , pages =

2012
[168]

Chen and S

L. Chen and S. H. Low and M. Chiang and J. C. Doyle , title =. 2006 , address =

2006
[169]

Chen and S

L. Chen and S. H. Low and J. C. Doyle , title =. 2005 , address =

2005
[170]

and Zhang, H

Chen, T. and Zhang, H. and Katz, M. , title =. Computer Science Networking and Internet Architecture , year =
[171]

Chen and K

L. Chen and K. Reddy and G. Agrawal , title =. Proc. High Performance Distributed Computing , year =
[172]

2014 , volume =

Chen, Yiling and Sheffet, Or and Vadhan, Salil , title =. 2014 , volume =

2014
[173]

and Wang, Y

Chen, W. and Wang, Y. and Yang, S. , title =. 2009 , pages =

2009
[174]

2001 , author =

Fundamentals of queueing networks , publisher =. 2001 , author =

2001
[175]

2014 , address =

Chen, Zhen and Zhu, Kai and Ying, Lei , title =. 2014 , address =

2014
[176]

2015 , address =

Chen, Zhen and Zhu, Kai and Ying, Lei , title =. 2015 , address =

2015
[177]

Chiang , title =

M. Chiang , title =. IEEE Journal of Selected Areas in Communications , year =
[178]

Chiang , title =

M. Chiang , title =. Foiundations and Trends in Communications and Information Theory , year =
[179]

2008 , author =

Power control in wireless cellular networks , publisher =. 2008 , author =

2008
[180]

Chin, K. W. and Li, S. , title =. Computer Networks , year =
[181]

Chiang and S

M. Chiang and S. H. Low and A. R. Calderbank and J. C. Doyle , title =. Proceedings of the IEEE , year =
[182]

Chiang and C

M. Chiang and C. W. Tan and D. Palomar and D. O'Neill and D. Julian , title =. 2007 , volume =

2007
[183]

2010 , pages =

Chou, Tzu-Han and Draper, Stark C and Sayeed, Akbar M , title =. 2010 , pages =

2010
[184]

Choi and D

S. Choi and D. Gale and S. Kariv , title =. Advances in Applied Microeconomics , year =
[185]

and Akyildiz, I.F

Chowdhury, K.R. and Akyildiz, I.F. , title =. Selected Areas in Communications, IEEE Journal on , year =
[186]

2009 , author =

Connected:. 2009 , author =

2009
[187]

2000 , author =

A Course in Probability Theory , publisher =. 2000 , author =

2000
[188]

2005 , volume =

Clark, David and Hunt, Sebastian and Malacaria, Pasquale , title =. 2005 , volume =

2005
[189]

and Garey, M.R

Coffman Jr, E.G. and Garey, M.R. and Johnson, D.S. , title =. Approximation algorithms for. 1996 , pages =

1996
[190]

Cohen and K

R. Cohen and K. Erez and D. Ben-Avraham and S. Havlin , title =. 2000 , volume =

2000
[191]

Cohen and K

R. Cohen and K. Erez and D. Ben-Avraham and S. Havlin , title =. 2001 , volume =

2001
[192]

Albert, R\'eka and Barab\'asi, Albert-L\'aszl\'o , title =. Rev. Mod. Phys. , year =. doi:10.1103/RevModPhys.74.47 , issue =

doi
[193]

Boccaletti and V

S. Boccaletti and V. Latora and Y. Moreno and M. Chavez and D.-U. Hwang , title =. Physics Reports , year =. doi:10.1016/j.physrep.2005.10.009 , issn =

2005 doi
[194]

SIGCOMM Comput

Zhang, Yin and Roughan, Matthew and Willinger, Walter and Qiu, Lili , title =. SIGCOMM Comput. Commun. Rev. , year =. doi:http://doi.acm.org/10.1145/1594977.1592600 , issn =
[195]

Yvan Lamelas Polo and Ying Wang and Ashish Pandharipande and Geert Leus , title =. Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing , year =
[196]

2006 , author =

Elements of Information Theory , publisher =. 2006 , author =

2006
[197]

1991 , author =

Elements of Information Theory , publisher =. 1991 , author =

1991
[198]

and Bestavros, A

Crovella, M.E. and Bestavros, A. , title =. 1997 , volume =

1997
[199]

Crowcroft and R

J. Crowcroft and R. Gibbens and F. Kelly and S. Ostring , title =. 2003 , address =

2003
[200]

Cruz and A

R. Cruz and A. Santhanam , title =. 2003 , volume =

2003
[201]

Cui and Z

S. Cui and Z. Han and S. Kar and T. Kim and A. Tajer and H. V. Poor , title =. IEEE Signal Processing Magazine , year =
[202]

2013 , pages =

Cui, Ying and Yeh, Edmund M , title =. 2013 , pages =

2013
[203]

2015 , pages =

Cummings, Rachel and Ioannidis, Stratis and Ligett, Katrina , title =. 2015 , pages =

2015
[204]

J. G. Dai , title =. 1995 , volume =

1995
[205]

Operations Research , year =

Dai, Jim and Lin, Wuqin , title =. Operations Research , year =
[206]

Dai and S

J. Dai and S. Meyn , title =. 1995 , volume =

1995
[207]

Dai, J. G. and Prabhakar, B. , title =. 2000 , pages =

2000
[208]

2014 , volume =

Dandekar, Pranav and Fawaz, Nadia and Ioannidis, Stratis , title =. 2014 , volume =

2014
[209]

DatacenterDynamics , note =
[210]

Theory of Cryptography , year =

De, Anindya , title =. Theory of Cryptography , year =
[211]

2008 , volume =

Dean, Jeffrey and Ghemawat, Sanjay , title =. 2008 , volume =

2008
[212]

M. H. DeGroot , title =. J. American Statistical Association , year =
[213]

1993 , author =

Large Deviations Techniques and Applications , publisher =. 1993 , author =

1993
[214]

I. S. Dhillon and Y. Guan and B. Kulis , title =. 2004 , pages =

2004
[215]

S. N. Diggavi and M. Grossglauser and D. Tse. , title =. 2002 , pages =

2002
[216]

E. W. Dijkstra , title =. Numerische Mathematik , year =
[217]

Dimakis and J

A. Dimakis and J. Walrand , title =. 2006 , volume =

2006
[218]

2003 , pages =

Dinur, Irit and Nissim, Kobbi , title =. 2003 , pages =

2003
[219]

Dobra and M

A. Dobra and M. Garofalakis and J. Gehrke and R. Rastogi , title =. 2002 , pages =

2002
[220]

and Richardson, M

Domingos, P. and Richardson, M. , title =. 2001 , pages =

2001
[221]

2013 , pages =

Dong, Wenxiang and Zhang, Wenyi and Tan, Chee Wei , title =. 2013 , pages =

2013
[222]

and Rinne, M

Doppler, K. and Rinne, M. and Wijting, C. and Ribeiro, C. and Hugl, K. , title =. 2009 , volume =

2009
[223]

2010 , address =

Dou, Adam and Kalogeraki, Vana and Gunopulos, Dimitrios and Mielikainen, Taneli and Tuulos, Ville H , title =. 2010 , address =

2010
[224]

and Wu, R

Down, D.G. and Wu, R. , title =. 2006 , volume =

2006
[225]

Draief and A

M. Draief and A. Ganesh and L. Massoulie , title =. 1st international conference on Performance evaluation methodolgies and tools , year =
[226]

2010 , author =

Epidemics and rumours in complex networks , publisher =. 2010 , author =

2010
[227]

2009 , pages =

Draper, Stark C and Sayeed, Akbar M and Chou, Tzu-Han , title =. 2009 , pages =

2009
[228]

, title =

Dubey, P. , title =. Mathematics of Operations Research , year =
[229]

Dubois-Ferriere and M

H. Dubois-Ferriere and M. Grossglauser and M. Vetterli , title =. MobiHoc , year =
[230]

and Jordan, Michael I

Duchi, John C. and Jordan, Michael I. and Wainwright, Martin J. , title =. 2012 , pages =

2012
[231]

and Jordan, Michael I

Duchi, John C. and Jordan, Michael I. and Wainwright, Martin J. , title =. 2013 , pages =

2013
[232]

Privacy against statistical inference , booktitle = allerton, year =

du Pin Calmon,. Privacy against statistical inference , booktitle = allerton, year =
[233]

2007 , author =

Random graph dynamics , publisher =. 2007 , author =

2007
[234]

1998 , author =

Biological Sequence Analysis , publisher =. 1998 , author =

1998
[235]

2006 , pages =

Dwork, Cynthia , title =. 2006 , pages =

2006
[236]

2006 , pages =

Dwork, Cynthia and Kenthapadi, Krishnaram and McSherry, Frank and Mironov, Ilya and Naor, Moni , title =. 2006 , pages =

2006
[237]

2006 , pages =

Dwork, Cynthia and McSherry, Frank and Nissim, Kobbi and Smith, Adam , title =. 2006 , pages =

2006
[238]

and Vadhan, Salil , title =

Dwork, Cynthia and Naor, Moni and Reingold, Omer and Rothblum, Guy N. and Vadhan, Salil , title =. 2009 , pages =

2009
[239]

Dwork, Cynthia and Roth, Aaron , title =. Found. Trends Theor. Comput. Sci. , year =
[240]

and Vadhan, Salil , title =

Dwork, Cynthia and Rothblum, Guy N. and Vadhan, Salil , title =. 2010 , pages =

2010
[241]

R. E. D. Borth and B. Oberlie , title =. Proc. of DySpan , year =
[242]

Eguiluz, V. M. and K. Klemm , title =. 2002 , volume =

2002
[243]

1995 , volume =

Eiter, Thomas and Gottlob, Georg , title =. 1995 , volume =

1995
[244]

2010 , pages =

Ekanayake, Jaliya and Li, Hui and Zhang, Bingjing and Gunarathne, Thilina and Bae, Seung-Hee and Qiu, Judy and Fox, Geoffrey , title =. 2010 , pages =

2010
[245]

Ellison , title =

G. Ellison , title =. Econometrica , year =
[246]

Elwalid and D

A. Elwalid and D. Mitra , title =. 1993 , volume =

1993
[247]

2009 , note =

Enron , title =. 2009 , note =

2009
[248]

and Renyi, A

Erdos, P. and Renyi, A. , title =. Publ. Math. Debrecen , year =
[249]

1960 , author =

On the evolution of random graphs , publisher =. 1960 , author =

1960
[250]

2014 , pages =

Erlingsson,. 2014 , pages =

2014
[251]

Eryilmaz and A

A. Eryilmaz and A. Ozdaglar and E. Modiano , title =
[252]

and Ozdaglar, A

Eryilmaz, A. and Ozdaglar, A. and Shah, D. and Modiano, E. , title =. 2010 , volume =

2010
[253]

Eryilmaz and R

A. Eryilmaz and R. Srikant , title =. 2004 , volume =

2004
[254]

Eryilmaz and R

A. Eryilmaz and R. Srikant , title =
[255]

Eryilmaz and R

A. Eryilmaz and R. Srikant , title =. 2006 , volume =

2006
[256]

2007 , volume =

Eryilmaz, A and Srikant, R , title =. 2007 , volume =

2007
[257]

Eryilmaz and R

A. Eryilmaz and R. Srikant , title =. 2011 , note =

2011
[258]

, title =

Eryilmaz, Atilla and Srikant, R. , title =. 2012 , volume =

2012
[259]

Eryilmaz and R

A. Eryilmaz and R. Srikant and J. R. Perkins , title =. 2005 , volume =

2005
[260]

the heavy traffic asymptotics , author=

Join the shortest queue with many servers. the heavy traffic asymptotics , author=. arXiv preprint arXiv:1502.00999 , year=

arXiv
[261]

Supermarket queueing system in the heavy traffic regime

Eschenfeldt, Patrick and Gamarnik, David , journal=. Supermarket queueing system in the heavy traffic regime
[262]

Yanlin Peng and Linfeng Zhang and Morris Chang and Yong Guan , title =
[263]

Purdue E-Stadium , note =
[264]

, title =

Fall, K. , title =. 2003 , pages =

2003
[265]

and Pihur, Vasyl and Erlingsson,

Fanti, Giulia C. and Pihur, Vasyl and Erlingsson,. Building a. arXiv:1503.01214 [cs.CR] , year =

arXiv
[266]

, author=

Back to the Past: Source Identification in Diffusion Networks from Partially Observed Cascades. , author=
[267]

and Jensen, D

Fast, A. and Jensen, D. and Levine, B.N. , title =. 2005 , pages =

2005
[268]

2002 , month =

FCC , title =. 2002 , month =

2002
[269]

MIT-CSAIL-TR-2014-028, Technical Report , year =

Feizi, Soheil and Duffy, Ken and Kellis, Manolis and Medard, Muriel , title =. MIT-CSAIL-TR-2014-028, Technical Report , year =

2014
[270]

and Cao, J

Feng, W. and Cao, J. and Zhang, C. and Liu, C. , title =. Distributed Computing Systems, 2009. ICDCS'09. 29th IEEE International Conference on , year =

2009
[271]

and Ekici, E

Filippini, I. and Ekici, E. and Cesana, M. , title =. Mobile Adhoc and Sensor Systems, 2009. MASS'09. IEEE 6th International Conference on , year =

2009
[272]

and Lyu,

Fleischer, Lisa K. and Lyu,. Approximately Optimal Auctions for Selling Privacy when Costs Are Correlated with Data , booktitle = ec-old, year =
[273]

G. J. Foschini , title =. 1996 , volume =

1996
[274]

and Zhao, Y

Foster, I. and Zhao, Y. and Raicu, I. and Lu, S. , title =. Grid Computing Environments Workshop, 2008. GCE'08 , year =

2008
[275]

, title =

Fowler, J.H. , title =. Social Networks , year =
[276]

Franceschetti and O

M. Franceschetti and O. Dousse and D. Tse and P. Thiran , title =. 2007 , volume =

2007
[277]

A. M. Frieze and G. R. Grimmett , title =. Discrete Applied Mathematics , year =
[278]

1991 , author =

Game Theory , publisher =. 1991 , author =

1991
[279]

Fu and E

A. Fu and E. Modiano and J. Tsitsiklis , title =
[280]

Dual Query: Practical Private Query Release for High Dimensional Data , booktitle = icml, year =

Marco Gaboardi and Emilio Jes. Dual Query: Practical Private Query Release for High Dimensional Data , booktitle = icml, year =
[281]

1968 , author =

Information Theory and Reliable Communication , publisher =. 1968 , author =

1968
[282]

R. G. Gallager , title =. 1988 , volume =

1988
[283]

1996 , author =

Discrete Stochastic Processes , publisher =. 1996 , author =

1996
[284]

Galeotti and S

A. Galeotti and S. Goyal and M. O. Jackson and F. Vega-Redondo and L. Yariv , title =. 2005 , note =

2005
[285]

Gale and S

D. Gale and S. Kariv , title =. Games and Economic Behavior , year =
[286]

El-Gamal and J

A. El-Gamal and J. Mammen and B. Prabhakar and D. Shah , title =. 2006 , volume =

2006
[287]

El-Gamal and J

A. El-Gamal and J. Mammen and B. Prabhakar and D. Shah , title =. 2004 , pages =

2004
[288]

and Banerjee, S

Ganapathy, H. and Banerjee, S. and Dimitrov, N. and Caramanis, C. , title =. 2009 , pages =

2009
[289]

and Banerjee, S

Ganapathy, H. and Banerjee, S. and Dimitrov, N. and Caramanis, C. , title =. 2010 , note =

2010
[290]

Ganapathy and C

H. Ganapathy and C. Caramanis , title =
[291]

and Caramanis, C

Ganapathy, H. and Caramanis, C. , title =. 2012 , address =

2012
[292]

and Caramanis, C

Ganapathy, H. and Caramanis, C. and Ying, L. , title =. 2010 , pages =

2010
[293]

2011 , pages =

Ganjisaffar, Yasser and Debeauvais, Thomas and Javanmardi, Sara and Caruana, Rich and Lopes, Cristina Videira , title =. 2011 , pages =

2011
[294]

Ganesh and L

A. Ganesh and L. Massoulie and D. Towsley , title =. 2005 , pages =

2005
[295]

Ganti and E

A. Ganti and E. Modiano and J. Tsitsiklis , title =. 2007 , volume =

2007
[296]

2014 , pages =

Gao, Xi Alice and Mao, Andrew and Chen, Yiling and Adams, Ryan Prescott , title =. 2014 , pages =

2014
[297]

MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing , year =

Garetto,, Michele and Giaccone,, Paolo and Leonardi,, Emilio , title =. MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing , year =
[298]

and Giaccone, P

Garetto, M. and Giaccone, P. and Leonardi, E. , title =. 2008 , pages =

2008
[299]

To appear in Operations Research , year=

Redundancy-d: The power of d choices for redundancy , author=. To appear in Operations Research , year=
[300]

1979 , author =

Computers and Intractibility:. 1979 , author =

1979

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.

[1] [1]

2006 , month =

3GPP TR 25.913 , title =. 2006 , month =

2006

[2] [2]

Vannithamby and G

R. Vannithamby and G. Li and H. Yin and and S. Ahmadi , journal =

[3] [3]

Aalto and P

S. Aalto and P. Lassila , title =. Proc. Teletraffic Conference on Managing traffic performance in converged networks , year =

[4] [4]

and Lassila, P

Aalto, S. and Lassila, P. , title =. Next Generation Internet (NGI), 2010 6th EURO-NF Conference on , year =

2010

[5] [5]

D. J. Abadi and Y. Ahmad and M. Balazinska and U. C etintemel and M. Cherniack and J.-H. Hwang and W. Lindner and A. Maskey and A. Rasin and E. Ryvkina and N. Tatbul and Y. Xing and S. B. Zdonik , title =. 2005 , address =

2005

[6] [6]

and Yi Lu and Campbell, R.H

Abad, C.L. and Yi Lu and Campbell, R.H. , title =. 2011 , pages =

2011

[7] [7]

and Cuomo, F

Abbagnale, A. and Cuomo, F. , title =. 2010 , pages =

2010

[8] [8]

2011 , volume =

Abdallah, Yara and Latif, Mohamed Abdel and Youssef, Moustafa and Sultan, Ahmed and El Gamal, Hesham , title =. 2011 , volume =

2011