Analysis of EEG signals during micro-sleeps. - Pavel Hrubes; Josef Faber; Mirko Novák (SMC (4), 2004)

A lower bound for intuitionistic logic. - Pavel Hrubes (Ann. Pure Appl. Log., 2007)

Theories very close to PA where Kreisel's Conjecture is false. - Pavel Hrubes (J. Symb. Log., 2007)

Lower bounds for modal logics. - Pavel Hrubes (J. Symb. Log., 2007)

The Proof Complexity of Polynomial Identities. - Pavel Hrubes; Iddo Tzameret (CCC, 2009)

Emission load estimation and modeling in relation to the real input traffic data. - Pavel Hrubes; Premysl Derbek (EATIS, 2009)

On lengths of proofs in non-classical logics. - Pavel Hrubes (Ann. Pure Appl. Log., 2009)

Monotone separations for constant degree polynomials. - Pavel Hrubes; Amir Yehudayoff (Inf. Process. Lett., 2009)

Kreisel's Conjecture with minimality principle. - Pavel Hrubes (J. Symb. Log., 2009)

Non-commutative circuits and the sum-of-squares problem. - Pavel Hrubes; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

Relationless completeness and separations. - Pavel Hrubes; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

On convex complexity measures. - Pavel Hrubes; Stasys Jukna; Alexander S. Kulikov; Pavel Pudlák (Theor. Comput. Sci., 2010)

Homogeneous Formulas and Symmetric Polynomials. - Pavel Hrubes; Amir Yehudayoff (Comput. Complex., 2011)

How much commutativity is needed to prove polynomial identities? - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2011)

Arithmetic Complexity in Ring Extensions. - Pavel Hrubes; Amir Yehudayoff (Theory Comput., 2011)

A note on the real $ tau$-conjecture and the distribution of roots. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2012)

Formulas are exponentially stronger than monotone circuits in non-commutative setting. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2012)

Timed Sets, Functional Complexity, and Computability. - J. Robin B. Cockett; Joaquín Díaz-Boïls; Jonathan Gallagher; Pavel Hrubes (MFPS, 2012)

On the nonnegative rank of distance matrices. - Pavel Hrubes (Inf. Process. Lett., 2012)

A note on semantic cutting planes. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2013)

On the Real τ-Conjecture and the Distribution of Complex Roots. - Pavel Hrubes (Theory Comput., 2013)

Circuits with Medium Fan-In. - Pavel Hrubes; Anup Rao 001 (Electron. Colloquium Comput. Complex., 2014)

Total Maps of Turing Categories. - J. Robin B. Cockett; Pieter J. W. Hofstra; Pavel Hrubes (MFPS, 2014)

Dopravní nehoda, systémový model a shluková analýza v prostředí GIS. - Veronika Vlcková; Pavel Hrubes (Acta Informatica Pragensia, 2015)

On hardness of multilinearization, and VNP completeness in characteristics two. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2015)

On isoperimetric profiles and computational complexity. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2015)

Short Proofs for the Determinant Identities. - Pavel Hrubes; Iddo Tzameret (SIAM J. Comput., 2015)

Non-Commutative Arithmetic Circuits with Division. - Pavel Hrubes; Avi Wigderson (Theory Comput., 2015)

Semantic Versus Syntactic Cutting Planes. - Yuval Filmus; Pavel Hrubes; Massimo Lauria (STACS, 2016)

On Hardness of Multilinearization and VNP-Completeness in Characteristic 2. - Pavel Hrubes (ACM Trans. Comput. Theory, 2016)

A learning problem that is independent of the set theory ZFC axioms. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (CoRR, 2017)

Random formulas, monotone circuits, and interpolation. - Pavel Hrubes; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2017)

On Families of Anticommuting Matrices. - Pavel Hrubes (FLAP, 2017)

A note on monotone real circuits. - Pavel Hrubes; Pavel Pudlák (Inf. Process. Lett., 2018)

On $ epsilon$-sensitive monotone computations. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2019)

On the complexity of computing a random Boolean function over the reals. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2019)

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. - Pavel Hrubes; Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2019)

Learnability can be undecidable. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (Nat. Mach. Intell., 2019)

Author Correction: Learnability can be undecidable. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (Nat. Mach. Intell., 2019)

On ε-sensitive monotone computations. - Pavel Hrubes (Comput. Complex., 2020)

Shadows of Newton polytopes. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

On the distribution of runners on a circle. - Pavel Hrubes (Eur. J. Comb., 2020)

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. - Zuzana Purkrabkova; Pavel Hrubes (ICIT, 2021)

Learnability can be independent of set theory (invited paper). - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (STOC, 2021)

New Lower Bounds against Homogeneous Non-Commutative Circuits. - Prerona Chatterjee; Pavel Hrubes (Electron. Colloquium Comput. Complex., 2023)

On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube. - Pavel Hrubes; Navid Talebanfard (Discret. Comput. Geom., 2023)

A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas. - Pavel Hrubes (CCC, 2024)

Hard submatrices for non-negative rank and communication complexity \

A subquadratic upper bound on sum-of-squares compostion formulas. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2024)

A subquadratic upper bound on Hurwitz's problem and related non-commutative polynomials. - Pavel Hrubes (Electron. Colloquium Comput. Complex., 2024)

On read-k projections of the determinant. - Pavel Hrubes; Pushkar S. Joglekar (Electron. Colloquium Comput. Complex., 2024)

On Read-k Projections of the Determinant. - Pavel Hrubes; Pushkar S. Joglekar (STACS, 2025)