Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pavel Hrubes
@article{DBLP:journals/eccc/Hrubes24,
author = {Pavel Hrubes},
title = {Hard submatrices for non-negative rank and communication complexity
\}},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--008},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/008},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes24a,
author = {Pavel Hrubes},
title = {A subquadratic upper bound on sum-of-squares compostion formulas},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--026},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/026},
timestamp = {Tue, 05 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes24a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/HrubesT23,
author = {Pavel Hrubes and
Navid Talebanfard},
title = {On the Extension Complexity of Polytopes Separating Subsets of the
Boolean Cube},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {1},
pages = {268--278},
year = {2023},
url = {https://doi.org/10.1007/s00454-022-00419-3},
doi = {10.1007/S00454-022-00419-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/HrubesT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChatterjeeH23,
author = {Prerona Chatterjee and
Pavel Hrubes},
editor = {Amnon Ta{-}Shma},
title = {New Lower Bounds Against Homogeneous Non-Commutative Circuits},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {13:1--13:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.13},
doi = {10.4230/LIPICS.CCC.2023.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/ChatterjeeH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-01676,
author = {Prerona Chatterjee and
Pavel Hrubes},
title = {New Lower Bounds against Homogeneous Non-Commutative Circuits},
journal = {CoRR},
volume = {abs/2301.01676},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.01676},
doi = {10.48550/ARXIV.2301.01676},
eprinttype = {arXiv},
eprint = {2301.01676},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-01676.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChatterjeeH23,
author = {Prerona Chatterjee and
Pavel Hrubes},
title = {New Lower Bounds against Homogeneous Non-Commutative Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-001}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/001},
eprinttype = {ECCC},
eprint = {TR23-001},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/ChatterjeeH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesY21,
author = {Pavel Hrubes and
Amir Yehudayoff},
editor = {Valentine Kabanets},
title = {Shadows of Newton Polytopes},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {9:1--9:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.9},
doi = {10.4230/LIPICS.CCC.2021.9},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icit/PurkrabkovaH21,
author = {Zuzana Purkrabkova and
Pavel Hrubes},
title = {The possibility of using floating car data to monitor the occurrence
of accidents: Initial analysis and results to verify whether it is
possible to monitor the occurrence of accidents on the newly accessible
data source},
booktitle = {{ICIT} 2021: IoT and Smart City, Guangzhou, China, December 22 - 25,
2021},
pages = {417--422},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3512576.3512650},
doi = {10.1145/3512576.3512650},
timestamp = {Thu, 14 Apr 2022 14:07:57 +0200},
biburl = {https://dblp.org/rec/conf/icit/PurkrabkovaH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-DavidHMSY21,
author = {Shai Ben{-}David and
Pavel Hrubes and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Learnability can be independent of set theory (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {11},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465360},
doi = {10.1145/3406325.3465360},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-DavidHMSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-11996,
author = {Pavel Hrubes and
Navid Talebanfard},
title = {On the extension complexity of polytopes separating subsets of the
Boolean cube},
journal = {CoRR},
volume = {abs/2105.11996},
year = {2021},
url = {https://arxiv.org/abs/2105.11996},
eprinttype = {arXiv},
eprint = {2105.11996},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-11996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hrubes20,
author = {Pavel Hrubes},
title = {On {\(\epsilon\)}-sensitive monotone computations},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {6},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00196-6},
doi = {10.1007/S00037-020-00196-6},
timestamp = {Wed, 05 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Hrubes20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Hrubes20,
author = {Pavel Hrubes},
title = {On the distribution of runners on a circle},
journal = {Eur. J. Comb.},
volume = {89},
pages = {103137},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103137},
doi = {10.1016/J.EJC.2020.103137},
timestamp = {Tue, 18 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/Hrubes20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Hrubes20,
author = {Pavel Hrubes},
title = {On the Complexity of Computing a Random Boolean Function Over the
Reals},
journal = {Theory Comput.},
volume = {16},
pages = {1--12},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a009},
doi = {10.4086/TOC.2020.V016A009},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/Hrubes20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesY20,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Shadows of Newton polytopes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-189}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/189},
eprinttype = {ECCC},
eprint = {TR20-189},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/natmi/Ben-DavidHMSY19,
author = {Shai Ben{-}David and
Pavel Hrubes and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
title = {Learnability can be undecidable},
journal = {Nat. Mach. Intell.},
volume = {1},
number = {1},
pages = {44--48},
year = {2019},
url = {https://doi.org/10.1038/s42256-018-0002-3},
doi = {10.1038/S42256-018-0002-3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/natmi/Ben-DavidHMSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/natmi/Ben-DavidHMSY19a,
author = {Shai Ben{-}David and
Pavel Hrubes and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
title = {Author Correction: Learnability can be undecidable},
journal = {Nat. Mach. Intell.},
volume = {1},
number = {2},
pages = {121},
year = {2019},
url = {https://doi.org/10.1038/s42256-019-0023-6},
doi = {10.1038/S42256-019-0023-6},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/natmi/Ben-DavidHMSY19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HrubesRRY19,
author = {Pavel Hrubes and
Sivaramakrishnan Natarajan Ramamoorthy and
Anup Rao and
Amir Yehudayoff},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {72:1--72:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.72},
doi = {10.4230/LIPICS.ICALP.2019.72},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HrubesRRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-02511,
author = {Pavel Hrubes},
title = {On the distribution of runners on a circle},
journal = {CoRR},
volume = {abs/1906.02511},
year = {2019},
url = {http://arxiv.org/abs/1906.02511},
eprinttype = {arXiv},
eprint = {1906.02511},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-02511.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes19,
author = {Pavel Hrubes},
title = {On {\textdollar}{\textbackslash}epsilon{\textdollar}-sensitive monotone
computations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-034}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/034},
eprinttype = {ECCC},
eprint = {TR19-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes19a,
author = {Pavel Hrubes},
title = {On the complexity of computing a random Boolean function over the
reals},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-036}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/036},
eprinttype = {ECCC},
eprint = {TR19-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesRRY19,
author = {Pavel Hrubes and
Sivaramakrishnan Natarajan Ramamoorthy and
Anup Rao and
Amir Yehudayoff},
title = {Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-026}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/026},
eprinttype = {ECCC},
eprint = {TR19-026},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesRRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HrubesP18,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
title = {A note on monotone real circuits},
journal = {Inf. Process. Lett.},
volume = {131},
pages = {15--19},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.11.002},
doi = {10.1016/J.IPL.2017.11.002},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HrubesP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/flap/Hrubes17,
author = {Pavel Hrubes},
title = {On Families of Anticommuting Matrices},
journal = {{FLAP}},
volume = {4},
number = {10},
pages = {3261--3276},
year = {2017},
url = {http://collegepublications.co.uk/ifcolog/?00019},
timestamp = {Fri, 29 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/flap/Hrubes17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HrubesP17,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
editor = {Chris Umans},
title = {Random Formulas, Monotone Circuits, and Interpolation},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {121--131},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.20},
doi = {10.1109/FOCS.2017.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HrubesP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-05195,
author = {Shai Ben{-}David and
Pavel Hrubes and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
title = {A learning problem that is independent of the set theory {ZFC} axioms},
journal = {CoRR},
volume = {abs/1711.05195},
year = {2017},
url = {http://arxiv.org/abs/1711.05195},
eprinttype = {arXiv},
eprint = {1711.05195},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-05195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesP17,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
title = {Random formulas, monotone circuits, and interpolation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-042}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/042},
eprinttype = {ECCC},
eprint = {TR17-042},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesP17a,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
title = {A note on monotone real circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-048}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/048},
eprinttype = {ECCC},
eprint = {TR17-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesP17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/Hrubes16,
author = {Pavel Hrubes},
title = {On Hardness of Multilinearization and VNP-Completeness in Characteristic
2},
journal = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {1},
pages = {1:1--1:14},
year = {2016},
url = {https://doi.org/10.1145/2940323},
doi = {10.1145/2940323},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/Hrubes16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HrubesY16,
author = {Pavel Hrubes and
Amir Yehudayoff},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {On Isoperimetric Profiles and Computational Complexity},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {89:1--89:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.89},
doi = {10.4230/LIPICS.ICALP.2016.89},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HrubesY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FilmusHL16,
author = {Yuval Filmus and
Pavel Hrubes and
Massimo Lauria},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Semantic Versus Syntactic Cutting Planes},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {35:1--35:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.35},
doi = {10.4230/LIPICS.STACS.2016.35},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FilmusHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actaip/VlckovaH15,
author = {Veronika Vlckov{\'{a}} and
Pavel Hrubes},
title = {Dopravn{\'{\i}} nehoda, syst{\'{e}}mov{\'{y}} model
a shlukov{\'{a}} anal{\'{y}}za v prost{\v{r}}ed{\'{\i}}
{GIS}},
journal = {Acta Informatica Pragensia},
volume = {4},
number = {1},
pages = {64--79},
year = {2015},
url = {https://doi.org/10.18267/j.aip.61},
doi = {10.18267/J.AIP.61},
timestamp = {Wed, 15 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaip/VlckovaH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HrubesT15,
author = {Pavel Hrubes and
Iddo Tzameret},
title = {Short Proofs for the Determinant Identities},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {2},
pages = {340--383},
year = {2015},
url = {https://doi.org/10.1137/130917788},
doi = {10.1137/130917788},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HrubesT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HrubesW15,
author = {Pavel Hrubes and
Avi Wigderson},
title = {Non-Commutative Arithmetic Circuits with Division},
journal = {Theory Comput.},
volume = {11},
pages = {357--393},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a014},
doi = {10.4086/TOC.2015.V011A014},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HrubesW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesR15,
author = {Pavel Hrubes and
Anup Rao},
editor = {David Zuckerman},
title = {Circuits with Medium Fan-In},
booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
2015, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {33},
pages = {381--391},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.381},
doi = {10.4230/LIPICS.CCC.2015.381},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes15,
author = {Pavel Hrubes},
title = {On hardness of multilinearization, and {VNP} completeness in characteristics
two},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-067}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/067},
eprinttype = {ECCC},
eprint = {TR15-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesY15,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {On isoperimetric profiles and computational complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-164}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/164},
eprinttype = {ECCC},
eprint = {TR15-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HrubesW14,
author = {Pavel Hrubes and
Avi Wigderson},
editor = {Moni Naor},
title = {Non-commutative arithmetic circuits with division},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {49--66},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554805},
doi = {10.1145/2554797.2554805},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HrubesW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/CockettHH14,
author = {J. Robin B. Cockett and
Pieter J. W. Hofstra and
Pavel Hrubes},
editor = {Bart Jacobs and
Alexandra Silva and
Sam Staton},
title = {Total Maps of Turing Categories},
booktitle = {Proceedings of the 30th Conference on the Mathematical Foundations
of Programming Semantics, {MFPS} 2014, Ithaca, NY, USA, June 12-15,
2014},
series = {Electronic Notes in Theoretical Computer Science},
volume = {308},
pages = {129--146},
publisher = {Elsevier},
year = {2014},
url = {https://doi.org/10.1016/j.entcs.2014.10.008},
doi = {10.1016/J.ENTCS.2014.10.008},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/CockettHH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Hrubes14,
author = {Pavel Hrubes},
title = {On families of anticommuting matrices},
journal = {CoRR},
volume = {abs/1412.5893},
year = {2014},
url = {http://arxiv.org/abs/1412.5893},
eprinttype = {arXiv},
eprint = {1412.5893},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Hrubes14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesR14,
author = {Pavel Hrubes and
Anup Rao},
title = {Circuits with Medium Fan-In},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-020}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/020},
eprinttype = {ECCC},
eprint = {TR14-020},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Hrubes13,
author = {Pavel Hrubes},
title = {On the Real {\(\tau\)}-Conjecture and the Distribution of Complex
Roots},
journal = {Theory Comput.},
volume = {9},
pages = {403--411},
year = {2013},
url = {https://doi.org/10.4086/toc.2013.v009a010},
doi = {10.4086/TOC.2013.V009A010},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Hrubes13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesY13,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative
Setting},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {10--14},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.11},
doi = {10.1109/CCC.2013.11},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes13,
author = {Pavel Hrubes},
title = {A note on semantic cutting planes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-128}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/128},
eprinttype = {ECCC},
eprint = {TR13-128},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Hrubes12,
author = {Pavel Hrubes},
title = {On the nonnegative rank of distance matrices},
journal = {Inf. Process. Lett.},
volume = {112},
number = {11},
pages = {457--461},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.009},
doi = {10.1016/J.IPL.2012.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Hrubes12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HrubesT12,
author = {Pavel Hrubes and
Iddo Tzameret},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Short proofs for the determinant identities},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {193--212},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2213998},
doi = {10.1145/2213977.2213998},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HrubesT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/CockettDGH12,
author = {J. Robin B. Cockett and
Joaqu{\'{\i}}n D{\'{\i}}az{-}Bo{\"{\i}}ls and
Jonathan Gallagher and
Pavel Hrubes},
editor = {Ulrich Berger and
Michael W. Mislove},
title = {Timed Sets, Functional Complexity, and Computability},
booktitle = {Proceedings of the 28th Conference on the Mathematical Foundations
of Programming Semantics, {MFPS} 2012, Bath, UK, June 6-9, 2012},
series = {Electronic Notes in Theoretical Computer Science},
volume = {286},
pages = {117--137},
publisher = {Elsevier},
year = {2012},
url = {https://doi.org/10.1016/j.entcs.2012.08.009},
doi = {10.1016/J.ENTCS.2012.08.009},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/CockettDGH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes12,
author = {Pavel Hrubes},
title = {A note on the real {\textdollar}{\textbackslash}tau{\textdollar}-conjecture
and the distribution of roots},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-121}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/121},
eprinttype = {ECCC},
eprint = {TR12-121},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesY12,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Formulas are exponentially stronger than monotone circuits in non-commutative
setting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-061}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/061},
eprinttype = {ECCC},
eprint = {TR12-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HrubesY11,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Homogeneous Formulas and Symmetric Polynomials},
journal = {Comput. Complex.},
volume = {20},
number = {3},
pages = {559--578},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0007-3},
doi = {10.1007/S00037-011-0007-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HrubesY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HrubesY11,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Arithmetic Complexity in Ring Extensions},
journal = {Theory Comput.},
volume = {7},
number = {1},
pages = {119--129},
year = {2011},
url = {https://doi.org/10.4086/toc.2011.v007a008},
doi = {10.4086/TOC.2011.V007A008},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HrubesY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-6265,
author = {Pavel Hrubes and
Iddo Tzameret},
title = {Short Proofs for the Determinant Identities},
journal = {CoRR},
volume = {abs/1112.6265},
year = {2011},
url = {http://arxiv.org/abs/1112.6265},
eprinttype = {arXiv},
eprint = {1112.6265},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-6265.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Hrubes11,
author = {Pavel Hrubes},
title = {How much commutativity is needed to prove polynomial identities?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-088}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/088},
eprinttype = {ECCC},
eprint = {TR11-088},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Hrubes11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesT11,
author = {Pavel Hrubes and
Iddo Tzameret},
title = {Short Proofs for the Determinant Identities},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-174}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/174},
eprinttype = {ECCC},
eprint = {TR11-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HrubesJKP10,
author = {Pavel Hrubes and
Stasys Jukna and
Alexander S. Kulikov and
Pavel Pudl{\'{a}}k},
title = {On convex complexity measures},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {16-18},
pages = {1842--1854},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.02.004},
doi = {10.1016/J.TCS.2010.02.004},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HrubesJKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesWY10,
author = {Pavel Hrubes and
Avi Wigderson and
Amir Yehudayoff},
title = {Relationless Completeness and Separations},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {280--290},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.34},
doi = {10.1109/CCC.2010.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HrubesWY10,
author = {Pavel Hrubes and
Avi Wigderson and
Amir Yehudayoff},
editor = {Leonard J. Schulman},
title = {Non-commutative circuits and the sum-of-squares problem},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {667--676},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806781},
doi = {10.1145/1806689.1806781},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HrubesWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesWY10,
author = {Pavel Hrubes and
Avi Wigderson and
Amir Yehudayoff},
title = {Non-commutative circuits and the sum-of-squares problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-021}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/021},
eprinttype = {ECCC},
eprint = {TR10-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesWY10a,
author = {Pavel Hrubes and
Avi Wigderson and
Amir Yehudayoff},
title = {Relationless completeness and separations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-040}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/040},
eprinttype = {ECCC},
eprint = {TR10-040},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesWY10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Hrubes09,
author = {Pavel Hrubes},
title = {On lengths of proofs in non-classical logics},
journal = {Ann. Pure Appl. Log.},
volume = {157},
number = {2-3},
pages = {194--205},
year = {2009},
url = {https://doi.org/10.1016/j.apal.2008.09.013},
doi = {10.1016/J.APAL.2008.09.013},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Hrubes09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HrubesY09,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Monotone separations for constant degree polynomials},
journal = {Inf. Process. Lett.},
volume = {110},
number = {1},
pages = {1--3},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.09.003},
doi = {10.1016/J.IPL.2009.09.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HrubesY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hrubes09,
author = {Pavel Hrubes},
title = {Kreisel's Conjecture with minimality principle},
journal = {J. Symb. Log.},
volume = {74},
number = {3},
pages = {976--988},
year = {2009},
url = {https://doi.org/10.2178/jsl/1245158094},
doi = {10.2178/JSL/1245158094},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hrubes09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesT09,
author = {Pavel Hrubes and
Iddo Tzameret},
title = {The Proof Complexity of Polynomial Identities},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {41--51},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.9},
doi = {10.1109/CCC.2009.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HrubesT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eatis/HrubesD09,
author = {Pavel Hrubes and
Premysl Derbek},
editor = {Miroslav Svitek and
Tomas Zelinka},
title = {Emission load estimation and modeling in relation to the real input
traffic data},
booktitle = {Proceedings of the 2009 Euro American conference on Telematics and
Information Systems: New Opportunities to increase Digital Citizenship,
{EATIS} 2009, Prague, Czech Republic, June 3-5, 2009},
pages = {14},
year = {2009},
url = {https://doi.org/10.1145/1551722.1551736},
doi = {10.1145/1551722.1551736},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/eatis/HrubesD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-2621,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Homogeneous formulas and symmetric polynomials},
journal = {CoRR},
volume = {abs/0907.2621},
year = {2009},
url = {http://arxiv.org/abs/0907.2621},
eprinttype = {arXiv},
eprint = {0907.2621},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-2621.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesJKP09,
author = {Pavel Hrubes and
Stasys Jukna and
Alexander S. Kulikov and
Pavel Pudl{\'{a}}k},
title = {On convex complexity measures},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-040}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/040},
eprinttype = {ECCC},
eprint = {TR09-040},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HrubesJKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Hrubes07,
author = {Pavel Hrubes},
title = {A lower bound for intuitionistic logic},
journal = {Ann. Pure Appl. Log.},
volume = {146},
number = {1},
pages = {72--90},
year = {2007},
url = {https://doi.org/10.1016/j.apal.2007.01.001},
doi = {10.1016/J.APAL.2007.01.001},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Hrubes07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hrubes07,
author = {Pavel Hrubes},
title = {Theories very close to \emph{PA} where Kreisel's Conjecture is false},
journal = {J. Symb. Log.},
volume = {72},
number = {1},
pages = {123--137},
year = {2007},
url = {https://doi.org/10.2178/jsl/1174668388},
doi = {10.2178/JSL/1174668388},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hrubes07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Hrubes07a,
author = {Pavel Hrubes},
title = {Lower bounds for modal logics},
journal = {J. Symb. Log.},
volume = {72},
number = {3},
pages = {941--958},
year = {2007},
url = {https://doi.org/10.2178/jsl/1191333849},
doi = {10.2178/JSL/1191333849},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Hrubes07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/smc/HrubesFN04,
author = {Pavel Hrubes and
Josef Faber and
Mirko Nov{\'{a}}k},
title = {Analysis of {EEG} signals during micro-sleeps},
booktitle = {Proceedings of the {IEEE} International Conference on Systems, Man
{\&} Cybernetics: The Hague, Netherlands, 10-13 October 2004},
pages = {3775--3780},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/ICSMC.2004.1400932},
doi = {10.1109/ICSMC.2004.1400932},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/smc/HrubesFN04.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:19 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:
