Pith. sign in

REVIEW 2 major objections 2 minor 300 references

Testing Unate Distributions

T0 review · 2 major / 2 minor · reviewed 2026-07-03 · grok-4.3

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

Pith's one-line read Unate distributions require and suffice with roughly n to the 3/2 samples for uniformity testing.

desk verdict Unate distributions require ilde Theta(n^{3/2}) samples for uniformity testing because a weak orientation learner plus correlation bound beats the naive monotone reduction. read the letter →

arxiv 2607.01573 v1 pith:SKQAQ5MO submitted 2026-07-02 cs.DS cs.CC

Daeho Lee , Shivam Nadimpalli , Mingda Qiao , Ronitt Rubinfeld This is my paper · ORCID
classification cs.DScs.CC
keywords unatedistributionsuniformitytestingmonotonicityconditionalsamplingdistributionhypercube
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 initiates the study of unate distributions over the hypercube by examining uniformity and unateness testing. It proves that uniformity testing requires and is possible with tilde Theta of n to the 3/2 samples, which is higher than the tilde Theta of n for monotone distributions but lower than the quadratic cost of reducing to the monotone case. For testing if a distribution is unate, it provides an algorithm using tilde O of n to the 3/2 conditional samples from subcubes, with a lower bound of tilde Omega of n to the 2/3 for O of 1 dimensional subcubes. The approach uses a subroutine for weakly learning the coordinate orientations and a new correlation bound.

What carries the argument

A subroutine that weakly learns the hidden orientations of a unate distribution together with a new correlation bound for these estimates.

What would settle it

An explicit unate distribution where the orientation estimates do not satisfy the correlation bound, causing the uniformity tester to fail with fewer than n to the 3/2 samples.

Watch

Extended reading notes

Core claim

We show that tilde Theta of n to the 3/2 samples are sufficient and necessary for uniformity testing of unate distributions over plus or minus 1 to the n, in contrast to tilde Theta of n for monotone distributions. We give a tester for unateness of arbitrary distributions that uses tilde O of n to the 3/2 conditional samples in the subcube conditional model, while every tester using O of 1 dimensional subcubes must have tilde Omega of n to the 2/3 complexity.

Load-bearing premise

A subroutine exists that can weakly learn the hidden orientations of a unate distribution and that a new correlation bound holds for the resulting estimates.

Editorial extensions

If this is right

  • Uniformity testing of unate distributions has sample complexity tilde Theta of n to the 3/2.
  • The algorithms significantly outperform the naive approach of reducing to the monotone case which incurs Omega of n squared samples.
  • Unateness testing in the subcube conditional model has complexity tilde O of n to the 3/2 for the upper bound and tilde Omega of n to the 2/3 for constant dimensional subcubes.
  • Monotonicity testing in the same model has complexity tilde Theta of n.

Reading between the lines

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

  • The orientation learning tool may be useful for other testing problems on distributions with signed coordinates.
  • Similar sample complexity gaps might appear when testing other properties that generalize monotonicity.
  • Extending the conditional sampling model to higher dimensions could change the lower bounds for unateness testing.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 2 minor

Summary. The paper initiates the study of unate distributions over {±1}^n and studies two testing problems. For uniformity testing, it claims that ilde{ heta}(n^{3/2}) samples suffice and are necessary, contrasting with ilde{ heta}(n) for monotone distributions. For unateness testing of arbitrary distributions, it gives an ilde{O}(n^{3/2}) tester using conditional samples from subcubes, with an ilde{\Omega}(n^{2/3}) lower bound for O(1)-dimensional subcubes; both results improve on the naive ilde{ heta}(n^2) reduction to the monotone case. The uniformity tester relies on a weak orientation-learning subroutine and a new correlation bound for the estimates.

Significance. If the results hold, the work provides the first sample-complexity characterizations for testing unate distributions, introduces algorithmic tools (weak orientation learning and correlation bounds) that may apply more broadly to monotonicity and unateness questions, and demonstrates that unateness can be tested more efficiently than a direct reduction to monotonicity would suggest.

major comments (2)
  1. [Abstract] Abstract: the claimed ilde{ heta}(n^{3/2}) upper and lower bounds for uniformity testing rest entirely on the correctness of the weak orientation-learning subroutine and the new correlation bound for the resulting estimates; if either tool fails to achieve the stated parameters, the sample complexity reverts to the ilde{ heta}(n^2) monotone reduction, making these two components load-bearing for the central claim.
  2. [Abstract] Abstract: the lower bound of ilde{ heta}(n^{3/2}) for uniformity testing is asserted without any indication of the hard distribution family or reduction technique used; the manuscript must supply the explicit construction and analysis to support necessity, as the abstract alone provides no evidence that the bound is tight rather than an artifact of the upper-bound technique.
minor comments (2)
  1. The notation ilde{ heta} and ilde{O} should be defined explicitly at first use, including the precise polylog factors hidden by the tilde.
  2. The abstract refers to 'the subcube conditional model' without a brief definition or pointer to the model section; a one-sentence clarification would improve readability for readers outside distribution testing.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address each major comment below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the claimed ilde{ heta}(n^{3/2}) upper and lower bounds for uniformity testing rest entirely on the correctness of the weak orientation-learning subroutine and the new correlation bound for the resulting estimates; if either tool fails to achieve the stated parameters, the sample complexity reverts to the ilde{ heta}(n^2) monotone reduction, making these two components load-bearing for the central claim.

    Authors: We agree these components are load-bearing for the improved bound, as already noted in the abstract. The manuscript contains complete proofs that the weak orientation-learning subroutine (Section 3) and correlation bound (Section 4) achieve the required parameters, so the complexity does not revert to the monotone reduction. No revision is required. revision: no

  2. Referee: [Abstract] Abstract: the lower bound of ilde{ heta}(n^{3/2}) for uniformity testing is asserted without any indication of the hard distribution family or reduction technique used; the manuscript must supply the explicit construction and analysis to support necessity, as the abstract alone provides no evidence that the bound is tight rather than an artifact of the upper-bound technique.

    Authors: The explicit hard distribution family and reduction are supplied and analyzed in Section 5. To improve clarity, we will revise the abstract to briefly indicate the reduction technique underlying the lower bound. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected; derivation relies on new subroutines.

full rationale

The paper introduces a new weak orientation-learning subroutine and correlation bound as part of its uniformity tester for unate distributions, explicitly stating these tools are of independent interest. These are not reductions of prior results by self-citation or definition; the θ̃(n^{3/2}) bound is presented as following from combining these new elements, outperforming the naive Ω(n^{2}) reduction to monotone testing. Citations to prior monotone work (e.g., Rubinfeld-Servedio) are external and non-load-bearing for the unate claims. No self-definitional equations, fitted predictions, or ansatz smuggling appear in the abstract or described chain. The result is self-contained against external benchmarks with independent algorithmic content.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claims rest on standard assumptions from theoretical computer science and probability theory with no free parameters, ad-hoc axioms, or invented entities visible in the abstract.

assumptions (1)
  • standard math Standard concentration inequalities and Chernoff-type bounds apply to samples drawn from distributions over {±1}^n
    Implicitly used to derive sample-complexity upper and lower bounds for testing algorithms.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Testing Unate Distributions." pith.science (2026). https://pith.science/paper/SKQAQ5MO

@misc{pith2026260701573,
  author       = {Pith},
  title        = {Pith review of: Testing Unate Distributions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/SKQAQ5MO}},
  note         = {Machine review of arXiv:2607.01573}
}
abstract

We initiate the study of *unate distributions* over $\{\pm1\}^n$ -- a natural analogue of unate Boolean functions -- by considering two basic testing problems that parallel well-studied questions for monotone distributions: - Uniformity Testing of Unate Distributions: We show that $\widetilde{\Theta}(n^{3/2})$ samples are sufficient and necessary, in contrast to the $\widetilde{\Theta}(n)$ sample complexity of the analogous problem for monotone distributions (Rubinfeld and Servedio, STOC 2005; Adamaszek, Czumaj, and Sohler, SODA 2010). - Unateness Testing of Arbitrary Distributions: We give a tester that uses $\widetilde{O}(n^{3/2})$ conditional samples in the subcube conditional model. On the other hand, every tester that draws conditional samples in a similar fashion, namely from $O(1)$-dimensional subcubes, must have an $\widetilde{\Omega}(n^{2/3})$ complexity. In the same model, the complexity of monotonicity testing was recently shown to be $\widetilde{\Theta}(n)$ (Chakrabarty et al., STOC 2025). Our algorithms for both problems significantly outperform the naive approach of reducing to the monotone case, which would incur $\Omega(n^2)$ sample complexity. Our uniformity tester relies on a subroutine that "weakly" learns the hidden orientations of a unate distribution, together with a new correlation bound for these estimates. Both tools may be of independent interest in studying monotonicity and unateness over $\{\pm1\}^n$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 300 canonical work pages

  1. [1]

    USENIX Security Symposium , year =

    Dahlia Malkhi and Noam Nisan and Benny Pinkas and Yaron Sella , title =. USENIX Security Symposium , year =

    work page

  2. [2]

    Answer to ``

    Sasha , month =. Answer to ``. 2011 , note =

    work page 2011

  3. [3]

    Gaussian Measures of Dilatations of Convex Symmetric Sets , author =

    work page

  4. [4]

    2004 , publisher=

    Order statistics , author=. 2004 , publisher=

    work page 2004

  5. [5]

    2019 , publisher=

    High-dimensional statistics: A non-asymptotic viewpoint , author=. 2019 , publisher=

    work page 2019

  6. [6]

    Milman, Vitali D , journal=

    work page

  7. [7]

    Information and Inference: A Journal of the IMA , volume=

    Isometric sketching of any set via the restricted isometry property , author=. Information and Inference: A Journal of the IMA , volume=. 2018 , publisher=

    work page 2018

  8. [8]

    Boolean function monotonicity testing requires (almost) n^

    Chen, Mark and Chen, Xi and Cui, Hao and Pires, William and Stockwell, Jonah , eprinttype=. Boolean function monotonicity testing requires (almost) n^. 2511.04558 , year=

    work page arXiv

Show all 300 references
  1. [9]

    Regularly random duality , author=

  2. [10]

    and Waingarten, Erik , eprinttype=

    Chen, Xi and De, Anindya and Nadimpalli, Shivam and Servedio, Rocco A. and Waingarten, Erik , eprinttype=. 2410.17958 , year=

  3. [11]

    Giessing , title =

    A. Giessing , title =. 2024 , note =

    2024

  4. [12]

    Servedio , title =

    Anindya De and Shivam Nadimpalli and Rocco A. Servedio , title =. 2024 , booktitle =

    2024

  5. [13]

    1011.6326 , year=

    New null space results and recovery thresholds for matrix rank minimization , author=. 1011.6326 , year=

    arXiv

  6. [14]

    IEEE Transactions on Information Theory , volume=

    Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach , author=. IEEE Transactions on Information Theory , volume=. 2012 , publisher=

    2012

  7. [15]

    0907.3666 , year=

    Various thresholds for _1 -optimization in compressed sensing , author=. 0907.3666 , year=

    arXiv

  8. [16]

    1988 , organization=

    Gordon, Yehoram , booktitle=. 1988 , organization=

    1988

  9. [17]

    Acta Mathematica , number =

    Michel Talagrand , title =. Acta Mathematica , number =

  10. [18]

    2022 , publisher=

    Upper and lower bounds for stochastic processes: decomposition theorems , author=. 2022 , publisher=

    2022

  11. [19]

    2021 , publisher=

    Asymptotic geometric analysis, Part II , author=. 2021 , publisher=

    2021

  12. [20]

    Theory of Computing , volume =

    Jain, Rahul and Zhang, Shengyu , title =. Theory of Computing , volume =. 2011 , pages =. doi:10.4086/toc.2011.v007a010 , publisher =

    2011 doi

  13. [21]

    Archiv der Mathematik , volume=

    A note on the measurability of convex sets , author=. Archiv der Mathematik , volume=. 1986 , publisher=

    1986

  14. [22]

    PROCEEDINGS-AMERICAN MATHEMATICAL SOCIETY , volume=

    Some comparisons for Gaussian processes , author=. PROCEEDINGS-AMERICAN MATHEMATICAL SOCIETY , volume=. 2000 , publisher=

    2000

  15. [23]

    arXiv preprint math/0510424 , year=

    An error bound in the Sudakov-Fernique inequality , author=. arXiv preprint math/0510424 , year=

    arXiv

  16. [24]

    2012 , publisher=

    Sums of independent random variables , author=. 2012 , publisher=

    2012

  17. [25]

    European Congress of Mathematics: Budapest, July 22--26, 1996 Volume II , pages=

    Surprising geometric phenomena in high-dimensional convexity theory , author=. European Congress of Mathematics: Budapest, July 22--26, 1996 Volume II , pages=. 1998 , organization=

    1996

  18. [26]

    Franklin , title =

    Payman Mohassel and Matthew K. Franklin , title =. Public Key Cryptography , year =

  19. [27]

    Notes on Gaussian processes and majorizing measures , author=

  20. [28]

    Lecture Notes (Princeton University) , year=

    Probability in high dimension , author=. Lecture Notes (Princeton University) , year=

  21. [29]

    Journal of the ACM (JACM) , volume=

    Decision list compression by mild random restrictions , author=. Journal of the ACM (JACM) , volume=. 2021 , publisher=

    2021

  22. [30]

    Artstein-Avidan and A

    S. Artstein-Avidan and A. Giannopoulos and V.D. Milman , title =

  23. [31]

    2018 , publisher=

    High-Dimensional Probability: An Introduction with Applications in Data Science , author=. 2018 , publisher=

    2018

  24. [32]

    Journal of Soviet Mathematics , volume=

    Extremal properties of half-spaces for spherically invariant measures , author=. Journal of Soviet Mathematics , volume=. 1978 , publisher=

    1978

  25. [33]

    Inventiones mathematicae , volume=

    The brunn-minkowski inequality in gauss space , author=. Inventiones mathematicae , volume=. 1975 , publisher=

    1975

  26. [34]

    The bit extraction problem and t -resilient functions , author=

  27. [35]

    Emanuele Viola , title =

  28. [36]

    Flavors of geometry , volume=

    An elementary introduction to modern convex geometry , author=. Flavors of geometry , volume=

  29. [37]

    Symposium on Theory of Computing (STOC) , pages=

    Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning , author=. Symposium on Theory of Computing (STOC) , pages=

  30. [38]

    International Colloquium on Automata, Languages, and Programming , pages=

    Approximation by DNF: examples and counterexamples , author=. International Colloquium on Automata, Languages, and Programming , pages=. 2007 , organization=

    2007

  31. [39]

    Studia Mathematica , volume=

    Approximation of the Euclidean ball by polytopes , author=. Studia Mathematica , volume=

  32. [40]

    2015 , publisher=

    Chernozhukov, Victor and Chetverikov, Denis and Kato, Kengo , journal=. 2015 , publisher=

    2015

  33. [41]

    Anti-concentration and honest, adaptive confidence bands , urldate =

    Victor Chernozhukov and Denis Chetverikov and Kengo Kato , journal =. Anti-concentration and honest, adaptive confidence bands , urldate =

  34. [42]

    STACS , year =

    Hans-Ulrich Simon , title =. STACS , year =

  35. [43]

    and Nikolova, E

    Kelner, J. and Nikolova, E. , title =. Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science , year =

  36. [44]

    On probabilistic constrained programming , author=

  37. [45]

    2020 , booktitle =

    Hedging in Games: Faster Convergence of External and Swap Regrets , author =. 2020 , booktitle =

    2020

  38. [46]

    Proceedings of the 1st ACM conference on Advances in Financial Technologies , year =

    Xi Chen and Christos Papadimitriou and Tim Roughgarden , title =. Proceedings of the 1st ACM conference on Advances in Financial Technologies , year =

  39. [47]

    Proceedings of the 32th Annual ACM-SIAM Symposium on Discrete Algorithms , year =

    Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning , author =. Proceedings of the 32th Annual ACM-SIAM Symposium on Discrete Algorithms , year =

  40. [48]

    Proceedings of the 52th ACM Symposium on Theory of Computing , year =

    Xi Chen and Chenghao Guo and Emmanouil-Vasileios Vlatakis-Gkaragkounis and Mihalis Yannakakis and Xinzhi Zhang , title =. Proceedings of the 52th ACM Symposium on Theory of Computing , year =

  41. [49]

    Proceedings of the 31th Annual ACM-SIAM Symposium on Discrete Algorithms , year =

    Xi Chen and Amit Levi and Erik Waingarten , title =. Proceedings of the 31th Annual ACM-SIAM Symposium on Discrete Algorithms , year =

  42. [50]

    Proceedings of the 51th ACM Symposium on Theory of Computing , year =

    Xi Chen and Erik Waingarten , title =. Proceedings of the 51th ACM Symposium on Theory of Computing , year =

  43. [51]

    and Napel, S

    Kurz, S. and Napel, S. Heuristic and exact solutions to the inverse power index problem for small voting bodies. Annals of Operations Research. 2014

    2014

  44. [52]

    and Packel, E

    Deegan, J. and Packel, E. W. A new index of power for simple n-person games. International Journal of Game Theory. 1978

    1978

  45. [53]

    and Rosenschein, J

    Bachrach, Y. and Rosenschein, J. , title =. Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems , series =. 2007 , isbn =

    2007

  46. [54]

    Harsanyi , journal =

    John C. Harsanyi , journal =. A Simplified Bargaining Model for the n-Person Cooperative Game , volume =

  47. [55]

    1979 , institution=

    Subjectivity in the valuation of games , author=. 1979 , institution=

    1979

  48. [56]

    1981 , publisher=

    Value theory without efficiency , author=. 1981 , publisher=

    1981

  49. [57]

    Deng and C

    X. Deng and C. Papadimitriou , journal =. On the Complexity of Cooperative Solution Concepts , volume =

  50. [58]

    , editor=

    Shapley, Lloyd S. , editor=. A value for n-person games , booktitle=. 1988 , pages=

    1988

  51. [59]

    and Vizv \'a ri, B

    Pr \'e kopa, A. and Vizv \'a ri, B. and Badics, T. Programming Under Probabilistic Constraint with Discrete Random Variable. New Trends in Mathematical Programming: Homage to Steven Vajda. 1998

    1998

  52. [60]

    A sample approximation approach for optimization with probabilistic constraints , author=

  53. [61]

    SIAM Journal on Optimization , volume=

    Convex approximations of chance constrained programs , author=. SIAM Journal on Optimization , volume=. 2006 , publisher=

    2006

  54. [62]

    J. M. Robson , title =. Information Processing Letters , volume =

  55. [63]

    and Pr \'e kopa, A

    Dentcheva, D. and Pr \'e kopa, A. and Ruszczynski, A. Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming. 2000

    2000

  56. [64]

    Relaxations for probabilistically constrained programs with discrete random variables

    Suvrajeet Sen. Relaxations for probabilistically constrained programs with discrete random variables. Operations Research Letters. 1992

    1992

  57. [65]

    Bounds for probabilistic integer programming problems , author=

  58. [66]

    2005 , printoutnum =

    Scott Aaronson , title =. 2005 , printoutnum =

    2005

  59. [67]

    Gordon , title =

    Mart??n Abadi and Andrew D. Gordon , title =. 1999 , volume =

    1999

  60. [68]

    2002 , printoutnum =

    Manindra Agrawal and Neeraj Kayal and Nitin Saxena , title =. 2002 , printoutnum =

    2002

  61. [69]

    Aho and David S

    Alfred V. Aho and David S. Johnson and Richard M. Karp and S. Rao Kosaraju and Catherine C. McGeoch and Christos H. Papadimitriou and Pavel Pevzner , title =. 1996 , owner =

    1996

  62. [70]

    Statistical Zero-Knowledge Languages can be Recognized in Two Rounds , journal = jcss, year =

    William Aiello and Johan H. Statistical Zero-Knowledge Languages can be Recognized in Two Rounds , journal = jcss, year =

  63. [71]

    Relativized perfect zero knowledge is not

    William Aiello and Johan H. Relativized perfect zero knowledge is not. 1991 , volume =

    1991

  64. [72]

    1987 , pages =

    Mikl??s Ajtai and J??nos Koml??s and Endre Szemer??di , title =. 1987 , pages =

    1987

  65. [73]

    2003 , pages =

    Adi Akavia and Shafi Goldwasser and Samuel Safra , title =. 2003 , pages =

    2003

  66. [74]

    Alekhnovich and M

    M. Alekhnovich and M. Braverman and V. Feldman and A. Klivans and T. Pitassi , title =. Proceedings of the 45th IEEE Symposium on Foundations of Computer Science , year =

  67. [75]

    2004 , number =

    Eric Allender and Samir Datta and Sambuddha Roy , title =. 2004 , number =

    2004

  68. [76]

    Andreev and Andrea E

    Alexander E. Andreev and Andrea E. F. Clementi and Jos?? D. P. Rolim , title =. 1998 , volume =

    1998

  69. [77]

    1995 , volume =

    Dana Angluin and Michael Kharitonov , title =. 1995 , volume =

    1995

  70. [78]

    Klebanov, L. B. and Mkrtchyan, S. T. Estimation of the closeness of distributions in terms of identical moments. Journal of Soviet Mathematics. 1986

    1986

  71. [79]

    1988 , volume =

    Dana Angluin and Philip Laird , title =. 1988 , volume =

    1988

  72. [80]

    Anthony and G

    M. Anthony and G. Brightwell and J. Shawe-Taylor , title =. Discrete Applied Math. , year =

  73. [81]

    Proof of

    Har-Peled, Sariel and Jones, Mitchell , eprinttype=. Proof of. 1912.01977 , year=

    1912

  74. [82]

    De and I

    A. De and I. Diakonikolas and R. Servedio , title =. 2012 , pages =

    2012

  75. [83]

    21st Annual Conference on Learning Theory -

    Kamalika Chaudhuri and Satish Rao , title =. 21st Annual Conference on Learning Theory -

  76. [84]

    Probability: Theory and Examples , publisher=

    Durrett, Rick , year=. Probability: Theory and Examples , publisher=

  77. [85]

    and Massart, P

    Laurent, B. and Massart, P. Adaptive estimation of a quadratic functional by model selection. Ann. Statist. 2000. doi:10.1214/aos/1015957395

    2000 doi

  78. [86]

    Wainwright , title =

    M. Wainwright , title =. 2015 , url =

    2015

  79. [87]

    Sebastian Roch , title =

  80. [88]

    Proceedings of The 27th Conference on Learning Theory,

    Prateek Jain and Sewoong Oh , title =. Proceedings of The 27th Conference on Learning Theory,

  81. [89]

    De and I

    A. De and I. Diakonikolas and R. Servedio , title =. 2013 , pages =

    2013

  82. [90]

    Daskalakis and A

    C. Daskalakis and A. De and I. Diakonikolas and A. Moitra and R. A. Servedio , title =. 2014 , pages =

    2014

  83. [91]

    Cherniavsky and R

    J. Cherniavsky and R. Statman , title =. Proceedings of the 2nd Workshop on Software Testing , year =

  84. [92]

    2004 , pages =

    Benny Applebaum and Yuval Ishai and Eyal Kushilevitz , title =. 2004 , pages =

    2004

  85. [93]

    Bogdanov and E

    A. Bogdanov and E. Viola , title =

  86. [94]

    1998 , volume =

    Sanjeev Arora , title =. 1998 , volume =

    1998

  87. [95]

    Kakade , title =

    Qingqing Huang and Sham M. Kakade , title =. Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada , pages =

    2015

  88. [96]

    Blum and L

    A. Blum and L. Hellerstein and N. Littlestone. Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes. Journal of Computer and System Sciences. 1995

    1995

  89. [97]

    E. J. Candes and C. Fernandes-Granda , title =. 2014 , volume =

    2014

  90. [98]

    Donoho , title =

    D. Donoho , title =. 1990 , volume =

    1990

  91. [99]

    Huang and S

    Q. Huang and S. Kakade , title =. Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada , pages =

    2015

  92. [100]

    Moitra , title =

    A. Moitra , title =. Proceedings of the Forty-Seventh Annual

  93. [101]

    Viola , title =

    E. Viola , title =. Computational Complexity , volume =

  94. [102]

    Lovett , title =

    S. Lovett , title =. Proceedings of the 40th Annual

  95. [103]

    1998 , pages =

    Sanjeev Arora , title =. 1998 , pages =

    1998

  96. [104]

    Daniely , title =

    A. Daniely , title =. Proceedings of the 48th Annual

  97. [105]

    1998 , volume =

    Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy , title =. 1998 , volume =

    1998

  98. [106]

    1998 , volume =

    Sanjeev Arora and Shmuel Safra , title =. 1998 , volume =

    1998

  99. [107]

    2002 , volume =

    Vikraman Arvind and Johannes K??bler , title =. 2002 , volume =

    2002

  100. [108]

    Kurur , title =

    Vikraman Arvind and Piyush P. Kurur , title =. 2002 , pages =

    2002

  101. [109]

    Feldman , title =

    V. Feldman , title =

  102. [110]

    2004 , number =

    Vikraman Arvind and Jacobo Tor??n , title =. 2004 , number =

    2004

  103. [111]

    2000 , editor =

    Giuseppe Ateniese and Jan Camenisch and Marc Joye and Gene Tsudik , title =. 2000 , editor =

    2000

  104. [112]

    2010 , publisher=

    Goyal, Vineet and Ravi, R , journal=. 2010 , publisher=

    2010

  105. [113]

    Warmuth , title =

    Peter Auer and Manfred K. Warmuth , title =. 1998 , volume =

    1998

  106. [114]

    Rabin , title =

    Yonatan Aumann and Michael O. Rabin , title =. 1999 , editor =

    1999

  107. [115]

    421--429 , publisher = acm, printoutnum =

    L??szl?? Babai , title =. 421--429 , publisher = acm, printoutnum =

  108. [116]

    1991 , volume =

    L??szl?? Babai and Lance Fortnow and Carsten Lund , title =. 1991 , volume =

    1991

  109. [117]

    Impagliazzo and R

    R. Impagliazzo and R. Meka and D. Zuckerman , title =

  110. [118]

    Management science , volume=

    Chance-constrained programming , author=. Management science , volume=

  111. [119]

    Chance constrained programming with joint constraints , author=

  112. [120]

    Steinke and S

    T. Steinke and S. Vadhan and A. Wan , title =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,

  113. [121]

    2018 , url =

    Tomasz Tkocz , title =. 2018 , url =

    2018

  114. [122]

    Reingold and T

    O. Reingold and T. Steinke and S. Vadhan , title =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop,

  115. [123]

    P. M. Long and R. A. Servedio , title =. 2013 , pages =

    2013

  116. [124]

    Rabin and Salil P

    Silvio Micali and Michael O. Rabin and Salil P. Vadhan , title =. 1999 , pages =

    1999

  117. [125]

    1993 , volume =

    L??szl?? Babai and Lance Fortnow and Noam Nisan and Avi Wigderson , title =. 1993 , volume =

    1993

  118. [126]

    Balbach , title =

    F. Balbach , title =. Proc. 18th Annual COLT , year =

  119. [127]

    Watson , title =

    T. Watson , title =. Computational Complexity , volume =

  120. [128]

    De and P

    A. De and P. P. Kurur and C. Saha and R. Saptharishi , title =. 2013 , note =

    2013

  121. [129]

    2001 , editor =

    Boaz Barak and Oded Goldreich and Rusell Impagliazzo and Steven Rudich and Amit Sahai and Salil Vadhan and Ke Yang , title =. 2001 , editor =

    2001

  122. [130]

    De and L

    A. De and L. Trevisan , title =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop,

  123. [131]

    De and T

    A. De and T. Watson , title =. 2012 , note =

    2012

  124. [132]

    Foundations of Computer Science, 1991

    How to pack better than best fit: tight bounds for average-case online bin packing , author=. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on , pages=

    1991

  125. [133]

    Combinatorica , volume=

    Bin packing can be solved within 1+ in linear time , author=. Combinatorica , volume=. 1981 , publisher=

    1981

  126. [134]

    Gupta and A

    V. Gupta and A. Radovanovic , title =. Proceedings of the 2015

    2015

  127. [135]

    and Mitzenmacher, M

    Albers, S. and Mitzenmacher, M. , title =

  128. [136]

    2004 , publisher=

    On multidimensional packing problems , author=. 2004 , publisher=

    2004

  129. [137]

    Combinatorica , volume=

    The average-case analysis of some on-line algorithms for bin packing , author=. Combinatorica , volume=. 1986 , publisher=

    1986

  130. [138]

    De and C

    A. De and C. Portmann and T. Vidick and R. Renner , title =. 2012 , note =

    2012

  131. [139]

    De and E

    A. De and E. Mossel and J. Neeman , title =

  132. [140]

    2004 , pages =

    Boaz Barak and Russell Impagliazzo and Avi Wigderson , title =. 2004 , pages =

    2004

  133. [141]

    Vadhan , title =

    Boaz Barak and Shien Jin Ong and Salil P. Vadhan , title =. 2003 , editor =

    2003

  134. [142]

    Bartlett , title =

    Peter L. Bartlett , title =. 1992 , pages =

    1992

  135. [143]

    Smith and Patrick White , title =

    Tugkan Batu and Lance Fortnow and Ronitt Rubinfeld and Warren D. Smith and Patrick White , title =. 2000 , pages =

    2000

  136. [144]

    1994 , printoutnum =

    Paul Beame , title =. 1994 , printoutnum =

    1994

  137. [145]

    Ryan O'Donnell , title =

  138. [146]

    Joe Neeman , title =

  139. [147]

    Structure in Complexity Theory Conference 1993 , year =

    Richard Beigel , title =. Structure in Complexity Theory Conference 1993 , year =

    1993

  140. [148]

    2000 , editor =

    Mihir Bellare and Alexandra Boldyreva and Silvio Micali , title =. 2000 , editor =

    2000

  141. [149]

    1996 , pages =

    Mihir Bellare and Ran Canetti and Hugo Krawczyk , title =. 1996 , pages =

    1996

  142. [150]

    Chen and A

    X. Chen and A. De and R. Servedio and L. Proceedings of the Forty-Seventh Annual

  143. [151]

    De and L

    A. De and L. Trevisan and M. Tulsiani , title =. Advances in Cryptology -

  144. [152]

    1998 , volume =

    Mihir Bellare and Oded Goldreich and Madhu Sudan , title =. 1998 , volume =

    1998

  145. [153]

    De and I

    A. De and I. Diakonikolas and R. Servedio , title =. 2016 , volume =

    2016

  146. [154]

    1993 , pages =

    Mihir Bellare and Phillip Rogaway , title =. 1993 , pages =

    1993

  147. [155]

    1992 , volume =

    Shai Ben-David and Benny Chor and Oded Goldreich , title =. 1992 , volume =

    1992

  148. [156]

    2003 , volume =

    Michael Ben-Or and Danny Gutfreund , title =. 2003 , volume =

    2003

  149. [157]

    2004 , number =

    Eli Ben-Sasson and Madhu Sudan , title =. 2004 , number =

    2004

  150. [158]

    Erd\"os , title=

    P. Erd\"os , title=. Annales Universitatis Scientiarum Budapest , year=

  151. [159]

    Alon and P

    N. Alon and P. Frankl and H. Huang and V. R\"odl and A. Rucinski and B. Sudakov , title =. Journal of Combinatorial Theory, Series A , year =

  152. [160]

    Wigderson and A

    A. Wigderson and A. Yehudayoff , title =. Machine Learning , volume =

  153. [161]

    Dvir and A

    Z. Dvir and A. Rao and A. Wigderson and A. Yehudayoff , title =

  154. [162]

    Lovett and J

    S. Lovett and J. Zhang , title =. Proceedings of the Forty-Seventh Annual

  155. [163]

    Bennett and John Gill , title =

    Charles H. Bennett and John Gill , title =. 1981 , volume =

    1981

  156. [164]

    Kelly, F. P. Effective bandwidths at multi-class queues. Queueing Systems. 1991

    1991

  157. [165]

    Weber , journal =

    R. Weber , journal =. Scheduling Jobs with Stochastic Processing Requirements on Parallel Machines to Minimize Makespan or Flowtime , volume =

  158. [166]

    Resource allocation for broadband networks , author=

  159. [167]

    and Downey, P

    Bruno, J. and Downey, P. and Frederickson, G. N. , title =. 1981 , pages =

    1981

  160. [168]

    2011 , organization=

    Consolidating virtual machines with dynamic bandwidth demand in data centers , author=. 2011 , organization=

    2011

  161. [169]

    2011 , organization=

    Effective VM sizing in virtualized data centers , author=. 2011 , organization=

    2011

  162. [170]

    Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds , author=

  163. [171]

    1704.03892 , year=

    Approximating the Largest Root and Applications to Interlacing Families , author=. 1704.03892 , year=

    arXiv

  164. [172]

    Saks and Sijian Tang , editor =

    Anindya De and Michael E. Saks and Sijian Tang , editor =. Noisy Population Recovery in Polynomial Time , booktitle =

  165. [173]

    Networks , year =

    Dimitris Bertsimas and Chung-Piaw Teo and Rakesh Vohra , title =. Networks , year =

  166. [174]

    A. R. Klivans and P. Kothari , title =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,

  167. [175]

    Bioch and Toshihide Ibaraki , title =

    Jan C. Bioch and Toshihide Ibaraki , title =. 1995 , volume =

    1995

  168. [176]

    Feldman and R

    J. Feldman and R. O'Donnell and R. A. Servedio , title =

  169. [177]

    Steif and Benny Sudakov , title =

    Elchanan Mossel and Ryan O'Donnell and Oded Regev and Jeffrey E. Steif and Benny Sudakov , title =. 2006 , volume =

    2006

  170. [178]

    Batu and L

    T. Batu and L. Fortnow and R. Rubinfeld and W. D. Smith and P. White , title =. J

  171. [179]

    Blackburn and Steven D

    Simon R. Blackburn and Steven D. Galbraith . ASIACRYPT 1999 , title =. 1999 , editor =

    1999

  172. [180]

    1998 , editor =

    Matt Blaze and Gerrit Bleumer and Martin Strauss , title =. 1998 , editor =

    1998

  173. [181]

    Online Algorithms: The State of the Art , year =

    Avrim Blum , title =. Online Algorithms: The State of the Art , year =

  174. [182]

    2003 , editor =

    Avrim Blum , title =. 2003 , editor =

    2003

  175. [183]

    1992 , volume =

    Avrim Blum , title =. 1992 , volume =

    1992

  176. [184]

    Lipton , title =

    Avrim Blum and Merrick Furst and Michael Kearns and Richard J. Lipton , title =. 1993 , editor =

    1993

  177. [185]

    Goyal and R

    V. Goyal and R. Ravi , journal =. A \ PTAS\ for the chance-constrained knapsack problem with random item sizes , year =. doi:https://doi.org/10.1016/j.orl.2010.01.003 , url =

    2010 doi

  178. [186]

    Furst and Jeffrey Jackson and Michael J

    Avrim Blum and Merrick L. Furst and Jeffrey Jackson and Michael J. Kearns and Yishay Mansour and Steven Rudich , title =. 1994 , pages =

    1994

  179. [187]

    Blum and A

    A. Blum and A. Kalai and H. Wasserman , title =. Journal of the ACM , year =

  180. [188]

    and Quint, J

    Benoist, Y. and Quint, J. F. Central limit theorem for linear groups. Ann. Probab. 2016. doi:10.1214/15-AOP1002

    2016 doi

  181. [189]

    Furstenberg , title =

    H. Furstenberg , title =. 1963 , pages =

    1963

  182. [190]

    and Kesten, H

    Furstenberg, H. and Kesten, H. Products of Random Matrices. Ann. Math. Statist. 1960. doi:10.1214/aoms/1177705909

    1960 doi

  183. [191]

    1982 , pages =

    Manuel Blum and Silvio Micali , title =. 1982 , pages =

    1982

  184. [192]

    Davenport and P

    H. Davenport and P. Erdos , title =. 1952 , volume =

    1952

  185. [193]

    Warmuth , title =

    Anselm Blumer and Andrzej Ehrenfeucht and David Haussler and Manfred K. Warmuth , title =. 1989 , volume =

    1989

  186. [194]

    1998 , editor =

    Dan Boneh , title =. 1998 , editor =

    1998

  187. [195]

    Dan Boneh and Giovanni Di Crescenzo and Rafail Ostrovsky and Giuseppe Persiano , title =

  188. [196]

    2001 , editor =

    Dan Boneh and Matthew Franklin , title =. 2001 , editor =

    2001

  189. [197]

    S. Ben. J. Comput. Syst. Sci. , volume =

  190. [198]

    Birkendorf and E

    A. Birkendorf and E. Dichterman and J. Jackson and N. Klasner and H. Simon , title =. Machine Learning , volume =

  191. [199]

    2005 , editor =

    Dan Boneh and Eu-Jin Goh and Kobbi Nissim , title =. 2005 , editor =

    2005

  192. [200]

    2001 , editor =

    Dan Boneh and Ben Lynn and Hovav Shacham , title =. 2001 , editor =

    2001

  193. [201]

    Topics in Cryptology ---

    Dan Boneh and Ilya Mironov and Victor Shoup , title =. Topics in Cryptology ---. 2003 , editor =

    2003

  194. [202]

    Topics in Algebraic and Noncommutative Geometry, Contemporary Mathematics Series of American Mathematical Society , year =

    Dan Boneh and Alice Silverberg , title =. Topics in Algebraic and Noncommutative Geometry, Contemporary Mathematics Series of American Mathematical Society , year =

  195. [203]

    Book and Heribert Vollmer and Klaus W

    Ronald V. Book and Heribert Vollmer and Klaus W. Wagner , title =. 2998 , volume =

  196. [204]

    Ben-David and N

    S. Ben-David and N. Eiron and P. Long. On the Difficulty of Approximately Maximizing Agreements. JCSS: Journal of Computer and System Sciences. 2003

    2003

  197. [205]

    2017 , publisher =

    Oded Goldreich , title =. 2017 , publisher =

    2017

  198. [206]

    Felsenthal and M

    D. Felsenthal and M. Machover. The Measurement of Voting Power: Theory and Practice, Problems and Paradoxes. 1998

    1998

  199. [207]

    S. P. Boyd and L. Vandenberghe. Convex Optimization. 2004

    2004

  200. [208]

    O'Donnell

    R. O'Donnell. Analysis of Boolean Functions. 2014

    2014

  201. [209]

    N. H. Bshouty and L. Burroughs. Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning. Machine Learning. 2005

    2005

  202. [210]

    Cl \' e men c on and G

    S. Cl \' e men c on and G. Lugosi and N. Vayatis. Ranking and Scoring Using Empirical Risk Minimization. Proceedings of Conference on Learning Theory (COLT). 2005

    2005

  203. [211]

    Pelckmans and J.A.K

    K. Pelckmans and J.A.K. Suykens and B. De Moor , title =. Proceedings of the 2007 European Symposium on Artificial Neural Networks , year =

    2007

  204. [212]

    2003 , editor =

    Xavier Boyen , title =. 2003 , editor =

    2003

  205. [213]

    1998 , editor =

    Victor Boyko and Marcus Peinado and Ramarathnam Venkatesan , title =. 1998 , editor =

    1998

  206. [214]

    Quantum Computation and Quantum Information: A Millennium Volume , publisher = ams, year =

    Gilles Brassard and Peter H??yer and Michele Mosca and Alain Tapp , title =. Quantum Computation and Quantum Information: A Millennium Volume , publisher = ams, year =

  207. [215]

    Bshouty , title =

    Nader H. Bshouty , title =. 1996 , volume =

    1996

  208. [216]

    Bshouty and Lisa Hellerstein , title =

    Nader H. Bshouty and Lisa Hellerstein , title =. 1998 , volume =

    1998

  209. [217]

    Bshouty and Elchanan Mossel and Ryan O'Donnell and Rocco A

    Nader H. Bshouty and Elchanan Mossel and Ryan O'Donnell and Rocco A. Servedio , title =. 2003 , pages =

    2003

  210. [218]

    Bshouty , title =

    Nader H. Bshouty , title =. 1998 , pages =

    1998

  211. [219]

    1999 , editor =

    Harry Buhrman and Lance Fortnow , title =. 1999 , editor =

    1999

  212. [220]

    Needham : 1-13 , title =

    Michael Burrows and Mart??n Abadi and Roger M. Needham : 1-13 , title =. Proc.\ of the Twelfth ACM Symposium on Operating System Principles , year =

  213. [221]

    2001 , pages =

    Jin-yi Cai , title =. 2001 , pages =

    2001

  214. [222]

    Karloff and Yuval Rabani , title =

    Gruia Calinescu and Howard J. Karloff and Yuval Rabani , title =. 1998 , pages =

    1998

  215. [223]

    2001 , editor =

    Jan Camenisch and Anna Lysyanskaya , title =. 2001 , editor =

    2001

  216. [224]

    Kearns and Yishay Mansour and Dana Ron and Ronitt Rubinfeld and Robert E

    Michael J. Kearns and Yishay Mansour and Dana Ron and Ronitt Rubinfeld and Robert E. Schapire and Linda Sellie , title =. Proceedings of the Twenty-Sixth Annual

  217. [225]

    1997 , editor =

    Jan Camenisch and Markus Stadler , title =. 1997 , editor =

    1997

  218. [226]

    2000 , editor =

    Ran Canetti and Yevgeniy Dodis and Shai Halevi and Eyal Kushilevitz and Amit Sahai , title =. 2000 , editor =

    2000

  219. [227]

    2000 , editor =

    Ran Canetti and Hugo Krawczyk , title =. 2000 , editor =

    2000

  220. [228]

    2001 , editor =

    Ran Canetti and Hugo Krawczyk , title =. 2001 , editor =

    2001

  221. [229]

    Chandra and Dexter Kozen and Larry J

    Ashok K. Chandra and Dexter Kozen and Larry J. Stockmeyer , title =. 1981 , volume =

    1981

  222. [230]

    2001 , editor =

    Jae Choon Cha and Ki Hyoung Ko and Sangjin Lee and Jae Woo Han and Jung Hee Cheon , title =. 2001 , editor =

    2001

  223. [231]

    2003 , editor =

    Jung Hee Cheon and Byungheup Jun , title =. 2003 , editor =

    2003

  224. [232]

    1998 , volume =

    Benny Chor and Madhu Sudan , title =. 1998 , volume =

    1998

  225. [233]

    1989 , pages =

    Aviad Cohen and Avi Wigderson , title =. 1989 , pages =

    1989

  226. [234]

    2002 , editor =

    Jean-S??bastien Coron and Marc Joye and David Naccache and Pascal Paillier , title =. 2002 , editor =

    2002

  227. [235]

    2000 , pages =

    Giovanni Di Crescenzo and Kouichi Sakurai and Moti Yung , title =. 2000 , pages =

    2000

  228. [236]

    Johnson and Claire Kenyon , title =

    J??nos Csirik and David S. Johnson and Claire Kenyon , title =. 2001 , pages =

    2001

  229. [237]

    1995 , editor =

    Ivan Damg\ aa rd and Oded Goldreich and Tatsuaki Okamoto and Avi Wigderson , title =. 1995 , editor =

    1995

  230. [238]

    2003 , pages =

    Ivan Damg\ aa rd and Jens Groth , title =. 2003 , pages =

    2003

  231. [239]

    D\ aa mgard and T

    I. D\ aa mgard and T. Pedersen and B. Pfitzmann. Statistical secrecy and multi-bit commitments. 1996

    1996

  232. [240]

    Decatur and Oded Goldreich and Dana Ron , title =

    Scott E. Decatur and Oded Goldreich and Dana Ron , title =. 1999 , volume =

    1999

  233. [241]

    2003 , note =

    Patrick Dehornoy , title =. 2003 , note =

    2003

  234. [242]

    2000 , author =

    Braids and self-distributivity , publisher =. 2000 , author =

    2000

  235. [243]

    2002 , author =

    Why are braids orderable? , publisher =. 2002 , author =

    2002

  236. [244]

    1976 , volume =

    Whitfield Diffie and Martin E Hellman , title =. 1976 , volume =

    1976

  237. [245]

    Franklin and Jonathan Katz and Atsuko Miyaji and Moti Yung , title =

    Yevgeniy Dodis and Matthew K. Franklin and Jonathan Katz and Atsuko Miyaji and Moti Yung , title =. Topics in Cryptology --. 2003 , editor =

    2003

  238. [246]

    2000 , editor =

    Yevgeniy Dodis and Shai Halevi and Tal Rabin , title =. 2000 , editor =

    2000

  239. [247]

    2004 , pages =

    Yevgeniy Dodis and Shien Jin Ong and Manoj Prabhakaran and Amit Sahai , title =. 2004 , pages =

    2004

  240. [248]

    2002 , pages =

    Yevgeniy Dodis and Joel Spencer , title =. 2002 , pages =

    2002

  241. [249]

    1999 , volume =

    Carlos Domingo and Nina Mishra and Leonard Pitt , title =. 1999 , volume =

    1999

  242. [250]

    Iwan Duursma and Hyang-Sook Lee , title =

  243. [251]

    2004 , series = lncs, pages =

    Cynthia Dwork and Moni Naor and Omer Reingold , title =. 2004 , series = lncs, pages =

    2004

  244. [252]

    Mathematical Programming , year =

    Jack Edmonds , title =. Mathematical Programming , year =

  245. [253]

    1985 , editor =

    Taher ElGamal , title =. 1985 , editor =

    1985

  246. [254]

    1986 , editor =

    Taher ElGamal , title =. 1986 , editor =

    1986

  247. [255]

    Quaderni di Matematica (Complexity of Computations and Proof) , year =

    Lance Fortnow , title =. Quaderni di Matematica (Complexity of Computations and Proof) , year =

  248. [256]

    2001 , pages =

    Lance Fortnow , title =. 2001 , pages =

    2001

  249. [257]

    1994 , number =

    Lance Fortnow , title =. 1994 , number =

    1994

  250. [258]

    1987 , pages =

    Lance Fortnow , title =. 1987 , pages =

    1987

  251. [259]

    Bulletin of the EATCS , year =

    Lance Fortnow and Steve Homer , title =. Bulletin of the EATCS , year =

  252. [260]

    2004 , number =

    Lance Fortnow and Adam Klivans , title =. 2004 , number =

    2004

  253. [261]

    2004 , pages =

    Lance Fortnow and Rahul Santhanam , title =. 2004 , pages =

    2004

  254. [262]

    2005 , publisher = acm, printoutnum =

    Lance Fortnow and Rahul Santhanam and Luca Trevisan , title =. 2005 , publisher = acm, printoutnum =

    2005

  255. [263]

    Spirakis , title =

    Dimitris Fotakis and Paul G. Spirakis , title =. 1998 , number =

    1998

  256. [264]

    Fouque and David Pointcheval , title =

    P. Fouque and David Pointcheval , title =. 2001 , editor =

    2001

  257. [265]

    1995 , editor =

    Yair Frankel and Moti Yung , title =. 1995 , editor =

    1995

  258. [266]

    Fredman and Leonid Khachiyan , title =

    Michael L. Fredman and Leonid Khachiyan , title =. 1996 , volume =

    1996

  259. [267]

    uller and Hans-Georg R\

    Gerhard Frey and Michael M\"uller and Hans-Georg R\"uck , title =. 1999 , volume =

    1999

  260. [268]

    Frieze and G

    Alan M. Frieze and G. Galbiati and F. Maffioli , title =. Networks , year =

  261. [269]

    1999 , editor =

    Eiichiro Fujisaki and Tatsuaki Okamoto , title =. 1999 , editor =

    1999

  262. [270]

    1981 , volume =

    Ofer Gabber and Zvi Galil , title =. 1981 , volume =

    1981

  263. [271]

    Gabidulin and A

    Ernst M. Gabidulin and A. V. Paramonov and O. V. Tretjakov , title =. 1991 , editor =

    1991

  264. [272]

    Galbraith , title =

    Steven D. Galbraith , title =. 2001 , editor =

    2001

  265. [273]

    Galbraith and Keith Harrison and David Soldera , title =

    Steven D. Galbraith and Keith Harrison and David Soldera , title =. 2002 , editor =

    2002

  266. [274]

    Gasarch , title =

    William I. Gasarch , title =. ACM SIGACT News , year =

  267. [275]

    2002 , editor =

    Craig Gentry and Alice Silverberg , title =. 2002 , editor =

    2002

  268. [276]

    2001 , pages =

    Yael Gertner and Tal Malkin and Omer Reingold , title =. 2001 , pages =

    2001

  269. [277]

    Goldberg and Mark Jerrum , title =

    Paul W. Goldberg and Mark Jerrum , title =. 1995 , volume =

    1995

  270. [278]

    Goldman and M

    S. Goldman and M. Kearns , title =. 1992 , volume =

    1992

  271. [279]

    Goldman and R

    S. Goldman and R. Rivest and R. Schapire , title =. 1993 , volume =

    1993

  272. [280]

    1997 , number =

    Oded Goldreich , title =. 1997 , number =

    1997

  273. [281]

    2002 , printoutnum =

    Oded Goldreich , title =. 2002 , printoutnum =

    2002

  274. [282]

    The foundations of cryptography volume 1 , publisher = camb, year =

    Oded Goldreich , address =. The foundations of cryptography volume 1 , publisher = camb, year =

  275. [283]

    1998 , note =

    Oded Goldreich and Shafi Goldwasser , title =. 1998 , note =

    1998

  276. [284]

    1986 , volume =

    Oded Goldreich and Shafi Goldwasser and Silvio Micali , title =. 1986 , volume =

    1986

  277. [285]

    Levin and Ramarathnam Venkatesan and David Zuckerman , title =

    Oded Goldreich and Russell Impagliazzo and Leonid A. Levin and Ramarathnam Venkatesan and David Zuckerman , title =. 1990 , pages =

    1990

  278. [286]

    1991 , volume =

    Oded Goldreich and Silvio Micali and Avi Wigderson , title =. 1991 , volume =

    1991

  279. [287]

    1995 , number =

    Oded Goldreich and Noam Nisan and Avi Wigderson , title =. 1995 , number =

    1995

  280. [288]

    1999 , volume =

    Oded Goldreich and Erez Petrank , title =. 1999 , volume =

    1999

  281. [289]

    1997 , volume =

    Oded Goldreich and Dana Ron , title =. 1997 , volume =

    1997

  282. [290]

    1999 , editor =

    Oded Goldreich and Amit Sahai and Salil Vadhan , title =. 1999 , editor =

    1999

  283. [291]

    Vadhan , title =

    Oded Goldreich and Amit Sahai and Salil P. Vadhan , title =. 1998 , pages =

    1998

  284. [292]

    2003 , volume =

    Oded Goldreich and Luca Trevisan , title =. 2003 , volume =

    2003

  285. [293]

    1999 , pages =

    Oded Goldreich and Salil Vadhan , title =. 1999 , pages =

    1999

  286. [294]

    2003 , volume =

    Oded Goldreich and Salil Vadhan and Avi Wigderson , title =. 2003 , volume =

    2003

  287. [295]

    Vadhan and Avi Wigderson , title =

    Oded Goldreich and Salil P. Vadhan and Avi Wigderson , title =. 2000 , number =

    2000

  288. [296]

    1999 , editor =

    Oded Goldreich and Avi Wigderson , title =. 1999 , editor =

    1999

  289. [297]

    1996 , volume =

    Oded Goldreich and Avi Wigderson , title =. 1996 , volume =

    1996

  290. [298]

    1997 , number =

    Oded Goldreich and David Zuckerman , title =. 1997 , number =

    1997

  291. [299]

    Distributed Computing, 16th International Conference --- (DISC 2002) , year =

    Shafi Goldwasser and Yehuda Lindell , title =. Distributed Computing, 16th International Conference --- (DISC 2002) , year =

    2002

  292. [300]

    1984 , volume =

    Shafi Goldwasser and Silvio Micali , title =. 1984 , volume =

    1984

Pith tools

Reviewed July 3, 2026 · model on record in the stance chip above.