# Benjamin Rossman

Orcid: 0009-0001-0247-5208
According to our database

Collaborative distances:

^{1}, Benjamin Rossman authored at least 50 papers between 2003 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Algorithmica, 2022

2020

Electron. Colloquium Comput. Complex., 2020

Electron. Colloquium Comput. Complex., 2020

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Theory Comput., 2019

Log. Methods Comput. Sci., 2019

CoRR, 2019

Proceedings of the 34th Computational Complexity Conference, 2019

2018

SIAM J. Comput., 2018

CoRR, 2018

Comput. Complex., 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Theory Comput. Syst., 2017

J. ACM, 2017

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

An improved homomorphism preservation theorem from lower bounds in circuit complexity.

ACM SIGLOG News, 2016

Electron. Colloquium Comput. Complex., 2016

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits.

SIGACT News, 2015

Electron. Colloquium Comput. Complex., 2015

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

SIAM J. Comput., 2014

Electron. Colloquium Comput. Complex., 2014

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Electron. Colloquium Comput. Complex., 2013

2012

Electron. Colloquium Comput. Complex., 2012

A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs.

Proceedings of the Logic, Language, Information and Computation, 2012

2011

Eur. J. Comb., 2011

2010

PhD thesis, 2010

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Proceedings of the Fields of Logic and Computation, 2010

2009

ACM Trans. Algorithms, 2009

Proceedings of the Logic, 2009

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

J. ACM, 2008

Ann. Pure Appl. Log., 2008

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2007

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.

Log. Methods Comput. Sci., 2007

Log. Methods Comput. Sci., 2007

J. Symb. Log., 2007

2006

CoRR, 2006

2005

Theor. Comput. Sci., 2005

Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).

Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005

Explicit Graphs with Extension Properties.

Bull. EATCS, 2005

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2003

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003