Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Amnon Ta-Shma
@inproceedings{DBLP:conf/focs/0003RT23,
author = {Itay Cohen and
Roy Roth and
Amnon Ta{-}Shma},
title = {{HDX} Condensers},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1649--1664},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00100},
doi = {10.1109/FOCS57990.2023.00100},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/0003RT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenDST23,
author = {Gil Cohen and
Dean Doron and
Ori Sberlo and
Amnon Ta{-}Shma},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximating Iterated Multiplication of Stochastic Matrices in Small
Space},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {35--45},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585181},
doi = {10.1145/3564246.3585181},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenDST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2023,
editor = {Amnon Ta{-}Shma},
title = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-282-2},
isbn = {978-3-95977-282-2},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0003RT23,
author = {Itay Cohen and
Roy Roth and
Amnon Ta{-}Shma},
title = {{HDX} Condensers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-090}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/090},
eprinttype = {ECCC},
eprint = {TR23-090},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0003RT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DoronTT22,
author = {Dean Doron and
Amnon Ta{-}Shma and
Roei Tell},
title = {On Hitting-Set Generators for Polynomials that Vanish Rarely},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {16},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00229-2},
doi = {10.1007/S00037-022-00229-2},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DoronTT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-AroyaDT22,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
title = {An Efficient Reduction from Two-Source to Nonmalleable Extractors:
Achieving Near-Logarithmic Min-Entropy},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {2},
pages = {17--31},
year = {2022},
url = {https://doi.org/10.1137/17m1133245},
doi = {10.1137/17M1133245},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ben-AroyaDT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KarlinerT22,
author = {Dan Karliner and
Amnon Ta{-}Shma},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Improved Local Testing for Multiplicity Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.11},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.11},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KarlinerT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KalevT22,
author = {Itay Kalev and
Amnon Ta{-}Shma},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Unbalanced Expanders from Multiplicity Codes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.12},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.12},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/KalevT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/KarlinerST22,
author = {Dan Karliner and
Roie Salama and
Amnon Ta{-}Shma},
editor = {Shachar Lovett},
title = {The Plane Test Is a Local Tester for Multiplicity Codes},
booktitle = {37th Computational Complexity Conference, {CCC} 2022, July 20-23,
2022, Philadelphia, PA, {USA}},
series = {LIPIcs},
volume = {234},
pages = {14:1--14:33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CCC.2022.14},
doi = {10.4230/LIPICS.CCC.2022.14},
timestamp = {Tue, 12 Jul 2022 17:25:23 +0200},
biburl = {https://dblp.org/rec/conf/coco/KarlinerST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CohenMPPT22,
author = {Gil Cohen and
Dor Minzer and
Shir Peleg and
Aaron Potechin and
Amnon Ta{-}Shma},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Expander Random Walks: The General Case and Limitations},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {43:1--43:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.43},
doi = {10.4230/LIPICS.ICALP.2022.43},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CohenMPPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenDST22,
author = {Gil Cohen and
Dean Doron and
Ori Sberlo and
Amnon Ta{-}Shma},
title = {Approximating Iterated Multiplication of Stochastic Matrices in Small
Space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-149}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/149},
eprinttype = {ECCC},
eprint = {TR22-149},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/CohenDST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalevT22,
author = {Itay Kalev and
Amnon Ta{-}Shma},
title = {Unbalanced Expanders from Multiplicity Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-073}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/073},
eprinttype = {ECCC},
eprint = {TR22-073},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalevT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarlinerST22,
author = {Dan Karliner and
Roie Salama and
Amnon Ta{-}Shma},
title = {The plane test is a local tester for Multiplicity Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-028}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/028},
eprinttype = {ECCC},
eprint = {TR22-028},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/KarlinerST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KarlinerT22,
author = {Dan Karliner and
Amnon Ta{-}Shma},
title = {Improved local testing for multiplicity codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-078}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/078},
eprinttype = {ECCC},
eprint = {TR22-078},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KarlinerT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinurHKNT21,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Inbal Livni Navon and
Amnon Ta{-}Shma},
title = {List-Decoding with Double Samplers},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {2},
pages = {301--349},
year = {2021},
url = {https://doi.org/10.1137/19M1276650},
doi = {10.1137/19M1276650},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinurHKNT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CohenDRST21,
author = {Gil Cohen and
Dean Doron and
Oren Renard and
Ori Sberlo and
Amnon Ta{-}Shma},
editor = {Valentine Kabanets},
title = {Error Reduction for Weighted PRGs Against Read Once Branching Programs},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {22:1--22:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.22},
doi = {10.4230/LIPICS.CCC.2021.22},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/CohenDRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenPT21,
author = {Gil Cohen and
Noam Peri and
Amnon Ta{-}Shma},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Expander random walks: a Fourier-analytic approach},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1643--1655},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451049},
doi = {10.1145/3406325.3451049},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenDRST21,
author = {Gil Cohen and
Dean Doron and
Oren Renard and
Ori Sberlo and
Amnon Ta{-}Shma},
title = {Error Reduction For Weighted PRGs Against Read Once Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-020}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/020},
eprinttype = {ECCC},
eprint = {TR21-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenDRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenMPPT21,
author = {Gil Cohen and
Dor Minzer and
Shir Peleg and
Aaron Potechin and
Amnon Ta{-}Shma},
title = {Expander Random Walks: The General Case and Limitations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-091}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/091},
eprinttype = {ECCC},
eprint = {TR21-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenMPPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DoronTT20,
author = {Dean Doron and
Amnon Ta{-}Shma and
Roei Tell},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {On Hitting-Set Generators for Polynomials That Vanish Rarely},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {7:1--7:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.7},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DoronTT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AroyaDT20,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
editor = {Shubhangi Saraf},
title = {Near-Optimal Erasure List-Decodable Codes},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {1:1--1:27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.1},
doi = {10.4230/LIPICS.CCC.2020.1},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AroyaDT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenPT20,
author = {Gil Cohen and
Noam Peri and
Amnon Ta{-}Shma},
title = {Expander Random Walks: {A} Fourier-Analytic Approach},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-163}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/163},
eprinttype = {ECCC},
eprint = {TR20-163},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KrakPT20,
author = {Gonen Krak and
Noam Parzanchevski and
Amnon Ta{-}Shma},
title = {Pr-ZSUBEXP is not contained in Pr-RP},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-059}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/059},
eprinttype = {ECCC},
eprint = {TR20-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KrakPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/AvivT19,
author = {Nir Aviv and
Amnon Ta{-}Shma},
title = {On the Entropy Loss and Gap of Condensers},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {3},
pages = {15:1--15:14},
year = {2019},
url = {https://doi.org/10.1145/3317691},
doi = {10.1145/3317691},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/AvivT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Ben-AroyaCDT19,
author = {Avraham Ben{-}Aroya and
Gil Cohen and
Dean Doron and
Amnon Ta{-}Shma},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient
Functions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {43:1--43:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.43},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.43},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/Ben-AroyaCDT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DinurHKNT19,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Inbal Livni Navon and
Amnon Ta{-}Shma},
editor = {Timothy M. Chan},
title = {List Decoding with Double Samplers},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2134--2153},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.129},
doi = {10.1137/1.9781611975482.129},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DinurHKNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronTT19,
author = {Dean Doron and
Amnon Ta{-}Shma and
Roei Tell},
title = {On Hitting-Set Generators for Polynomials that Vanish Rarely},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-119}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/119},
eprinttype = {ECCC},
eprint = {TR19-119},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronTT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AroyaCD0T18,
author = {Avraham Ben{-}Aroya and
Eshan Chattopadhyay and
Dean Doron and
Xin Li and
Amnon Ta{-}Shma},
editor = {Rocco A. Servedio},
title = {A New Approach for Constructing Low-Error, Two-Source Extractors},
booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24,
2018, San Diego, CA, {USA}},
series = {LIPIcs},
volume = {102},
pages = {3:1--3:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.3},
doi = {10.4230/LIPICS.CCC.2018.3},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AroyaCD0T18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04080,
author = {Ishay Haviv and
Oded Regev and
Amnon Ta{-}Shma},
title = {On the Hardness of Satisfiability with Bounded Occurrences in the
Polynomial-Time Hierarchy},
journal = {CoRR},
volume = {abs/1806.04080},
year = {2018},
url = {http://arxiv.org/abs/1806.04080},
eprinttype = {arXiv},
eprint = {1806.04080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-00425,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Inbal Livni Navon and
Amnon Ta{-}Shma},
title = {List Decoding with Double Samplers},
journal = {CoRR},
volume = {abs/1808.00425},
year = {2018},
url = {http://arxiv.org/abs/1808.00425},
eprinttype = {arXiv},
eprint = {1808.00425},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-00425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaCDT18,
author = {Avraham Ben{-}Aroya and
Gil Cohen and
Dean Doron and
Amnon Ta{-}Shma},
title = {Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient
Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-066}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/066},
eprinttype = {ECCC},
eprint = {TR18-066},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaCDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaDT18,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
title = {Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-065}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/065},
eprinttype = {ECCC},
eprint = {TR18-065},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaDT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DinurHKNT18,
author = {Irit Dinur and
Prahladh Harsha and
Tali Kaufman and
Inbal Livni Navon and
Amnon Ta{-}Shma},
title = {List Decoding with Double Samplers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-136}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/136},
eprinttype = {ECCC},
eprint = {TR18-136},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DinurHKNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DoronST17,
author = {Dean Doron and
Amir Sarid and
Amnon Ta{-}Shma},
title = {On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic
Logspace},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {393--420},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0150-y},
doi = {10.1007/S00037-016-0150-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DoronST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DoronGT17,
author = {Dean Doron and
Fran{\c{c}}ois Le Gall and
Amnon Ta{-}Shma},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {41:1--41:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.41},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.41},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/DoronGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma17,
author = {Amnon Ta{-}Shma},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Explicit, almost optimal, epsilon-balanced codes},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {238--251},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055408},
doi = {10.1145/3055399.3055408},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-AroyaDT17,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {An efficient reduction from two-source to non-malleable extractors:
achieving near-logarithmic min-entropy},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {1185--1194},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055423},
doi = {10.1145/3055399.3055423},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ben-AroyaDT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaCDLT17,
author = {Avraham Ben{-}Aroya and
Eshan Chattopadhyay and
Dean Doron and
Xin Li and
Amnon Ta{-}Shma},
title = {A reduction from efficient non-malleable extractors to low-error two-source
extractors with arbitrary constant rate},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-027}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/027},
eprinttype = {ECCC},
eprint = {TR17-027},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaCDLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronGT17,
author = {Dean Doron and
Francois Le Gall and
Amnon Ta{-}Shma},
title = {Probabilistic logarithmic-space algorithms for Laplacian solvers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-036}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/036},
eprinttype = {ECCC},
eprint = {TR17-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronGT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ta-Shma17,
author = {Amnon Ta{-}Shma},
title = {Explicit, almost optimal, epsilon-balanced codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-041}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/041},
eprinttype = {ECCC},
eprint = {TR17-041},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ta-Shma17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaDT16,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
title = {Explicit two-source extractors for near-logarithmic min-entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-088}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/088},
eprinttype = {ECCC},
eprint = {TR16-088},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaDT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaDT16a,
author = {Avraham Ben{-}Aroya and
Dean Doron and
Amnon Ta{-}Shma},
title = {Low-error two-source extractors for polynomial min-entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-106}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/106},
eprinttype = {ECCC},
eprint = {TR16-106},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaDT16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DoronST16,
author = {Dean Doron and
Amir Sarid and
Amnon Ta{-}Shma},
title = {On approximating the eigenvalues of stochastic matrices in probabilistic
logspace},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-120}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/120},
eprinttype = {ECCC},
eprint = {TR16-120},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DoronST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DoronT15,
author = {Dean Doron and
Amnon Ta{-}Shma},
title = {On the de-randomization of space-bounded approximate counting problems},
journal = {Inf. Process. Lett.},
volume = {115},
number = {10},
pages = {750--753},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.03.005},
doi = {10.1016/J.IPL.2015.03.005},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DoronT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BermanFGKKLT15,
author = {Ron Berman and
Amos Fiat and
Marcin Gomulkiewicz and
Marek Klonowski and
Miroslaw Kutylowski and
Tomer Levinboim and
Amnon Ta{-}Shma},
title = {Provable Unlinkability Against Traffic Analysis with Low Message Overhead},
journal = {J. Cryptol.},
volume = {28},
number = {3},
pages = {623--640},
year = {2015},
url = {https://doi.org/10.1007/s00145-013-9171-8},
doi = {10.1007/S00145-013-9171-8},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BermanFGKKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DoronT15,
author = {Dean Doron and
Amnon Ta{-}Shma},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {On the Problem of Approximating the Eigenvalues of Undirected Graphs
in Probabilistic Logspace},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {419--431},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_34},
doi = {10.1007/978-3-662-47672-7\_34},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DoronT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ta-ShmaZ14,
author = {Amnon Ta{-}Shma and
Uri Zwick},
title = {Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration
Sequences},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {3},
pages = {12:1--12:15},
year = {2014},
url = {https://doi.org/10.1145/2601068},
doi = {10.1145/2601068},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Ta-ShmaZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dihu/DershowitzDHT14,
author = {Idan Dershowitz and
Nachum Dershowitz and
Tomer Hasid and
Amnon Ta{-}Shma},
title = {Orthography and Biblical Criticism},
booktitle = {9th Annual International Conference of the Alliance of Digital Humanities
Organizations, {DH} 2014, Lausanne, Switzerland, 8-12 July 2014, Conference
Abstracts},
publisher = {Alliance of Digital Humanities Organizations {(ADHO)}},
year = {2014},
url = {http://dharchive.org/paper/DH2014/Poster-749.xml},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dihu/DershowitzDHT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GelmanT14,
author = {Efraim Gelman and
Amnon Ta{-}Shma},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {327--338},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.327},
doi = {10.4230/LIPICS.FSTTCS.2014.327},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GelmanT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Ben-AroyaT13,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {Constructing Small-Bias Sets from Algebraic-Geometric Codes},
journal = {Theory Comput.},
volume = {9},
pages = {253--272},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a005},
doi = {10.4086/TOC.2013.V009A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Ben-AroyaT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma13,
author = {Amnon Ta{-}Shma},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Inverting well conditioned matrices in quantum logspace},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {881--890},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488720},
doi = {10.1145/2488608.2488720},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CohenT13a,
author = {Gil Cohen and
Amnon Ta{-}Shma},
title = {Pseudorandom Generators for Low Degree Polynomials from Algebraic
Geometry Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-155}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/155},
eprinttype = {ECCC},
eprint = {TR13-155},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CohenT13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ben-AroyaT12,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {Better short-seed quantum-proof extractors},
journal = {Theor. Comput. Sci.},
volume = {419},
pages = {17--25},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.11.036},
doi = {10.1016/J.TCS.2011.11.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ben-AroyaT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ta-ShmaU12,
author = {Amnon Ta{-}Shma and
Christopher Umans},
title = {Better Condensers and New Extractors from Parvaresh-Vardy Codes},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {309--315},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.25},
doi = {10.1109/CCC.2012.25},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ta-ShmaU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ev/Ben-NunFLRRTW12,
author = {Jonathan Ben{-}Nun and
Niko Fahri and
Morgan Llewellyn and
Ben Riva and
Alon Rosen and
Amnon Ta{-}Shma and
Douglas Wikstr{\"{o}}m},
editor = {Manuel J. Kripp and
Melanie Volkamer and
R{\"{u}}diger Grimm},
title = {A New Implementation of a Dual (Paper and Cryptographic) Voting System},
booktitle = {5th International Conference on Electronic Voting 2012, {(EVOTE} 2012),
Co-organized by the Council of Europe, Gesellschaft f{\"{u}}r
Informatik and E-Voting.CC, July 11-14, 2012, Castle Hofen, Bregenz,
Austria},
series = {{LNI}},
volume = {{P-205}},
pages = {315--329},
publisher = {{GI}},
year = {2012},
url = {https://dl.gi.de/handle/20.500.12116/18222},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ev/Ben-NunFLRRTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-3736,
author = {Rotem Arnon Friedman and
Esther H{\"{a}}nggi and
Amnon Ta{-}Shma},
title = {Towards the Impossibility of Non-Signalling Privacy Amplification
from Time-Like Ordering Constraints},
journal = {CoRR},
volume = {abs/1205.3736},
year = {2012},
url = {http://arxiv.org/abs/1205.3736},
eprinttype = {arXiv},
eprint = {1205.3736},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-3736.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1125,
author = {Rotem Arnon Friedman and
Amnon Ta{-}Shma},
title = {On the limits of privacy amplification against non-signalling memory
attacks},
journal = {CoRR},
volume = {abs/1211.1125},
year = {2012},
url = {http://arxiv.org/abs/1211.1125},
eprinttype = {arXiv},
eprint = {1211.1125},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1125.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-AroyaT11,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {A Combinatorial Construction of Almost-Ramanujan Graphs Using the
Zig-Zag Product},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {267--290},
year = {2011},
url = {https://doi.org/10.1137/080732651},
doi = {10.1137/080732651},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ben-AroyaT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ta-Shma11,
author = {Amnon Ta{-}Shma},
title = {Short Seed Extractors against Quantum Storage},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {3},
pages = {664--677},
year = {2011},
url = {https://doi.org/10.1137/09076787X},
doi = {10.1137/09076787X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ta-Shma11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Ben-AroyaT11,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {Approximate Quantum Error Correction for Correlated Noise},
journal = {{IEEE} Trans. Inf. Theory},
volume = {57},
number = {6},
pages = {3982--3988},
year = {2011},
url = {https://doi.org/10.1109/TIT.2011.2134410},
doi = {10.1109/TIT.2011.2134410},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Ben-AroyaT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/Ben-AroyaT10,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {On the complexity of approximating the diamond norm},
journal = {Quantum Inf. Comput.},
volume = {10},
number = {1{\&}2},
pages = {77--86},
year = {2010},
url = {https://doi.org/10.26421/QIC10.1-2-6},
doi = {10.26421/QIC10.1-2-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/Ben-AroyaT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Ben-AroyaST10,
author = {Avraham Ben{-}Aroya and
Oded Schwartz and
Amnon Ta{-}Shma},
title = {Quantum Expanders: Motivation and Construction},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {47--79},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a003},
doi = {10.4086/TOC.2010.V006A003},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Ben-AroyaST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-AroyaET10,
author = {Avraham Ben{-}Aroya and
Klim Efremenko and
Amnon Ta{-}Shma},
title = {Local List Decoding with a Constant Number of Queries},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {715--722},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.88},
doi = {10.1109/FOCS.2010.88},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-AroyaET10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaET10,
author = {Avraham Ben{-}Aroya and
Klim Efremenko and
Amnon Ta{-}Shma},
title = {Local list decoding with a constant number of queries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-047}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/047},
eprinttype = {ECCC},
eprint = {TR10-047},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaET10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Ben-AroyaET10a,
author = {Avraham Ben{-}Aroya and
Klim Efremenko and
Amnon Ta{-}Shma},
title = {A Note on Amplifying the Error-Tolerance of Locally Decodable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-134}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/134},
eprinttype = {ECCC},
eprint = {TR10-134},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Ben-AroyaET10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/MoranST09,
author = {Tal Moran and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {Non-interactive Timestamping in the Bounded-Storage Model},
journal = {J. Cryptol.},
volume = {22},
number = {2},
pages = {189--226},
year = {2009},
url = {https://doi.org/10.1007/s00145-008-9035-9},
doi = {10.1007/S00145-008-9035-9},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/MoranST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-AroyaT09,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
title = {Constructing Small-Bias Sets from Algebraic-Geometric Codes},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {191--197},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.44},
doi = {10.1109/FOCS.2009.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-AroyaT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma09,
author = {Amnon Ta{-}Shma},
editor = {Michael Mitzenmacher},
title = {Short seed extractors against quantum storage},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {401--408},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536470},
doi = {10.1145/1536414.1536470},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Ben-AroyaST08,
author = {Avraham Ben{-}Aroya and
Oded Schwartz and
Amnon Ta{-}Shma},
title = {Quantum Expanders: Motivation and Constructions},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {292--303},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.23},
doi = {10.1109/CCC.2008.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Ben-AroyaST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-AroyaT08,
author = {Avraham Ben{-}Aroya and
Amnon Ta{-}Shma},
editor = {Cynthia Dwork},
title = {A combinatorial construction of almost-ramanujan graphs using the
zig-zag product},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {325--334},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374424},
doi = {10.1145/1374376.1374424},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ben-AroyaT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GutfreundST07,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {If {NP} Languages are Hard on the Worst-Case, Then it is Easy to Find
Their Hard Instances},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {412--441},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0235-8},
doi = {10.1007/S00037-007-0235-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GutfreundST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Ta-ShmaUZ07,
author = {Amnon Ta{-}Shma and
Christopher Umans and
David Zuckerman},
title = {Lossless Condensers, Unbalanced Expanders, And Extractors},
journal = {Comb.},
volume = {27},
number = {2},
pages = {213--240},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-0053-2},
doi = {10.1007/S00493-007-0053-2},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Ta-ShmaUZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qip/RapaportT07,
author = {Alex Rapaport and
Amnon Ta{-}Shma},
title = {On the Power of Quantum, One Round, Two Prover Interactive Proof Systems},
journal = {Quantum Inf. Process.},
volume = {6},
number = {6},
pages = {445--459},
year = {2007},
url = {https://doi.org/10.1007/s11128-007-0068-z},
doi = {10.1007/S11128-007-0068-Z},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qip/RapaportT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AharonovT07,
author = {Dorit Aharonov and
Amnon Ta{-}Shma},
title = {Adiabatic Quantum State Generation},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {1},
pages = {47--82},
year = {2007},
url = {https://doi.org/10.1137/060648829},
doi = {10.1137/060648829},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AharonovT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/KlauckNTZ07,
author = {Hartmut Klauck and
Ashwin Nayak and
Amnon Ta{-}Shma and
David Zuckerman},
title = {Interaction in Quantum Communication},
journal = {{IEEE} Trans. Inf. Theory},
volume = {53},
number = {6},
pages = {1970--1982},
year = {2007},
url = {https://doi.org/10.1109/TIT.2007.896888},
doi = {10.1109/TIT.2007.896888},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/KlauckNTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HavivRT07,
author = {Ishay Haviv and
Oded Regev and
Amnon Ta{-}Shma},
title = {On the Hardness of Satisfiability with Bounded Occurrences in the
Polynomial-Time Hierarchy},
journal = {Theory Comput.},
volume = {3},
number = {1},
pages = {45--60},
year = {2007},
url = {https://doi.org/10.4086/toc.2007.v003a003},
doi = {10.4086/TOC.2007.V003A003},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HavivRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GutfreundT07,
author = {Dan Gutfreund and
Amnon Ta{-}Shma},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Worst-Case to Average-Case Reductions Revisited},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {569--583},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_41},
doi = {10.1007/978-3-540-74208-1\_41},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/GutfreundT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Ta-ShmaZ07,
author = {Amnon Ta{-}Shma and
Uri Zwick},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Deterministic rendezvous, treasure hunts and strongly universal exploration
sequences},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {599--608},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283448},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/Ta-ShmaZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uss/RivaT07,
author = {Ben Riva and
Amnon Ta{-}Shma},
editor = {Ray Martinez and
David A. Wagner},
title = {Bare-Handed Electronic Voting with Pre-processing},
booktitle = {2007 {USENIX/ACCURATE} Electronic Voting Technology Workshop, EVT'07,
Boston, MA, USA, August 6, 2007},
publisher = {{USENIX} Association},
year = {2007},
url = {https://www.usenix.org/conference/evt-07/bare-handed-electronic-voting-pre-processing},
timestamp = {Mon, 01 Feb 2021 08:42:55 +0100},
biburl = {https://dblp.org/rec/conf/uss/RivaT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Ta-ShmaZS06,
author = {Amnon Ta{-}Shma and
David Zuckerman and
Shmuel Safra},
title = {Extractors from Reed-Muller codes},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {5},
pages = {786--812},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.05.010},
doi = {10.1016/J.JCSS.2005.05.010},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Ta-ShmaZS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RomT06,
author = {Eran Rom and
Amnon Ta{-}Shma},
title = {Improving the Alphabet-Size in Expander-Based Code Constructions},
journal = {{IEEE} Trans. Inf. Theory},
volume = {52},
number = {8},
pages = {3695--3700},
year = {2006},
url = {https://doi.org/10.1109/TIT.2006.878166},
doi = {10.1109/TIT.2006.878166},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/RomT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ta-ShmaU06,
author = {Amnon Ta{-}Shma and
Christopher Umans},
title = {Better lossless condensers through derandomized curve samplers},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {177--186},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.18},
doi = {10.1109/FOCS.2006.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ta-ShmaU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GutfreundT06,
author = {Dan Gutfreund and
Amnon Ta{-}Shma},
title = {New connections between derandomization, worst-case complexity and
average-case complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-108}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-108/index.html},
eprinttype = {ECCC},
eprint = {TR06-108},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GutfreundT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GradwohlKRT05,
author = {Ronen Gradwohl and
Guy Kindler and
Omer Reingold and
Amnon Ta{-}Shma},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {On the Error Parameter of Dispersers},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {294--305},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_25},
doi = {10.1007/11538462\_25},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GradwohlKRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GutfreundST05,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {If {NP} Languages are Hard on the Worst-Case Then It is Easy to Find
Their Hard Instances},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {243--257},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.11},
doi = {10.1109/CCC.2005.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GutfreundST05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RomT05,
author = {Eran Rom and
Amnon Ta{-}Shma},
editor = {Volker Diekert and
Bruno Durand},
title = {Improving the Alphabet-Size in High Noise, Almost Optimal Rate List
Decodable Codes},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {557--568},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_46},
doi = {10.1007/978-3-540-31856-9\_46},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/RomT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-061,
author = {Ronen Gradwohl and
Guy Kindler and
Omer Reingold and
Amnon Ta{-}Shma},
title = {On the Error Parameter of Dispersers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-061}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-061/index.html},
eprinttype = {ECCC},
eprint = {TR05-061},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Ta-ShmaZ04,
author = {Amnon Ta{-}Shma and
David Zuckerman},
title = {Extractor codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {50},
number = {12},
pages = {3015--3025},
year = {2004},
url = {https://doi.org/10.1109/TIT.2004.838377},
doi = {10.1109/TIT.2004.838377},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Ta-ShmaZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/MoranST04,
author = {Tal Moran and
Ronen Shaltiel and
Amnon Ta{-}Shma},
editor = {Matthew K. Franklin},
title = {Non-interactive Timestamping in the Bounded Storage Model},
booktitle = {Advances in Cryptology - {CRYPTO} 2004, 24th Annual International
CryptologyConference, Santa Barbara, California, USA, August 15-19,
2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3152},
pages = {460--476},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28628-8\_28},
doi = {10.1007/978-3-540-28628-8\_28},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/MoranST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fc/BermanFT04,
author = {Ron Berman and
Amos Fiat and
Amnon Ta{-}Shma},
editor = {Ari Juels},
title = {Provable Unlinkability against Traffic Analysis},
booktitle = {Financial Cryptography, 8th International Conference, {FC} 2004, Key
West, FL, USA, February 9-12, 2004. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3110},
pages = {266--280},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27809-2\_26},
doi = {10.1007/978-3-540-27809-2\_26},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fc/BermanFT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-069,
author = {Eran Rom and
Amnon Ta{-}Shma},
title = {Improveing the alphabet size in high noise, almost optimal rate list
decodable codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-069}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-069/index.html},
eprinttype = {ECCC},
eprint = {TR04-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GutfreundST03,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {Uniform hardness versus randomness tradeoffs for Arthur-Merlin games},
journal = {Comput. Complex.},
volume = {12},
number = {3-4},
pages = {85--130},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0178-7},
doi = {10.1007/S00037-003-0178-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GutfreundST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HallgrenRT03,
author = {Sean Hallgren and
Alexander Russell and
Amnon Ta{-}Shma},
title = {The Hidden Subgroup Problem and Quantum Computation Using Group Representations},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {4},
pages = {916--934},
year = {2003},
url = {https://doi.org/10.1137/S009753970139450X},
doi = {10.1137/S009753970139450X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HallgrenRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmbainisSTVW03,
author = {Andris Ambainis and
Leonard J. Schulman and
Amnon Ta{-}Shma and
Umesh V. Vazirani and
Avi Wigderson},
title = {The Quantum Communication Complexity of Sampling},
journal = {{SIAM} J. Comput.},
volume = {32},
number = {6},
pages = {1570--1585},
year = {2003},
url = {https://doi.org/10.1137/S009753979935476},
doi = {10.1137/S009753979935476},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AmbainisSTVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gutfreund03,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {33--47},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214408},
doi = {10.1109/CCC.2003.1214408},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gutfreund03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AharonovT03,
author = {Dorit Aharonov and
Amnon Ta{-}Shma},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Adiabatic quantum state generation and statistical zero knowledge},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {20--29},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780546},
doi = {10.1145/780542.780546},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AharonovT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Ta-Shma02,
author = {Amnon Ta{-}Shma},
title = {Almost Optimal Dispersers},
journal = {Comb.},
volume = {22},
number = {1},
pages = {123--145},
year = {2002},
url = {https://doi.org/10.1007/s004930200006},
doi = {10.1007/S004930200006},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Ta-Shma02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ta-Shma02,
author = {Amnon Ta{-}Shma},
title = {Storing information with extractors},
journal = {Inf. Process. Lett.},
volume = {83},
number = {5},
pages = {267--274},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00206-5},
doi = {10.1016/S0020-0190(02)00206-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ta-Shma02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisNTV02,
author = {Andris Ambainis and
Ashwin Nayak and
Amnon Ta{-}Shma and
Umesh V. Vazirani},
title = {Dense quantum coding and quantum finite automata},
journal = {J. {ACM}},
volume = {49},
number = {4},
pages = {496--511},
year = {2002},
url = {https://doi.org/10.1145/581771.581773},
doi = {10.1145/581771.581773},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AmbainisNTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ta-ShmaZS01,
author = {Amnon Ta{-}Shma and
David Zuckerman and
Shmuel Safra},
title = {Extractors from Reed-Muller Codes},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {638--647},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959940},
doi = {10.1109/SFCS.2001.959940},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Ta-ShmaZS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlauckNTZ01,
author = {Hartmut Klauck and
Ashwin Nayak and
Amnon Ta{-}Shma and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Interaction in quantum communication and the complexity of set disjointness},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {124--133},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380786},
doi = {10.1145/380752.380786},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KlauckNTZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-ShmaUZ01,
author = {Amnon Ta{-}Shma and
Christopher Umans and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Loss-less condensers, unbalanced expanders, and extractors},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {143--152},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380790},
doi = {10.1145/380752.380790},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-ShmaUZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-ShmaZ01,
author = {Amnon Ta{-}Shma and
David Zuckerman},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Extractor codes},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {193--199},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380800},
doi = {10.1145/380752.380800},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-ShmaZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-036,
author = {Amnon Ta{-}Shma and
David Zuckerman and
Shmuel Safra},
title = {Extractors from Reed-Muller Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-036}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-036/index.html},
eprinttype = {ECCC},
eprint = {TR01-036},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArmoniTWZ00,
author = {Roy Armoni and
Amnon Ta{-}Shma and
Avi Wigderson and
Shiyu Zhou},
title = {An \emph{O}(log(\emph{n})\({}^{\mbox{4/3}}\)) space algorithm for
(\emph{s, t}) connectivity in undirected graphs},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {294--311},
year = {2000},
url = {https://doi.org/10.1145/333979.333984},
doi = {10.1145/333979.333984},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ArmoniTWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RadhakrishnanT00,
author = {Jaikumar Radhakrishnan and
Amnon Ta{-}Shma},
title = {Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {1},
pages = {2--24},
year = {2000},
url = {https://doi.org/10.1137/S0895480197329508},
doi = {10.1137/S0895480197329508},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RadhakrishnanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fc/SanderTY00,
author = {Tomas Sander and
Amnon Ta{-}Shma and
Moti Yung},
editor = {Yair Frankel},
title = {Blind, Auditable Membership Proofs},
booktitle = {Financial Cryptography, 4th International Conference, {FC} 2000 Anguilla,
British West Indies, February 20-24, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1962},
pages = {53--71},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45472-1\_5},
doi = {10.1007/3-540-45472-1\_5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fc/SanderTY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HallgrenRT00,
author = {Sean Hallgren and
Alexander Russell and
Amnon Ta{-}Shma},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Normal subgroup reconstruction and quantum computation using group
representations},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {627--635},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335392},
doi = {10.1145/335305.335392},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HallgrenRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AharonovTVY00,
author = {Dorit Aharonov and
Amnon Ta{-}Shma and
Umesh V. Vazirani and
Andrew Chi{-}Chih Yao},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Quantum bit escrow},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {705--714},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335404},
doi = {10.1145/335305.335404},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AharonovTVY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0005106,
author = {Ashwin Nayak and
Amnon Ta{-}Shma and
David Zuckerman},
title = {Interaction in Quantum Communication Complexity},
journal = {CoRR},
volume = {quant-ph/0005106},
year = {2000},
url = {http://arxiv.org/abs/quant-ph/0005106},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0005106.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/NisanT99,
author = {Noam Nisan and
Amnon Ta{-}Shma},
title = {Extracting Randomness: {A} Survey and New Constructions},
journal = {J. Comput. Syst. Sci.},
volume = {58},
number = {1},
pages = {148--173},
year = {1999},
url = {https://doi.org/10.1006/jcss.1997.1546},
doi = {10.1006/JCSS.1997.1546},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/NisanT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Ta-Shma99,
author = {Amnon Ta{-}Shma},
title = {Classical versus quantum communication complexity},
journal = {{SIGACT} News},
volume = {30},
number = {3},
pages = {25--34},
year = {1999},
url = {https://doi.org/10.1145/333623.333628},
doi = {10.1145/333623.333628},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Ta-Shma99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/SanderT99,
author = {Tomas Sander and
Amnon Ta{-}Shma},
editor = {Michael J. Wiener},
title = {Auditable, Anonymous Electronic Cash Extended Abstract},
booktitle = {Advances in Cryptology - {CRYPTO} '99, 19th Annual International Cryptology
Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1666},
pages = {555--572},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48405-1\_35},
doi = {10.1007/3-540-48405-1\_35},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crypto/SanderT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fc/SanderT99,
author = {Tomas Sander and
Amnon Ta{-}Shma},
editor = {Matthew K. Franklin},
title = {Flow Control: {A} New Approach for Anonymity Control in Electronic
Cash Systems},
booktitle = {Financial Cryptography, Third International Conference, FC'99, Anguilla,
British West Indies, February 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1648},
pages = {46--61},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48390-X\_4},
doi = {10.1007/3-540-48390-X\_4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fc/SanderT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isw/SanderT99,
author = {Tomas Sander and
Amnon Ta{-}Shma},
editor = {Masahiro Mambo and
Yuliang Zheng},
title = {On Anonymous Electronic Cash and Crime},
booktitle = {Information Security, Second International Workshop, ISW'99, Kuala
Lumpur, Malaysia, November 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1729},
pages = {202--206},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-47790-X\_17},
doi = {10.1007/3-540-47790-X\_17},
timestamp = {Thu, 02 Dec 2021 11:46:17 +0100},
biburl = {https://dblp.org/rec/conf/isw/SanderT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisNTV99,
author = {Andris Ambainis and
Ashwin Nayak and
Amnon Ta{-}Shma and
Umesh V. Vazirani},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {376--383},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301347},
doi = {10.1145/301250.301347},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisNTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AmbainisSTVW98,
author = {Andris Ambainis and
Leonard J. Schulman and
Amnon Ta{-}Shma and
Umesh V. Vazirani and
Avi Wigderson},
title = {The Quantum Communication Complexity of Sampling},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {342--351},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743480},
doi = {10.1109/SFCS.1998.743480},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AmbainisSTVW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma98,
author = {Amnon Ta{-}Shma},
editor = {Jeffrey Scott Vitter},
title = {Almost Optimal Dispersers},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {196--202},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276736},
doi = {10.1145/276698.276736},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-9804043,
author = {Andris Ambainis and
Ashwin Nayak and
Amnon Ta{-}Shma and
Umesh V. Vazirani},
title = {Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata},
journal = {CoRR},
volume = {quant-ph/9804043},
year = {1998},
url = {http://arxiv.org/abs/quant-ph/9804043},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-9804043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RadhakrishnanT97,
author = {Jaikumar Radhakrishnan and
Amnon Ta{-}Shma},
title = {Tight Bounds for Depth-two Superconcentrators},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {585--594},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646148},
doi = {10.1109/SFCS.1997.646148},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RadhakrishnanT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArmoniTWZ97,
author = {Roy Armoni and
Amnon Ta{-}Shma and
Avi Wigderson and
Shiyu Zhou},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {{SL} {\textless}= L\({}^{\mbox{4/3}}\)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {230--239},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258593},
doi = {10.1145/258533.258593},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ArmoniTWZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Ta-Shma96,
author = {Amnon Ta{-}Shma},
title = {Refining randomness ({\unicode{1499}}{\unicode{1497}}{\unicode{1510}}{\unicode{1491}}
{\unicode{1500}}{\unicode{1494}}{\unicode{1511}}{\unicode{1511}} {\unicode{1488}}{\unicode{1511}}{\unicode{1512}}{\unicode{1488}}{\unicode{1497}}{\unicode{1493}}{\unicode{1514}}
{\unicode{1490}}{\unicode{1505}}{\unicode{1492}}.)},
school = {Hebrew University of Jerusalem, Israel},
year = {1996},
url = {https://huji-primo.hosted.exlibrisgroup.com/permalink/f/13ns5ae/972HUJI\_ALMA21159343740003701},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Ta-Shma96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Ta-Shma96,
author = {Amnon Ta{-}Shma},
title = {A Note on {PCP} vs. {MIP}},
journal = {Inf. Process. Lett.},
volume = {58},
number = {3},
pages = {135--140},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00043-9},
doi = {10.1016/0020-0190(96)00043-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Ta-Shma96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ta-Shma96,
author = {Amnon Ta{-}Shma},
editor = {Gary L. Miller},
title = {On Extracting Randomness From Weak Random Sources (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {276--285},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237877},
doi = {10.1145/237814.237877},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/NisanT95,
author = {Noam Nisan and
Amnon Ta{-}Shma},
title = {Symmetric Logspace is Closed Under Complement},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {1995},
year = {1995},
url = {http://cjtcs.cs.uchicago.edu/articles/1995/1/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/NisanT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NisanT95,
author = {Noam Nisan and
Amnon Ta{-}Shma},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Symmetric logspace is closed under complement},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {140--146},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225101},
doi = {10.1145/225058.225101},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NisanT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-058,
author = {Amnon Ta{-}Shma},
title = {On Extracting Randomness From Weak Random Sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-058}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-058/index.html},
eprinttype = {ECCC},
eprint = {TR95-058},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-058.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-003,
author = {Noam Nisan and
Amnon Ta{-}Shma},
title = {Symmetric Logspace is Closed Under Complement},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR94-003}},
year = {1994},
url = {https://eccc.weizmann.ac.il/eccc-reports/1994/TR94-003/index.html},
eprinttype = {ECCC},
eprint = {TR94-003},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR94-003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 17:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
