# Neil Thapen

According to our database

Collaborative distances:

^{1}, Neil Thapen authored at least 37 papers between 2002 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Electron. Colloquium Comput. Complex., 2024

CoRR, 2024

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2022

J. Math. Log., 2022

Electron. Colloquium Comput. Complex., 2022

CoRR, 2022

2021

Log. Methods Comput. Sci., 2021

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2019

Electron. Colloquium Comput. Complex., 2019

Comput., 2019

Comput. Complex., 2019

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Inf. Process. Lett., 2018

2017

Comb., 2017

2016

Theory Comput., 2016

Ann. Pure Appl. Log., 2016

2014

ACM Trans. Comput. Log., 2014

ACM Trans. Comput. Log., 2014

J. Symb. Log., 2014

Electron. Colloquium Comput. Complex., 2014

Electron. Colloquium Comput. Complex., 2014

Electron. Colloquium Comput. Complex., 2014

Ann. Pure Appl. Log., 2014

2012

Electron. Colloquium Comput. Complex., 2012

Ann. Pure Appl. Log., 2012

2011

Ann. Pure Appl. Log., 2011

Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem.

Arch. Math. Log., 2011

2009

Math. Log. Q., 2009

2008

The polynomial and linear hierarchies in models where the weak pigeonhole principle fails.

J. Symb. Log., 2008

2007

J. Symb. Log., 2007

Proceedings of the Computation and Logic in the Real World, 2007

2006

ACM Trans. Comput. Log., 2006

2005

Ann. Pure Appl. Log., 2005

Arch. Math. Log., 2005

2004

Electron. Colloquium Comput. Complex., 2004

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2002

Ann. Pure Appl. Log., 2002