default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Rossman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Benjamin Rossman
:
Formula Size-Depth Tradeoffs for Iterated Sub-permutation Matrix Multiplication. STOC 2024: 1386-1395- [i29]Benjamin Rossman:
Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication. CoRR abs/2406.16015 (2024) - [i28]Benjamin Rossman:
Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j21]Deepanshu Kush, Benjamin Rossman:
Tree-Depth and the Formula Complexity of Subgraph Isomorphism. SIAM J. Comput. 52(1): 273-325 (2023) - [c29]William He, Benjamin Rossman:
Symmetric Formulas for Products of Permutations. ITCS 2023: 68:1-68:23 - 2022
- [j20]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. Algorithmica 84(12): 3655-3685 (2022) - [i27]William He, Benjamin Rossman:
Symmetric Formulas for Products of Permutations. CoRR abs/2211.15520 (2022) - 2021
- [c28]Benjamin Rossman:
Shrinkage of Decision Lists and DNF Formulas. ITCS 2021: 70:1-70:14 - 2020
- [c27]Deepanshu Kush, Benjamin Rossman:
Tree-depth and the Formula Complexity of Subgraph Isomorphism. FOCS 2020: 31-42 - [c26]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. LATIN 2020: 311-322 - [c25]Benjamin Rossman:
Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$. LATIN 2020: 504-515 - [i26]Deepanshu Kush, Benjamin Rossman:
Tree-depth and the Formula Complexity of Subgraph Isomorphism. CoRR abs/2004.13302 (2020) - [i25]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. CoRR abs/2012.03883 (2020) - [i24]Benjamin Rossman:
Shrinkage of Decision Lists and DNF Formulas. CoRR abs/2012.05132 (2020) - [i23]Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman:
Monotone Circuit Lower Bounds from Robust Sunflowers. Electron. Colloquium Comput. Complex. TR20 (2020) - [i22]Deepanshu Kush, Benjamin Rossman:
Tree-depth and the Formula Complexity of Subgraph Isomorphism. Electron. Colloquium Comput. Complex. TR20 (2020) - [i21]Benjamin Rossman:
Shrinkage of Decision Lists and DNF Formulas. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j19]Benjamin Rossman:
Subspace-Invariant AC00^0 Formulas. Log. Methods Comput. Sci. 15(3) (2019) - [j18]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC0[⊕] Formulas and Circuits. Theory Comput. 15: 1-20 (2019) - [c24]Benjamin Rossman:
Criticality of Regular Formulas. CCC 2019: 1:1-1:28 - [i20]Benjamin Rossman:
Thresholds in the Lattice of Subspaces of (Fq)n. CoRR abs/1910.00656 (2019) - 2018
- [j17]Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. Comput. Complex. 27(2): 209-223 (2018) - [j16]Benjamin Rossman:
Formulas versus Circuits for Small Distance Connectivity. SIAM J. Comput. 47(5): 1986-2028 (2018) - [c23]Ken-ichi Kawarabayashi, Benjamin Rossman:
A Polynomial Excluded-Minor Approximation of Treedepth. SODA 2018: 234-246 - [i19]Benjamin Rossman:
Subspace-Invariant AC0 Formulas. CoRR abs/1806.04831 (2018) - 2017
- [j15]Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An Average-Case Depth Hierarchy Theorem for Boolean Circuits. J. ACM 64(5): 35:1-35:27 (2017) - [j14]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
The Query Complexity of Witness Finding. Theory Comput. Syst. 61(2): 305-321 (2017) - [j13]Yuan Li, Alexander A. Razborov, Benjamin Rossman:
On the AC0 Complexity of Subgraph Isomorphism. SIAM J. Comput. 46(3): 936-971 (2017) - [c22]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC^0[oplus] Formulas and Circuits. ICALP 2017: 50:1-50:13 - [c21]Benjamin Rossman:
Subspace-Invariant AC^0 Formulas. ICALP 2017: 93:1-93:11 - [c20]Benjamin Rossman:
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity. ITCS 2017: 27:1-27:17 - [i18]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC$^0[\oplus]$ Formulas and Circuits. CoRR abs/1702.03625 (2017) - [i17]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC0[⊕] Formulas and Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j12]Benjamin Rossman:
An improved homomorphism preservation theorem from lower bounds in circuit complexity. ACM SIGLOG News 3(4): 33-46 (2016) - [c19]Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook:
Exponential Lower Bounds for Monotone Span Programs. FOCS 2016: 406-415 - [c18]Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
Poly-logarithmic Frege depth lower bounds via an expander switching lemma. STOC 2016: 644-657 - [i16]Benjamin Rossman:
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity. CoRR abs/1612.08192 (2016) - [i15]Stephen A. Cook, Toniann Pitassi, Robert Robere, Benjamin Rossman:
Exponential Lower Bounds for Monotone Span Programs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i14]Benjamin Rossman:
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j11]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits. SIGACT News 46(4): 50-68 (2015) - [c17]Benjamin Rossman:
Correlation Bounds Against Monotone NC^1. CCC 2015: 392-411 - [c16]Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. FOCS 2015: 424-430 - [c15]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An Average-Case Depth Hierarchy Theorem for Boolean Circuits. FOCS 2015: 1030-1048 - [i13]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An average-case depth hierarchy theorem for Boolean circuits. CoRR abs/1504.03398 (2015) - [i12]Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. CoRR abs/1508.07677 (2015) - [i11]Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. Electron. Colloquium Comput. Complex. TR15 (2015) - [i10]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An average-case depth hierarchy theorem for Boolean circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j10]Benjamin Rossman:
The Monotone Complexity of k-Clique on Random Graphs. SIAM J. Comput. 43(1): 256-279 (2014) - [c14]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
The Query Complexity of Witness Finding. CSR 2014: 218-231 - [c13]Yuan Li, Alexander A. Razborov, Benjamin Rossman:
On the AC0 Complexity of Subgraph Isomorphism. FOCS 2014: 344-353 - [c12]Benjamin Rossman:
Formulas vs. circuits for small distance connectivity. STOC 2014: 203-212 - [i9]Yuan Li, Alexander A. Razborov, Benjamin Rossman:
On the AC0 Complexity of Subgraph Isomorphism. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i8]Benjamin Rossman:
Formulas vs. Circuits for Small Distance Connectivity. CoRR abs/1312.0355 (2013) - [i7]Benjamin Rossman:
Formulas vs. Circuits for Small Distance Connectivity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c11]Benjamin Rossman:
A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs. WoLLIC 2012: 282-290 - [i6]Akinori Kawachi, Benjamin Rossman, Osamu Watanabe:
Query Complexity and Error Tolerance of Witness Finding Algorithms. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j9]Swastik Kopparty, Benjamin Rossman:
The homomorphism domination exponent. Eur. J. Comb. 32(7): 1097-1114 (2011) - 2010
- [b1]Benjamin Rossman:
Average-case complexity of detecting cliques. Massachusetts Institute of Technology, Cambridge, MA, USA, 2010 - [c10]Benjamin Rossman:
Choiceless Computation and Symmetry. Fields of Logic and Computation 2010: 565-580 - [c9]Benjamin Rossman:
The Monotone Complexity of k-clique on Random Graphs. FOCS 2010: 193-201 - [e1]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 07.02. - 12.02.2010. Dagstuhl Seminar Proceedings 10061, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i5]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i4]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010
2000 – 2009
- 2009
- [j8]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1): 2:1-2:19 (2009) - [c8]Benjamin Rossman:
Combining Ehrenfeucht-Fraïssé Games. LICS 2009: 331 - [c7]Benjamin Rossman:
Ehrenfeucht-Fraïssé Games on Random Structures. WoLLIC 2009: 350-364 - 2008
- [j7]Anuj Dawar, David Richerby, Benjamin Rossman:
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Log. 152(1-3): 31-50 (2008) - [j6]Benjamin Rossman:
Homomorphism preservation theorems. J. ACM 55(3): 15:1-15:53 (2008) - [c6]Benjamin Rossman:
On the constant-depth complexity of k-clique. STOC 2008: 721-730 - 2007
- [j5]Benjamin Rossman:
Successor-invariant first-order logic on finite structures. J. Symb. Log. 72(2): 601-618 (2007) - [j4]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. 3(4) (2007) - [j3]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Log. Methods Comput. Sci. 3(4) (2007) - [c5]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157 - [i3]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007) - [i2]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007) - 2006
- [i1]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006) - 2005
- [j2]Andreas Blass, Benjamin Rossman:
Explicit Graphs with Extension Properties. Bull. EATCS 86: 166-175 (2005) - [j1]Yuri Gurevich, Benjamin Rossman, Wolfram Schulte:
Semantic essence of AsmL. Theor. Comput. Sci. 343(3): 370-412 (2005) - [c4]Benjamin Rossman:
Existential Positive Types and Preservation under Homomorphisisms. LICS 2005: 467-476 - [c3]Anuj Dawar, David Richerby, Benjamin Rossman:
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). WoLLIC 2005: 13-26 - 2003
- [c2]Yuri Gurevich, Benjamin Rossman, Wolfram Schulte:
Semantic Essence of AsmL. FMCO 2003: 240-259 - [c1]Benjamin Rossman:
Successor-Invariance in the Finite. LICS 2003: 148-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
