We stand with Ukraine  

Hadi Shafei

Orcid: 0009-0004-1483-6674

Affiliations:
  • Northern Michigan University, USA


According to our database1, Hadi Shafei authored at least 7 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Random Permutations in Computational Complexity.
[BibTeX]
[DOI]
John M. Hitchcock
,
Adewale Sekoni
,
Hadi Shafei
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Counting Martingales for Measure and Dimension in Complexity Classes.
[BibTeX]
[DOI]
John M. Hitchcock
,
Adewale Sekoni
,
Hadi Shafei
Proceedings of the 40th Computational Complexity Conference, 2025

2019
Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin.
[BibTeX]
[DOI]
Hadi Shafei
SIGACT News, 2019

2018
Polynomial-Time Random Oracles and Separating Complexity Classes.
[BibTeX]
[DOI]
John M. Hitchcock
,
Adewale Sekoni
,
Hadi Shafei
Electron. Colloquium Comput. Complex., 2018

Autoreducibility of NP-Complete Sets under Strong Hypotheses.
[BibTeX]
[DOI]
John M. Hitchcock
,
Hadi Shafei
Comput. Complex., 2018

Nonuniform Reductions and NP-Completeness.
[BibTeX]
[DOI]
John M. Hitchcock
,
Hadi Shafei
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2016
Autoreducibility of NP-Complete Sets.
[BibTeX]
[DOI]
John M. Hitchcock
,
Hadi Shafei
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016


  Loading...