Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christopher Umans
@inproceedings{DBLP:conf/innovations/BlasiakCGPU23,
author = {Jonah Blasiak and
Henry Cohn and
Joshua A. Grochow and
Kevin Pratt and
Chris Umans},
editor = {Yael Tauman Kalai},
title = {Matrix Multiplication via Matrix Groups},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {19:1--19:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.19},
doi = {10.4230/LIPICS.ITCS.2023.19},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BlasiakCGPU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-11104,
author = {Emile Anand and
Chris Umans},
title = {Pseudorandomness of the Sticky Random Walk},
journal = {CoRR},
volume = {abs/2307.11104},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.11104},
doi = {10.48550/ARXIV.2307.11104},
eprinttype = {arXiv},
eprint = {2307.11104},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-11104.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HozaU22,
author = {William M. Hoza and
Chris Umans},
title = {Targeted Pseudorandom Generators, Simulation Advice Generators, and
Derandomizing Logspace},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {2},
pages = {17--281},
year = {2022},
url = {https://doi.org/10.1137/17m1145707},
doi = {10.1137/17M1145707},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HozaU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhargavaGG0U22,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Zeyu Guo and
Mrinal Kumar and
Chris Umans},
title = {Fast Multivariate Multipoint Evaluation Over All Finite Fields},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {221--232},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00028},
doi = {10.1109/FOCS54457.2022.00028},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhargavaGG0U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-03826,
author = {Jonah Blasiak and
Henry Cohn and
Joshua A. Grochow and
Kevin Pratt and
Chris Umans},
title = {Matrix multiplication via matrix groups},
journal = {CoRR},
volume = {abs/2204.03826},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.03826},
doi = {10.48550/ARXIV.2204.03826},
eprinttype = {arXiv},
eprint = {2204.03826},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-03826.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-00342,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Zeyu Guo and
Mrinal Kumar and
Chris Umans},
title = {Fast Multivariate Multipoint Evaluation Over All Finite Fields},
journal = {CoRR},
volume = {abs/2205.00342},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.00342},
doi = {10.48550/ARXIV.2205.00342},
eprinttype = {arXiv},
eprint = {2205.00342},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-00342.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhargavaGG0U22,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Zeyu Guo and
Mrinal Kumar and
Chris Umans},
title = {Fast Multivariate Multipoint Evaluation Over All Finite Fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-063}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/063},
eprinttype = {ECCC},
eprint = {TR22-063},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhargavaGG0U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-02846,
author = {Shuchi Chawla and
Jelani Nelson and
Chris Umans and
David P. Woodruff},
title = {Visions in Theoretical Computer Science: {A} Report on the {TCS} Visioning
Workshop 2020},
journal = {CoRR},
volume = {abs/2107.02846},
year = {2021},
url = {https://arxiv.org/abs/2107.02846},
eprinttype = {arXiv},
eprint = {2107.02846},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-02846.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HsuU20,
author = {Chloe Ching{-}Yun Hsu and
Chris Umans},
title = {A New Algorithm for Fast Generalized DFTs},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {1},
pages = {4:1--4:20},
year = {2020},
url = {https://doi.org/10.1145/3301313},
doi = {10.1145/3301313},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HsuU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Umans19,
author = {Chris Umans},
editor = {David Zuckerman},
title = {Fast Generalized DFTs for all Finite Groups},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {793--805},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00052},
doi = {10.1109/FOCS.2019.00052},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/Umans19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-02536,
author = {Chris Umans},
title = {Fast generalized DFTs for all finite groups},
journal = {CoRR},
volume = {abs/1901.02536},
year = {2019},
url = {http://arxiv.org/abs/1901.02536},
eprinttype = {arXiv},
eprint = {1901.02536},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-02536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HsuU18,
author = {Chloe Ching{-}Yun Hsu and
Chris Umans},
editor = {Artur Czumaj},
title = {A fast generalized {DFT} for finite groups of Lie type},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1047--1059},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.68},
doi = {10.1137/1.9781611975031.68},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/HsuU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BlaserKTU18,
author = {Markus Bl{\"{a}}ser and
Valentine Kabanets and
Jacobo Tor{\'{a}}n and
Christopher Umans},
title = {Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391)},
journal = {Dagstuhl Reports},
volume = {8},
number = {9},
pages = {133--153},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.9.133},
doi = {10.4230/DAGREP.8.9.133},
timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BlaserKTU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HsuU17,
author = {Chloe Ching{-}Yun Hsu and
Chris Umans},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {On Multidimensional and Monotone k-SUM},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {50:1--50:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.50},
doi = {10.4230/LIPICS.MFCS.2017.50},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HsuU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HozaU17,
author = {William M. Hoza and
Chris Umans},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Targeted pseudorandom generators, simulation advice generators, and
derandomizing logspace},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {629--640},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055414},
doi = {10.1145/3055399.3055414},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HozaU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
editor = {Chris Umans},
title = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://ieeexplore.ieee.org/xpl/conhome/8100284/proceeding},
isbn = {978-1-5386-3464-6},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HsuU17,
author = {Chloe Ching{-}Yun Hsu and
Chris Umans},
title = {A fast generalized {DFT} for finite groups of Lie type},
journal = {CoRR},
volume = {abs/1707.00349},
year = {2017},
url = {http://arxiv.org/abs/1707.00349},
eprinttype = {arXiv},
eprint = {1707.00349},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HsuU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-02302,
author = {Jonah Blasiak and
Thomas Church and
Henry Cohn and
Joshua A. Grochow and
Chris Umans},
title = {Which groups are amenable to proving exponent two for matrix multiplication?},
journal = {CoRR},
volume = {abs/1712.02302},
year = {2017},
url = {http://arxiv.org/abs/1712.02302},
eprinttype = {arXiv},
eprint = {1712.02302},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-02302.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GuoNU16,
author = {Zeyu Guo and
Anand Kumar Narayanan and
Chris Umans},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial
Factorization over Finite Fields},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {47:1--47:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.47},
doi = {10.4230/LIPICS.MFCS.2016.47},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GuoNU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/FeffermanU16,
author = {Bill Fefferman and
Christopher Umans},
editor = {Anne Broadbent},
title = {On the Power of Quantum Fourier Sampling},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication
and Cryptography, {TQC} 2016, September 27-29, 2016, Berlin, Germany},
series = {LIPIcs},
volume = {61},
pages = {1:1--1:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.TQC.2016.1},
doi = {10.4230/LIPICS.TQC.2016.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/tqc/FeffermanU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2016,
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-018-7},
isbn = {978-3-95977-018-7},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlasiakCCGU16,
author = {Jonah Blasiak and
Thomas Church and
Henry Cohn and
Joshua A. Grochow and
Chris Umans},
title = {On cap sets and the group-theoretic approach to matrix multiplication},
journal = {CoRR},
volume = {abs/1605.06702},
year = {2016},
url = {http://arxiv.org/abs/1605.06702},
eprinttype = {arXiv},
eprint = {1605.06702},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlasiakCCGU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuoNU16,
author = {Zeyu Guo and
Anand Kumar Narayanan and
Chris Umans},
title = {Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial
Factorization over Finite Fields},
journal = {CoRR},
volume = {abs/1606.04592},
year = {2016},
url = {http://arxiv.org/abs/1606.04592},
eprinttype = {arXiv},
eprint = {1606.04592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuoNU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HozaU16,
author = {William M. Hoza and
Chris Umans},
title = {Targeted Pseudorandom Generators, Simulation Advice Generators, and
Derandomizing Logspace},
journal = {CoRR},
volume = {abs/1610.01199},
year = {2016},
url = {http://arxiv.org/abs/1610.01199},
eprinttype = {arXiv},
eprint = {1610.01199},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HozaU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/KabanetsTTU16,
author = {Valentine Kabanets and
Thomas Thierauf and
Jacobo Tor{\'{a}}n and
Christopher Umans},
title = {Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411)},
journal = {Dagstuhl Reports},
volume = {6},
number = {10},
pages = {13--32},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.10.13},
doi = {10.4230/DAGREP.6.10.13},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/KabanetsTTU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeffermanU15,
author = {Bill Fefferman and
Chris Umans},
title = {The Power of Quantum Fourier Sampling},
journal = {CoRR},
volume = {abs/1507.05592},
year = {2015},
url = {http://arxiv.org/abs/1507.05592},
eprinttype = {arXiv},
eprint = {1507.05592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeffermanU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Umans14,
author = {Christopher Umans},
title = {Special Issue "Conference on Computational Complexity 2013"
Guest editor's foreword},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {147--149},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0088-x},
doi = {10.1007/S00037-014-0088-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Umans14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalKTU14,
author = {Manindra Agrawal and
Valentine Kabanets and
Thomas Thierauf and
Christopher Umans},
title = {Algebra in Computational Complexity (Dagstuhl Seminar 14391)},
journal = {Dagstuhl Reports},
volume = {4},
number = {9},
pages = {85--105},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.9.85},
doi = {10.4230/DAGREP.4.9.85},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalKTU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlonSU13,
author = {Noga Alon and
Amir Shpilka and
Christopher Umans},
title = {On sunflowers and matrix multiplication},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {219--243},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0060-1},
doi = {10.1007/S00037-013-0060-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AlonSU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FeffermanSUV13,
author = {Bill Fefferman and
Ronen Shaltiel and
Christopher Umans and
Emanuele Viola},
title = {On Beating the Hybrid Argument},
journal = {Theory Comput.},
volume = {9},
pages = {809--843},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a026},
doi = {10.4086/TOC.2013.V009A026},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/FeffermanSUV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohnU13,
author = {Henry Cohn and
Christopher Umans},
editor = {Sanjeev Khanna},
title = {Fast matrix multiplication using coherent configurations},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1074--1087},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.77},
doi = {10.1137/1.9781611973105.77},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/CohnU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImmorlicaKMSU12,
author = {Nicole Immorlica and
Jonathan Katz and
Michael Mitzenmacher and
Rocco A. Servedio and
Chris Umans},
title = {Special Section on the Forty-First Annual {ACM} Symposium on Theory
of Computing {(STOC} 2009)},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {6},
pages = {1591--1592},
year = {2012},
url = {https://doi.org/10.1137/120973305},
doi = {10.1137/120973305},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImmorlicaKMSU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AlonSU12,
author = {Noga Alon and
Amir Shpilka and
Christopher Umans},
title = {On Sunflowers and Matrix Multiplication},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {214--223},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.26},
doi = {10.1109/CCC.2012.26},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/AlonSU12.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/innovations/FeffermanSUV12,
author = {Bill Fefferman and
Ronen Shaltiel and
Christopher Umans and
Emanuele Viola},
editor = {Shafi Goldwasser},
title = {On beating the hybrid argument},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {468--483},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090273},
doi = {10.1145/2090236.2090273},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/FeffermanSUV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-6528,
author = {Henry Cohn and
Christopher Umans},
title = {Fast matrix multiplication using coherent configurations},
journal = {CoRR},
volume = {abs/1207.6528},
year = {2012},
url = {http://arxiv.org/abs/1207.6528},
eprinttype = {arXiv},
eprint = {1207.6528},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-6528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalTU12,
author = {Manindra Agrawal and
Thomas Thierauf and
Christopher Umans},
title = {Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl
Seminar 12421)},
journal = {Dagstuhl Reports},
volume = {2},
number = {10},
pages = {60--78},
year = {2012},
url = {https://doi.org/10.4230/DagRep.2.10.60},
doi = {10.4230/DAGREP.2.10.60},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalTU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BuchfuhrerU11,
author = {David Buchfuhrer and
Christopher Umans},
title = {The complexity of Boolean formula minimization},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {1},
pages = {142--153},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.011},
doi = {10.1016/J.JCSS.2010.06.011},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BuchfuhrerU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KedlayaU11,
author = {Kiran S. Kedlaya and
Christopher Umans},
title = {Fast Polynomial Factorization and Modular Composition},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {6},
pages = {1767--1802},
year = {2011},
url = {https://doi.org/10.1137/08073408X},
doi = {10.1137/08073408X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KedlayaU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlonSU11,
author = {Noga Alon and
Amir Shpilka and
Christopher Umans},
title = {On Sunflowers and Matrix Multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-067}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/067},
eprinttype = {ECCC},
eprint = {TR11-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AlonSU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeU10,
author = {James R. Lee and
Christopher Umans},
title = {Special Section On Foundations of Computer Science},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2397},
year = {2010},
url = {https://doi.org/10.1137/SMJCAT000039000006002397000001},
doi = {10.1137/SMJCAT000039000006002397000001},
timestamp = {Mon, 13 Mar 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LeeU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchfuhrerDFKMPSSU10,
author = {David Buchfuhrer and
Shaddin Dughmi and
Hu Fu and
Robert Kleinberg and
Elchanan Mossel and
Christos H. Papadimitriou and
Michael Schapira and
Yaron Singer and
Christopher Umans},
editor = {Moses Charikar},
title = {Inapproximability for VCG-Based Combinatorial Auctions},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {518--536},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.45},
doi = {10.1137/1.9781611973075.45},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BuchfuhrerDFKMPSSU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-0305,
author = {Bill Fefferman and
Christopher Umans},
title = {Pseudorandom generators and the {BQP} vs. {PH} problem},
journal = {CoRR},
volume = {abs/1007.0305},
year = {2010},
url = {http://arxiv.org/abs/1007.0305},
eprinttype = {arXiv},
eprint = {1007.0305},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-0305.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeffermanSUV10,
author = {Bill Fefferman and
Ronen Shaltiel and
Christopher Umans and
Emanuele Viola},
title = {On beating the hybrid argument},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-186}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/186},
eprinttype = {ECCC},
eprint = {TR10-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeffermanSUV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Umans09,
author = {Christopher Umans},
title = {Reconstructive Dispersers and Hitting Set Generators},
journal = {Algorithmica},
volume = {55},
number = {1},
pages = {134--156},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9266-z},
doi = {10.1007/S00453-008-9266-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Umans09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiUV09,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced expanders and randomness extractors from Parvaresh-Vardy
codes},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {20:1--20:34},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538904},
doi = {10.1145/1538902.1538904},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ShaltielU09,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Low-End Uniform Hardness versus Randomness Tradeoffs for {AM}},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {3},
pages = {1006--1037},
year = {2009},
url = {https://doi.org/10.1137/070698348},
doi = {10.1137/070698348},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ShaltielU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AsodiU09,
author = {Vera Asodi and
Christopher Umans},
title = {The complexity of the matroid-greedoid partition problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {859--866},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.019},
doi = {10.1016/J.TCS.2008.11.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AsodiU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KalyanaramanU09,
author = {Shankar Kalyanaraman and
Christopher Umans},
title = {The Complexity of Rationalizing Network Formation},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {485--494},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.48},
doi = {10.1109/FOCS.2009.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KalyanaramanU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/portals/09421/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {09421 Abstracts Collection - Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2418/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09a,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {09421 Executive Summary - Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2410/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BuchfuhrerU09,
author = {David Buchfuhrer and
Christopher Umans},
title = {Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-068}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/068},
eprinttype = {ECCC},
eprint = {TR09-068},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BuchfuhrerU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DickU09,
author = {Kevin Dick and
Christopher Umans},
title = {Improved inapproximability factors for some Sigma\({}_{\mbox{2}}\)\({}^{\mbox{p}}\)
minimization problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-107}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/107},
eprinttype = {ECCC},
eprint = {TR09-107},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DickU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalyanaramanU09,
author = {Shankar Kalyanaraman and
Christopher Umans},
title = {The Complexity of Rationalizing Network Formation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-145}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/145},
eprinttype = {ECCC},
eprint = {TR09-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalyanaramanU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FortnowIKU08,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {353--376},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0252-2},
doi = {10.1007/S00037-008-0252-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FortnowIKU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KedlayaU08,
author = {Kiran S. Kedlaya and
Christopher Umans},
title = {Fast Modular Composition in any Characteristic},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {146--155},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.13},
doi = {10.1109/FOCS.2008.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KedlayaU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuchfuhrerU08,
author = {David Buchfuhrer and
Christopher Umans},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {The Complexity of Boolean Formula Minimization},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {24--35},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_3},
doi = {10.1007/978-3-540-70575-8\_3},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BuchfuhrerU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KalyanaramanU08,
author = {Shankar Kalyanaraman and
Christopher Umans},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {The Complexity of Rationalizing Matchings},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {171--182},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_18},
doi = {10.1007/978-3-540-92182-0\_18},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/KalyanaramanU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Umans08,
author = {Christopher Umans},
editor = {Cynthia Dwork},
title = {Fast polynomial factorization and modular composition in small characteristic},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {481--490},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374445},
doi = {10.1145/1374376.1374445},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Umans08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/KedlayaU08,
author = {Kiran S. Kedlaya and
Christopher Umans},
editor = {Peter Bro Miltersen and
R{\"{u}}diger Reischuk and
Georg Schnitger and
Dieter van Melkebeek},
title = {Fast polynomial factorization and modular composition},
booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08381},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1777/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/KedlayaU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalyanaramanU08,
author = {Shankar Kalyanaraman and
Christopher Umans},
title = {The Complexity of Rationalizing Matchings},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-021}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-021/index.html},
eprinttype = {ECCC},
eprint = {TR08-021},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalyanaramanU08.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}
}
@inproceedings{DBLP:conf/coco/GuruswamiUV07,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy
Codes},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {96--108},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.38},
doi = {10.1109/CCC.2007.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiUV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KalyanaramanU07,
author = {Shankar Kalyanaraman and
Christopher Umans},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {Algorithms for Playing Games with Limited Randomness},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {323--334},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_30},
doi = {10.1007/978-3-540-75520-3\_30},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KalyanaramanU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ShaltielU07,
author = {Ronen Shaltiel and
Christopher Umans},
editor = {David S. Johnson and
Uriel Feige},
title = {Low-end uniform hardness vs. randomness tradeoffs for {AM}},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {430--439},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250854},
doi = {10.1145/1250790.1250854},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ShaltielU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalyanaramanU07,
author = {Shankar Kalyanaraman and
Christopher Umans},
title = {Algorithms for Playing Games with Limited Randomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-059}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-059/index.html},
eprinttype = {ECCC},
eprint = {TR07-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalyanaramanU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ShaltielU07,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Low-end uniform hardness vs. randomness tradeoffs for {AM}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-069}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-069/index.html},
eprinttype = {ECCC},
eprint = {TR07-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ShaltielU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShaltielU06,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Pseudorandomness for Approximate Counting and Sampling},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {298--341},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0218-9},
doi = {10.1007/S00037-007-0218-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ShaltielU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/UmansVS06,
author = {Christopher Umans and
Tiziano Villa and
Alberto L. Sangiovanni{-}Vincentelli},
title = {Complexity of two-level logic minimization},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {25},
number = {7},
pages = {1230--1246},
year = {2006},
url = {https://doi.org/10.1109/TCAD.2005.855944},
doi = {10.1109/TCAD.2005.855944},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/UmansVS06.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}
}
@inproceedings{DBLP:conf/fsttcs/KalyanaramanU06,
author = {Shankar Kalyanaraman and
Christopher Umans},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {On Obtaining Pseudorandomness from Error-Correcting Codes},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {105--116},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_12},
doi = {10.1007/11944836\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KalyanaramanU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/Umans06,
author = {Christopher Umans},
editor = {Barry M. Trager},
title = {Group-theoretic algorithms for matrix multiplication},
booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2006, Genoa, Italy, July 9-12, 2006, Proceedings},
pages = {5},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1145768.1145772},
doi = {10.1145/1145768.1145772},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/issac/Umans06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Umans06,
author = {Christopher Umans},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Optimization Problems in the Polynomial-Time Hierarchy},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {345--355},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_33},
doi = {10.1007/11750321\_33},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Umans06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiUV06,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Extractors and condensers from univariate polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-134}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-134/index.html},
eprinttype = {ECCC},
eprint = {TR06-134},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiUV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KalyanaramanU06,
author = {Shankar Kalyanaraman and
Christopher Umans},
title = {On obtaining pseudorandomness from error-correcting codes.},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-128}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-128/index.html},
eprinttype = {ECCC},
eprint = {TR06-128},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KalyanaramanU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ShaltielU05,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Simple extractors for all min-entropies and a new pseudorandom generator},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {172--216},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059516},
doi = {10.1145/1059513.1059516},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ShaltielU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Umans05,
author = {Christopher Umans},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Reconstructive Dispersers and Hitting Set Generators},
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 = {460--471},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_39},
doi = {10.1007/11538462\_39},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Umans05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ShaltielU05,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Pseudorandomness for Approximate Counting and Sampling},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {212--226},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.26},
doi = {10.1109/CCC.2005.26},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ShaltielU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowIKU05,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {323--332},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.18},
doi = {10.1109/CCC.2005.18},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowIKU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohnKSU05,
author = {Henry Cohn and
Robert D. Kleinberg and
Bal{\'{a}}zs Szegedy and
Christopher Umans},
title = {Group-theoretic Algorithms for Matrix Multiplication},
booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
pages = {379--388},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/SFCS.2005.39},
doi = {10.1109/SFCS.2005.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohnKSU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-001,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the complexity of succinct zero-sum games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-001}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-001/index.html},
eprinttype = {ECCC},
eprint = {TR04-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-086,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Pseudorandomness for Approximate Counting and Sampling},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-086}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-086/index.html},
eprinttype = {ECCC},
eprint = {TR04-086},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-086.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Umans03,
author = {Christopher Umans},
title = {Pseudo-random generators for all hardnesses},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {2},
pages = {419--440},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00046-1},
doi = {10.1016/S0022-0000(03)00046-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Umans03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohnU03,
author = {Henry Cohn and
Christopher Umans},
title = {A Group-Theoretic Approach to Fast Matrix Multiplication},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {438--449},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238217},
doi = {10.1109/SFCS.2003.1238217},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohnU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MosselU02,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the complexity of approximating the {VC} dimension},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {660--671},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00022-3},
doi = {10.1016/S0022-0000(02)00022-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MosselU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Umans02,
author = {Christopher Umans},
title = {Pseudo-Random Generators for All Hardnesses},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {11},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004326},
doi = {10.1109/CCC.2002.1004326},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Umans02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Umans02,
author = {Christopher Umans},
editor = {John H. Reif},
title = {Pseudo-random generators for all hardnesses},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {627--634},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509997},
doi = {10.1145/509907.509997},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Umans02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Umans01,
author = {Christopher Umans},
title = {The Minimum Equivalent {DNF} Problem and Shortest Implicants},
journal = {J. Comput. Syst. Sci.},
volume = {63},
number = {4},
pages = {597--611},
year = {2001},
url = {https://doi.org/10.1006/jcss.2001.1775},
doi = {10.1006/JCSS.2001.1775},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Umans01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MosselU01,
author = {Elchanan Mossel and
Christopher Umans},
title = {On the Complexity of Approximating the {VC} Dimension},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {220--225},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933889},
doi = {10.1109/CCC.2001.933889},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/MosselU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShaltielU01,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {648--657},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959941},
doi = {10.1109/SFCS.2001.959941},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ShaltielU01.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/focs/Umans99,
author = {Christopher Umans},
title = {Hardness of Approximating Sigma\({}_{\mbox{2}}\)\({}^{\mbox{p}}\)
Minimization Problems},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {465--474},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814619},
doi = {10.1109/SFFCS.1999.814619},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Umans99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Umans99,
author = {Christopher Umans},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {On the Complexity and Inapproximability of Shortest Implicant Problems},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {687--696},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_65},
doi = {10.1007/3-540-48523-6\_65},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Umans99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Umans98,
author = {Christopher Umans},
title = {The Minimum Equivalent {DNF} Problem and Shortest Implicants},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {556--563},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743506},
doi = {10.1109/SFCS.1998.743506},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Umans98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/miccai/GollandKUHSR98,
author = {Polina Golland and
Ron Kikinis and
Christopher Umans and
Michael Halle and
Martha Elizabeth Shenton and
Jens A. Richolt},
editor = {William M. Wells III and
Alan C. F. Colchester and
Scott L. Delp},
title = {AnatomyBrowser: {A} Framework for Integration of Medical Information},
booktitle = {Medical Image Computing and Computer-Assisted Intervention - MICCAI'98,
First International Conference, Cambridge, MA, USA, October 11-13,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1496},
pages = {720--731},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0056259},
doi = {10.1007/BFB0056259},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/miccai/GollandKUHSR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/UmansL97,
author = {Christopher Umans and
William J. Lenhart},
title = {Hamiltonian Cycles in Solid Grid Graphs},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {496--505},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646138},
doi = {10.1109/SFCS.1997.646138},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/UmansL97.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-25 05:47 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:
