Farzan Byramji

Orcid: 0000-0001-6154-0463

According to our database1, Farzan Byramji authored at least 9 papers between 2024 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Hard-to-Sample Distributions from Robust Extractors.
Electron. Colloquium Comput. Complex., 2026

On the Advantage of Adaptivity for Sampling with Cell Probes.
Electron. Colloquium Comput. Complex., 2026

Quantum-Classical Equivalence for AND-Functions.
Electron. Colloquium Comput. Complex., 2026

Lower Bounds for Near-Quadratic-Depth Resolution over Parities.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Lower Bounds for Bit Pigeonhole Principles in Bounded-Depth Resolution over Parities.
CoRR, November, 2025

Lower bounds for the Bit Pigeonhole Principle in Bounded-Depth Resolution over Parities.
Electron. Colloquium Comput. Complex., 2025

Lifting to Randomized Parity Decision Trees.
Proceedings of the Approximation, 2025

2024
Query complexity of Boolean functions on slices.
Discret. Math., 2024

Relations Between Monotone Complexity Measures Based on Decision Tree Complexity.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024


  Loading...