default search action

combined dblp search
author search
venue search
publication search

ask others

Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

export results for "Dana Moshkovitz"

> Home > Search

download as .bib file

@inproceedings{DBLP:conf/coco/CookM24,
  author       = {Joshua Cook and
                  Dana Moshkovitz},
  title        = {Explicit Time and Space Efficient Encoders Exist Only with Random
                  Access},
  booktitle    = {{CCC}},
  series       = {LIPIcs},
  volume       = {300},
  pages        = {5:1--5:54},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024}
}

@inproceedings{DBLP:conf/isit/MonMO24,
  author       = {Geoffrey Mon and
                  Dana Moshkovitz and
                  Justin Oh},
  title        = {Approximate Locally Decodable Codes with Constant Query Complexity
                  and Nearly Optimal Rate},
  booktitle    = {{ISIT}},
  pages        = {2838--2843},
  publisher    = {{IEEE}},
  year         = {2024}
}

@article{DBLP:journals/eccc/CookM24,
  author       = {Joshua Cook and
                  Dana Moshkovitz},
  title        = {Explicit Time and Space Efficient Encoders Exist Only With Random
                  Access},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR24-032}},
  year         = {2024}
}

@article{DBLP:journals/eccc/CookM24a,
  author       = {Joshua Cook and
                  Dana Moshkovitz},
  title        = {Time and Space Efficient Deterministic Decoders},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR24-110}},
  year         = {2024}
}

@inproceedings{DBLP:conf/approx/CookM23,
  author       = {Joshua Cook and
                  Dana Moshkovitz},
  title        = {Tighter {MA/1} Circuit Lower Bounds from Verifier Efficient PCPs for
                  {PSPACE}},
  booktitle    = {{APPROX/RANDOM}},
  series       = {LIPIcs},
  volume       = {275},
  pages        = {55:1--55:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023}
}

@inproceedings{DBLP:conf/isaac/HiraharaM23,
  author       = {Shuichi Hirahara and
                  Dana Moshkovitz},
  title        = {Regularization of Low Error PCPs and an Application to {MCSP}},
  booktitle    = {{ISAAC}},
  series       = {LIPIcs},
  volume       = {283},
  pages        = {39:1--39:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023}
}

@inproceedings{DBLP:conf/stoc/DoronMOZ23,
  author       = {Dean Doron and
                  Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Almost Chor-Goldreich Sources and Adversarial Random Walks},
  booktitle    = {{STOC}},
  pages        = {1--9},
  publisher    = {{ACM}},
  year         = {2023}
}

@article{DBLP:journals/eccc/MonMO23,
  author       = {Geoffrey Mon and
                  Dana Moshkovitz and
                  Justin Oh},
  title        = {Approximate Locally Decodable Codes with Constant Query Complexity
                  and Nearly Optimal Rate},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-056}},
  year         = {2023}
}

@article{DBLP:journals/jacm/DoronMOZ22,
  author       = {Dean Doron and
                  Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Nearly Optimal Pseudorandomness from Hardness},
  journal      = {J. {ACM}},
  volume       = {69},
  number       = {6},
  pages        = {43:1--43:55},
  year         = {2022}
}

@inproceedings{DBLP:conf/innovations/EldanM22,
  author       = {Ronen Eldan and
                  Dana Moshkovitz},
  title        = {Reduction from Non-Unique Games to Boolean Unique Games},
  booktitle    = {{ITCS}},
  series       = {LIPIcs},
  volume       = {215},
  pages        = {64:1--64:25},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022}
}

@article{DBLP:journals/eccc/CookM22,
  author       = {Joshua Cook and
                  Dana Moshkovitz},
  title        = {Tighter {MA/1} Circuit Lower Bounds From Verifier Efficient PCPs for
                  {PSPACE}},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-014}},
  year         = {2022}
}

@article{DBLP:journals/eccc/DoronMOZ22,
  author       = {Dean Doron and
                  Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Almost Chor-Goldreich Sources and Adversarial Random Walks},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-103}},
  year         = {2022}
}

@inproceedings{DBLP:conf/fsttcs/JalanM21,
  author       = {Akhil Jalan and
                  Dana Moshkovitz},
  title        = {Near-Optimal Cayley Expanders for Abelian Groups},
  booktitle    = {{FSTTCS}},
  series       = {LIPIcs},
  volume       = {213},
  pages        = {24:1--24:23},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021}
}

@article{DBLP:journals/corr/abs-2105-01149,
  author       = {Akhil Jalan and
                  Dana Moshkovitz},
  title        = {Near-Optimal Cayley Expanders for Abelian Groups},
  journal      = {CoRR},
  volume       = {abs/2105.01149},
  year         = {2021}
}

@article{DBLP:journals/eccc/Moshkovitz21,
  author       = {Dana Moshkovitz},
  title        = {Strong Parallel Repetition for Unique Games on Small Set Expanders},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR21-042}},
  year         = {2021}
}

@article{DBLP:journals/siamcomp/GrossmanM20,
  author       = {Ofer Grossman and
                  Dana Moshkovitz},
  title        = {Amplification and Derandomization without Slowdown},
  journal      = {{SIAM} J. Comput.},
  volume       = {49},
  number       = {5},
  pages        = {959--998},
  year         = {2020}
}

@inproceedings{DBLP:conf/focs/DoronMOZ20,
  author       = {Dean Doron and
                  Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Nearly Optimal Pseudorandomness From Hardness},
  booktitle    = {{FOCS}},
  pages        = {1057--1068},
  publisher    = {{IEEE}},
  year         = {2020}
}

@inproceedings{DBLP:conf/fsttcs/MoshkovitzOZ20,
  author       = {Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Randomness Efficient Noise Stability and Generalized Small Bias Sets},
  booktitle    = {{FSTTCS}},
  series       = {LIPIcs},
  volume       = {182},
  pages        = {31:1--31:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020}
}

@article{DBLP:journals/corr/abs-2006-13073,
  author       = {Ronen Eldan and
                  Dana Moshkovitz},
  title        = {Reduction From Non-Unique Games To Boolean Unique Games},
  journal      = {CoRR},
  volume       = {abs/2006.13073},
  year         = {2020}
}

@article{DBLP:journals/eccc/EldanM20,
  author       = {Ronen Eldan and
                  Dana Moshkovitz},
  title        = {Reduction From Non-Unique Games To Boolean Unique Games},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR20-093}},
  year         = {2020}
}

@article{DBLP:journals/sigact/Moshkovitz19,
  author       = {Dana Moshkovitz},
  title        = {Sliding Scale Conjectures in {PCP}},
  journal      = {{SIGACT} News},
  volume       = {50},
  number       = {3},
  pages        = {25--33},
  year         = {2019}
}

@article{DBLP:journals/eccc/DoronMOZ19,
  author       = {Dean Doron and
                  Dana Moshkovitz and
                  Justin Oh and
                  David Zuckerman},
  title        = {Nearly Optimal Pseudorandomness From Hardness},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-099}},
  year         = {2019}
}

@inproceedings{DBLP:conf/innovations/MoshkovitzM18,
  author       = {Dana Moshkovitz and
                  Michal Moshkovitz},
  title        = {Entropy Samplers and Strong Generic Lower Bounds For Space Bounded
                  Learning},
  booktitle    = {{ITCS}},
  series       = {LIPIcs},
  volume       = {94},
  pages        = {28:1--28:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018}
}

@article{DBLP:journals/eccc/KhotMMS18,
  author       = {Subhash Khot and
                  Dor Minzer and
                  Dana Moshkovitz and
                  Muli Safra},
  title        = {Small Set Expansion in The Johnson Graph},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR18-078}},
  year         = {2018}
}

@article{DBLP:journals/algorithmica/ManurangsiM17,
  author       = {Pasin Manurangsi and
                  Dana Moshkovitz},
  title        = {Improved Approximation Algorithms for Projection Games},
  journal      = {Algorithmica},
  volume       = {77},
  number       = {2},
  pages        = {555--594},
  year         = {2017}
}

@article{DBLP:journals/cc/Moshkovitz17,
  author       = {Dana Moshkovitz},
  title        = {Low-degree test with polynomially small error},
  journal      = {Comput. Complex.},
  volume       = {26},
  number       = {3},
  pages        = {531--582},
  year         = {2017}
}

@article{DBLP:journals/rsa/LeviMRRS17,
  author       = {Reut Levi and
                  Guy Moshkovitz and
                  Dana Ron and
                  Ronitt Rubinfeld and
                  Asaf Shapira},
  title        = {Constructing near spanning trees with few local inspections},
  journal      = {Random Struct. Algorithms},
  volume       = {50},
  number       = {2},
  pages        = {183--200},
  year         = {2017}
}

@inproceedings{DBLP:conf/colt/MoshkovitzM17,
  author       = {Dana Moshkovitz and
                  Michal Moshkovitz},
  title        = {Mixing Implies Lower Bounds for Space Bounded Learning},
  booktitle    = {{COLT}},
  series       = {Proceedings of Machine Learning Research},
  volume       = {65},
  pages        = {1516--1566},
  publisher    = {{PMLR}},
  year         = {2017}
}

@inproceedings{DBLP:conf/soda/ChlamtacMMV17,
  author       = {Eden Chlamt{\'{a}}c and
                  Pasin Manurangsi and
                  Dana Moshkovitz and
                  Aravindan Vijayaraghavan},
  title        = {Approximation Algorithms for Label Cover and The Log-Density Threshold},
  booktitle    = {{SODA}},
  pages        = {900--919},
  publisher    = {{SIAM}},
  year         = {2017}
}

@article{DBLP:journals/eccc/MoshkovitzM17,
  author       = {Michal Moshkovitz and
                  Dana Moshkovitz},
  title        = {Mixing Implies Lower Bounds for Space Bounded Learning},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR17-017}},
  year         = {2017}
}

@article{DBLP:journals/eccc/MoshkovitzM17a,
  author       = {Michal Moshkovitz and
                  Dana Moshkovitz},
  title        = {Mixing Implies Strong Lower Bounds for Space Bounded Learning},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR17-116}},
  year         = {2017}
}

@inproceedings{DBLP:conf/approx/MoshkovitzRY16,
  author       = {Dana Moshkovitz and
                  Govind Ramnarayan and
                  Henry Yuen},
  title        = {A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian},
  booktitle    = {{APPROX-RANDOM}},
  series       = {LIPIcs},
  volume       = {60},
  pages        = {42:3--42:29},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016}
}

@inproceedings{DBLP:conf/focs/GrossmanM16,
  author       = {Ofer Grossman and
                  Dana Moshkovitz},
  title        = {Amplification and Derandomization without Slowdown},
  booktitle    = {{FOCS}},
  pages        = {770--779},
  publisher    = {{IEEE} Computer Society},
  year         = {2016}
}

@inproceedings{DBLP:conf/stoc/KhotM16,
  author       = {Subhash Khot and
                  Dana Moshkovitz},
  title        = {Candidate hard unique game},
  booktitle    = {{STOC}},
  pages        = {63--76},
  publisher    = {{ACM}},
  year         = {2016}
}

@article{DBLP:journals/corr/MoshkovitzRY16,
  author       = {Dana Moshkovitz and
                  Govind Ramnarayan and
                  Henry Yuen},
  title        = {A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian},
  journal      = {CoRR},
  volume       = {abs/1607.07130},
  year         = {2016}
}

@article{DBLP:journals/toc/Moshkovitz15,
  author       = {Dana Moshkovitz},
  title        = {The Projection Games Conjecture and the NP-Hardness of ln n-Approximating
                  Set-Cover},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {221--235},
  year         = {2015}
}

@inproceedings{DBLP:conf/approx/ManurangsiM15,
  author       = {Pasin Manurangsi and
                  Dana Moshkovitz},
  title        = {Approximating Dense Max 2-CSPs},
  booktitle    = {{APPROX-RANDOM}},
  series       = {LIPIcs},
  volume       = {40},
  pages        = {396--415},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015}
}

@article{DBLP:journals/corr/GrossmanM15,
  author       = {Ofer Grossman and
                  Dana Moshkovitz},
  title        = {Amplification and Derandomization Without Slowdown},
  journal      = {CoRR},
  volume       = {abs/1509.08123},
  year         = {2015}
}

@article{DBLP:journals/corr/LeviMRRS15,
  author       = {Reut Levi and
                  Guy Moshkovitz and
                  Dana Ron and
                  Ronitt Rubinfeld and
                  Asaf Shapira},
  title        = {Constructing Near Spanning Trees with Few Local Inspections},
  journal      = {CoRR},
  volume       = {abs/1502.00413},
  year         = {2015}
}

@article{DBLP:journals/corr/ManurangsiM15,
  author       = {Pasin Manurangsi and
                  Dana Moshkovitz},
  title        = {Approximating Dense Max 2-CSPs},
  journal      = {CoRR},
  volume       = {abs/1507.08348},
  year         = {2015}
}

@article{DBLP:journals/eccc/GrossmanM15,
  author       = {Ofer Grossman and
                  Dana Moshkovitz},
  title        = {Amplification and Derandomization Without Slowdown},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-158}},
  year         = {2015}
}

@article{DBLP:journals/eccc/LeviMRRS15,
  author       = {Reut Levi and
                  Guy Moshkovitz and
                  Dana Ron and
                  Ronitt Rubinfeld and
                  Asaf Shapira},
  title        = {Constructing Near Spanning Trees with Few Local Inspections},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-019}},
  year         = {2015}
}

@inproceedings{DBLP:conf/coco/AaronsonIM14,
  author       = {Scott Aaronson and
                  Russell Impagliazzo and
                  Dana Moshkovitz},
  title        = {{AM} with Multiple Merlins},
  booktitle    = {{CCC}},
  pages        = {44--55},
  publisher    = {{IEEE} Computer Society},
  year         = {2014}
}

@inproceedings{DBLP:conf/focs/Moshkovitz14,
  author       = {Dana Moshkovitz},
  title        = {Parallel Repetition from Fortification},
  booktitle    = {{FOCS}},
  pages        = {414--423},
  publisher    = {{IEEE} Computer Society},
  year         = {2014}
}

@article{DBLP:journals/corr/AaronsonIM14,
  author       = {Scott Aaronson and
                  Russell Impagliazzo and
                  Dana Moshkovitz},
  title        = {{AM} with Multiple Merlins},
  journal      = {CoRR},
  volume       = {abs/1401.6848},
  year         = {2014}
}

@article{DBLP:journals/corr/ManurangsiM14,
  author       = {Pasin Manurangsi and
                  Dana Moshkovitz},
  title        = {Improved Approximation Algorithms for Projection Games},
  journal      = {CoRR},
  volume       = {abs/1408.4048},
  year         = {2014}
}

@article{DBLP:journals/eccc/AaronsonIM14,
  author       = {Scott Aaronson and
                  Russell Impagliazzo and
                  Dana Moshkovitz},
  title        = {{AM} with Multiple Merlins},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-012}},
  year         = {2014}
}

@article{DBLP:journals/eccc/KhotM14,
  author       = {Subhash Khot and
                  Dana Moshkovitz},
  title        = {Candidate Lasserre Integrality Gap For Unique Games},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-142}},
  year         = {2014}
}

@article{DBLP:journals/eccc/Moshkovitz14,
  author       = {Dana Moshkovitz},
  title        = {An Approach To The Sliding Scale Conjecture Via Parallel Repetition
                  For Low Degree Testing},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-030}},
  year         = {2014}
}

@article{DBLP:journals/eccc/Moshkovitz14a,
  author       = {Dana Moshkovitz},
  title        = {Parallel Repetition of Fortified Games},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-054}},
  year         = {2014}
}

@article{DBLP:journals/eccc/Moshkovitz14b,
  author       = {Dana Moshkovitz},
  title        = {Direct Product Testing With Nearly Identical Sets},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR14-182}},
  year         = {2014}
}

@article{DBLP:journals/siamcomp/KhotM13,
  author       = {Subhash Khot and
                  Dana Moshkovitz},
  title        = {\emph{NP}-Hardness of Approximately Solving Linear Equations over
                  Reals},
  journal      = {{SIAM} J. Comput.},
  volume       = {42},
  number       = {3},
  pages        = {752--791},
  year         = {2013}
}

@inproceedings{DBLP:conf/esa/ManurangsiM13,
  author       = {Pasin Manurangsi and
                  Dana Moshkovitz},
  title        = {Improved Approximation Algorithms for Projection Games - (Extended
                  Abstract)},
  booktitle    = {{ESA}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8125},
  pages        = {683--694},
  publisher    = {Springer},
  year         = {2013}
}

@inproceedings{DBLP:conf/isit/AbdrashitovMM13,
  author       = {Vitaly Abdrashitov and
                  Muriel M{\'{e}}dard and
                  Dana Moshkovitz},
  title        = {Matched filter decoding of random binary and Gaussian codes in broadband
                  Gaussian channel},
  booktitle    = {{ISIT}},
  pages        = {2528--2523},
  publisher    = {{IEEE}},
  year         = {2013}
}

@article{DBLP:journals/crossroads/Moshkovitz12,
  author       = {Dana Moshkovitz},
  title        = {The tale of the {PCP} theorem},
  journal      = {{XRDS}},
  volume       = {18},
  number       = {3},
  pages        = {23--26},
  year         = {2012}
}

@article{DBLP:journals/sigact/Moshkovitz12,
  author       = {Dana Moshkovitz},
  title        = {Guest column: algebraic construction of projection PCPs},
  journal      = {{SIGACT} News},
  volume       = {43},
  number       = {1},
  pages        = {62--81},
  year         = {2012}
}

@inproceedings{DBLP:conf/approx/Moshkovitz12,
  author       = {Dana Moshkovitz},
  title        = {The Projection Games Conjecture and the NP-Hardness of ln n-Approximating
                  Set-Cover},
  booktitle    = {{APPROX-RANDOM}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7408},
  pages        = {276--287},
  publisher    = {Springer},
  year         = {2012}
}

@inproceedings{DBLP:conf/stoc/KhotM11,
  author       = {Subhash Khot and
                  Dana Moshkovitz},
  title        = {NP-hardness of approximately solving linear equations over reals},
  booktitle    = {{STOC}},
  pages        = {413--420},
  publisher    = {{ACM}},
  year         = {2011}
}

@article{DBLP:journals/eccc/Moshkovitz11,
  author       = {Dana Moshkovitz},
  title        = {The Projection Games Conjecture and The NP-Hardness of ln n-Approximating
                  Set-Cover},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-112}},
  year         = {2011}
}

@article{DBLP:journals/cc/MoshkovitzR10,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear
                  Size},
  journal      = {Comput. Complex.},
  volume       = {19},
  number       = {3},
  pages        = {367--422},
  year         = {2010}
}

@article{DBLP:journals/jacm/MoshkovitzR10,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Two-query {PCP} with subconstant error},
  journal      = {J. {ACM}},
  volume       = {57},
  number       = {5},
  pages        = {29:1--29:29},
  year         = {2010}
}

@inproceedings{DBLP:conf/stoc/AkaviaGGM10,
  author       = {Adi Akavia and
                  Oded Goldreich and
                  Shafi Goldwasser and
                  Dana Moshkovitz},
  title        = {Erratum for: on basing one-way functions on NP-hardness},
  booktitle    = {{STOC}},
  pages        = {795--796},
  publisher    = {{ACM}},
  year         = {2010}
}

@article{DBLP:journals/corr/abs-1002-3864,
  author       = {Prahladh Harsha and
                  Moses Charikar and
                  Matthew Andrews and
                  Sanjeev Arora and
                  Subhash Khot and
                  Dana Moshkovitz and
                  Lisa Zhang and
                  Ashkan Aazami and
                  Dev Desai and
                  Igor Gorodezky and
                  Geetha Jagannathan and
                  Alexander S. Kulikov and
                  Darakhshan J. Mir and
                  Alantha Newman and
                  Aleksandar Nikolov and
                  David Pritchard and
                  Gwen Spencer},
  title        = {Limits of Approximation Algorithms: PCPs and Unique Games {(DIMACS}
                  Tutorial Lecture Notes)},
  journal      = {CoRR},
  volume       = {abs/1002.3864},
  year         = {2010}
}

@article{DBLP:journals/eccc/KhotM10,
  author       = {Subhash Khot and
                  Dana Moshkovitz},
  title        = {NP-Hardness of Approximately Solving Linear Equations Over Reals},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-112}},
  year         = {2010}
}

@article{DBLP:journals/eccc/Moshkovitz10,
  author       = {Dana Moshkovitz},
  title        = {An Alternative Proof of The Schwartz-Zippel Lemma},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-096}},
  year         = {2010}
}

@article{DBLP:journals/eccc/MoshkovitzK10,
  author       = {Dana Moshkovitz and
                  Subhash Khot},
  title        = {Hardness of Approximately Solving Linear Equations Over Reals},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-053}},
  year         = {2010}
}

@article{DBLP:journals/siamcomp/MoshkovitzR08,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Sub-Constant Error Low Degree Test of Almost-Linear Size},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {1},
  pages        = {140--180},
  year         = {2008}
}

@inproceedings{DBLP:conf/focs/MoshkovitzR08,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Two Query {PCP} with Sub-Constant Error},
  booktitle    = {{FOCS}},
  pages        = {314--323},
  publisher    = {{IEEE} Computer Society},
  year         = {2008}
}

@article{DBLP:journals/eccc/MoshkovitzR08a,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Two Query {PCP} with Sub-Constant Error},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR08-071}},
  year         = {2008}
}

@article{DBLP:journals/eccc/MoshkovitzR07,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Sub-Constant Error Probabilistically Checkable Proof of Almost Linear
                  Size},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-026}},
  year         = {2007}
}

@article{DBLP:journals/talg/AlonMS06,
  author       = {Noga Alon and
                  Dana Moshkovitz and
                  Shmuel Safra},
  title        = {Algorithmic construction of sets for \emph{k}-restrictions},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {2},
  number       = {2},
  pages        = {153--177},
  year         = {2006}
}

@inproceedings{DBLP:conf/stoc/AkaviaGGM06,
  author       = {Adi Akavia and
                  Oded Goldreich and
                  Shafi Goldwasser and
                  Dana Moshkovitz},
  title        = {On basing one-way functions on NP-hardness},
  booktitle    = {{STOC}},
  pages        = {701--710},
  publisher    = {{ACM}},
  year         = {2006}
}

@inproceedings{DBLP:conf/stoc/MoshkovitzR06,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Sub-constant error low degree test of almost-linear size},
  booktitle    = {{STOC}},
  pages        = {21--30},
  publisher    = {{ACM}},
  year         = {2006}
}

@article{DBLP:journals/eccc/ECCC-TR05-086,
  author       = {Dana Moshkovitz and
                  Ran Raz},
  title        = {Sub-Constant Error Low Degree Test of Almost Linear Size},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR05-086}},
  year         = {2005}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.