Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Benjamin Rossman
Observed names:
B. Rossman,
BENJAMIN ROSSMAN,
Benjamin Rossman D,
Rossman Benjamin (-mit-cs,
Rossman, Benjamin
Institution:
Duke University
Observed institutions:
Tokyo Institute of Technology,
Microsoft (United States),
Duke University,
National Institute of Informatics,
University of Toronto,
University of Cambridge,
MIT Computer Science and Artificial Intelligence Laboratory,
Massachusetts Institute of Technology
show all 8
ORCID:
0009-0001-0247-5208
Observed ORCID:
0009-0001-0247-5208
OpenAlex ID:
A5007686466
An optimal decomposition algorithm for tree edit distance
2009
·
Erik D. Demaine
, Shay Mozes
, et al.
·
ACM Transactions on Algorithms
·
205
PDF
Homomorphism preservation theorems
2008
·
Benjamin Rossman
·
Journal of the ACM
·
129
Semantic essence of AsmL
2005
·
Yuri Gurevich
, Benjamin Rossman
, et al.
·
Theoretical Computer Science
·
120
PDF
An Optimal Decomposition Algorithm for Tree Edit Distance
2007
·
Erik D. Demaine
, Shay Mozes
, et al.
·
Lecture notes in computer science
·
99
On the constant-depth complexity of k-clique
2008
·
Benjamin Rossman
·
80
Exponential Lower Bounds for Monotone Span Programs
2016
·
Robert Robere
, Toniann Pitassi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
67
Existential Positive Types and Preservation under Homomorphisisms
2006
·
B. Rossman
·
Proceedings - Symposium on Logic in Computer Science
·
62
The Monotone Complexity of $k$-Clique on Random Graphs
2014
·
Benjamin Rossman
·
SIAM Journal on Computing
·
39
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
2015
·
Benjamin Rossman
, Rocco A. Servedio
, et al.
·
Annual Symposium on Foundations of Computer Science
·
38
PDF
Average-case complexity of detecting cliques
2010
·
Madhu Sudan
, Benjamin Rossman
·
33
Interactive small-step algorithms II: Abstract state machines and the characterization theorem
2006
·
Andreas Blass
, Yuri Gurevich
, et al.
·
31
The homomorphism domination exponent
2011
·
Swastik Kopparty
, Benjamin Rossman
·
European Journal of Combinatorics
·
30
PDF
Interactive Small-Step Algorithms I: Axiomatization
2007
·
Andreas Blass
, Yuri Gurevich
, et al.
·
Logical Methods in Computer Science
·
29
PDF
Choiceless polynomial time, counting and the Cai–Fürer–Immerman graphs
2008
·
Anuj Dawar
, David Richerby
, et al.
·
Annals of Pure and Applied Logic
·
23
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
2017
·
Johan Håstad
, Benjamin Rossman
, et al.
·
Journal of the ACM
·
21
The Monotone Complexity of k-clique on Random Graphs
2010
·
Benjamin Rossman
·
Annual Symposium on Foundations of Computer Science
·
21
Poly-logarithmic Frege depth lower bounds via an expander switching lemma
2016
·
Toniann Pitassi
, Benjamin Rossman
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
19
On the $AC^0$ Complexity of Subgraph Isomorphism
2017
·
Yuan Li
, Alexander Razborov
, et al.
·
SIAM Journal on Computing
·
17
Successor-invariant first-order logic on finite structures
2007
·
Benjamin Rossman
·
Journal of Symbolic Logic
·
17
Semantic Essence of AsmL: Extended Abstract
2004
·
Yuri Gurevich
, Benjamin Rossman
, et al.
·
Lecture notes in computer science
·
14
Choiceless Computation and Symmetry
2010
·
Benjamin Rossman
·
Lecture notes in computer science
·
13
Successor-invariance in the finite
2003
·
B. Rossman
·
13
Lower Bounds for Subgraph Isomorphism
2019
·
BENJAMIN ROSSMAN
·
International Congress of Mathematicians (ICM)
·
11
General Interactive Small Step Algorithms
2005
·
Andreas Blass
, Yuri Gurevich
, et al.
·
10
The Average Sensitivity of Bounded-Depth Formulas
2015
·
Benjamin Rossman
·
Annual Symposium on Foundations of Computer Science
·
9
Show more works
View as search
Works count:
89
Citation count:
1,278
H-index:
17
I10-index:
24
Year
Topic
Type
