Benjamin Rossman
Deepanshu Kush
Benjamin Rossman
Tree-Depth and the Formula Complexity of Subgraph Isomorphism.
273-325
2023
February
52
SIAM J. Comput.
1
https://doi.org/10.1137/20m1372925
db/journals/siamcomp/siamcomp52.html#KushR23
William He
Benjamin Rossman
Symmetric Formulas for Products of Permutations.
68:1-68:23
2023
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2023.68
conf/innovations/2023
db/conf/innovations/innovations2023.html#HeR23
Bruno Pasqualotto Cavalar
Mrinal Kumar 0001
Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers.
3655-3685
2022
84
Algorithmica
12
https://doi.org/10.1007/s00453-022-01000-3
db/journals/algorithmica/algorithmica84.html#CavalarKR22
William He
Benjamin Rossman
Symmetric Formulas for Products of Permutations.
2022
abs/2211.15520
CoRR
https://doi.org/10.48550/arXiv.2211.15520
db/journals/corr/corr2211.html#abs-2211-15520
Benjamin Rossman
Shrinkage of Decision Lists and DNF Formulas.
70:1-70:14
2021
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2021.70
conf/innovations/2021
db/conf/innovations/innovations2021.html#Rossman21
Deepanshu Kush
Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism.
31-42
2020
FOCS
https://doi.org/10.1109/FOCS46700.2020.00012
conf/focs/2020
db/conf/focs/focs2020.html#KushR20
Bruno Pasqualotto Cavalar
Mrinal Kumar 0001
Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers.
311-322
2020
LATIN
https://doi.org/10.1007/978-3-030-61792-9_25
conf/latin/2020
db/conf/latin/latin2020.html#CavalarKR20
Benjamin Rossman
Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$.
504-515
2020
LATIN
https://doi.org/10.1007/978-3-030-61792-9_40
conf/latin/2020
db/conf/latin/latin2020.html#Rossman20
Deepanshu Kush
Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism.
2020
abs/2004.13302
CoRR
https://arxiv.org/abs/2004.13302
db/journals/corr/corr2004.html#abs-2004-13302
Bruno Pasqualotto Cavalar
Mrinal Kumar 0001
Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers.
2020
abs/2012.03883
CoRR
https://arxiv.org/abs/2012.03883
db/journals/corr/corr2012.html#abs-2012-03883
Benjamin Rossman
Shrinkage of Decision Lists and DNF Formulas.
2020
abs/2012.05132
CoRR
https://arxiv.org/abs/2012.05132
db/journals/corr/corr2012.html#abs-2012-05132
Bruno Pasqualotto Cavalar
Mrinal Kumar 0001
Benjamin Rossman
Monotone Circuit Lower Bounds from Robust Sunflowers.
TR20-181
2020
TR20
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2020/181
db/journals/eccc/eccc27.html#CavalarKR20
Deepanshu Kush
Benjamin Rossman
Tree-depth and the Formula Complexity of Subgraph Isomorphism.
TR20-061
2020
TR20
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2020/061
db/journals/eccc/eccc27.html#KushR20
Benjamin Rossman
Shrinkage of Decision Lists and DNF Formulas.
TR20-186
2020
TR20
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2020/186
db/journals/eccc/eccc27.html#Rossman20
Benjamin Rossman
Subspace-Invariant AC00^0 Formulas.
2019
15
Log. Methods Comput. Sci.
3
https://doi.org/10.23638/LMCS-15(3:3)2019
db/journals/lmcs/lmcs15.html#Rossman19
Benjamin Rossman
Srikanth Srinivasan 0001
Separation of AC0[⊕] Formulas and Circuits.
1-20
2019
15
Theory Comput.
https://doi.org/10.4086/toc.2019.v015a017
db/journals/toc/toc15.html#Rossman019
Benjamin Rossman
Criticality of Regular Formulas.
1:1-1:28
2019
CCC
https://doi.org/10.4230/LIPIcs.CCC.2019.1
conf/coco/2019
db/conf/coco/coco2019.html#Rossman19
Benjamin Rossman
Thresholds in the Lattice of Subspaces of (Fq)n.
2019
abs/1910.00656
CoRR
http://arxiv.org/abs/1910.00656
db/journals/corr/corr1910.html#abs-1910-00656
Benjamin Rossman
The Average Sensitivity of Bounded-Depth Formulas.
209-223
2018
27
Comput. Complex.
2
https://doi.org/10.1007/s00037-017-0156-0
db/journals/cc/cc27.html#Rossman18
Benjamin Rossman
Formulas versus Circuits for Small Distance Connectivity.
1986-2028
2018
47
SIAM J. Comput.
5
https://doi.org/10.1137/15M1027310
db/journals/siamcomp/siamcomp47.html#Rossman18
Ken-ichi Kawarabayashi
Benjamin Rossman
A Polynomial Excluded-Minor Approximation of Treedepth.
234-246
2018
SODA
https://doi.org/10.1137/1.9781611975031.17
conf/soda/2018
db/conf/soda/soda2018.html#KawarabayashiR18
Benjamin Rossman
Subspace-Invariant AC0 Formulas.
2018
abs/1806.04831
CoRR
http://arxiv.org/abs/1806.04831
db/journals/corr/corr1806.html#abs-1806-04831
Johan Håstad
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
An Average-Case Depth Hierarchy Theorem for Boolean Circuits.
35:1-35:27
2017
64
J. ACM
5
https://doi.org/10.1145/3095799
db/journals/jacm/jacm64.html#HastadRST17
Akinori Kawachi
Benjamin Rossman
Osamu Watanabe 0001
The Query Complexity of Witness Finding.
305-321
2017
61
Theory Comput. Syst.
2
https://doi.org/10.1007/s00224-016-9708-y
db/journals/mst/mst61.html#KawachiRW17
Yuan Li
Alexander A. Razborov
Benjamin Rossman
On the AC0 Complexity of Subgraph Isomorphism.
936-971
2017
46
SIAM J. Comput.
3
https://doi.org/10.1137/14099721X
db/journals/siamcomp/siamcomp46.html#LiRR17
Benjamin Rossman
Srikanth Srinivasan 0001
Separation of AC^0[oplus] Formulas and Circuits.
50:1-50:13
2017
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2017.50
conf/icalp/2017
db/conf/icalp/icalp2017.html#RossmanS17
Benjamin Rossman
Subspace-Invariant AC^0 Formulas.
93:1-93:11
2017
ICALP
https://doi.org/10.4230/LIPIcs.ICALP.2017.93
conf/icalp/2017
db/conf/icalp/icalp2017.html#Rossman17
Benjamin Rossman
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.
27:1-27:17
2017
ITCS
https://doi.org/10.4230/LIPIcs.ITCS.2017.27
conf/innovations/2017
db/conf/innovations/innovations2017.html#Rossman17
Benjamin Rossman
Srikanth Srinivasan 0001
Separation of AC$^0[\oplus]$ Formulas and Circuits.
2017
abs/1702.03625
CoRR
http://arxiv.org/abs/1702.03625
db/journals/corr/corr1702.html#RossmanS17
Benjamin Rossman
Srikanth Srinivasan 0001
Separation of AC0[⊕] Formulas and Circuits.
TR17-022
2017
TR17
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2017/022
db/journals/eccc/eccc24.html#RossmanS17
Benjamin Rossman
An improved homomorphism preservation theorem from lower bounds in circuit complexity.
33-46
2016
3
ACM SIGLOG News
4
https://doi.org/10.1145/3026744.3026746
db/journals/siglog/siglog3.html#Rossman16
Robert Robere
Toniann Pitassi
Benjamin Rossman
Stephen A. Cook
Exponential Lower Bounds for Monotone Span Programs.
406-415
2016
FOCS
https://doi.org/10.1109/FOCS.2016.51
https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.51
conf/focs/2016
db/conf/focs/focs2016.html#RoberePRC16
Toniann Pitassi
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
Poly-logarithmic Frege depth lower bounds via an expander switching lemma.
644-657
2016
STOC
https://doi.org/10.1145/2897518.2897637
conf/stoc/2016
db/conf/stoc/stoc2016.html#PitassiRST16
Benjamin Rossman
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.
2016
abs/1612.08192
CoRR
http://arxiv.org/abs/1612.08192
db/journals/corr/corr1612.html#Rossman16
Stephen A. Cook
Toniann Pitassi
Robert Robere
Benjamin Rossman
Exponential Lower Bounds for Monotone Span Programs.
TR16-064
2016
TR16
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2016/064
db/journals/eccc/eccc23.html#CookPRR16
Benjamin Rossman
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity.
TR16-206
2016
TR16
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2016/206
db/journals/eccc/eccc23.html#Rossman16
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits.
50-68
2015
46
SIGACT News
4
https://doi.org/10.1145/2852040.2852052
db/journals/sigact/sigact46.html#RossmanST15
Benjamin Rossman
Correlation Bounds Against Monotone NC^1.
392-411
2015
CCC
https://doi.org/10.4230/LIPIcs.CCC.2015.392
conf/coco/2015
db/conf/coco/coco2015.html#Rossman15
Benjamin Rossman
The Average Sensitivity of Bounded-Depth Formulas.
424-430
2015
FOCS
https://doi.org/10.1109/FOCS.2015.33
https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.33
conf/focs/2015
db/conf/focs/focs2015.html#Rossman15
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
An Average-Case Depth Hierarchy Theorem for Boolean Circuits.
1030-1048
2015
FOCS
https://doi.org/10.1109/FOCS.2015.67
https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.67
conf/focs/2015
db/conf/focs/focs2015.html#RossmanST15
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
An average-case depth hierarchy theorem for Boolean circuits.
2015
abs/1504.03398
CoRR
http://arxiv.org/abs/1504.03398
db/journals/corr/corr1504.html#RossmanST15
Benjamin Rossman
The Average Sensitivity of Bounded-Depth Formulas.
2015
abs/1508.07677
CoRR
http://arxiv.org/abs/1508.07677
db/journals/corr/corr1508.html#Rossman15
Benjamin Rossman
The Average Sensitivity of Bounded-Depth Formulas.
TR15-143
2015
TR15
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2015/143
db/journals/eccc/eccc22.html#Rossman15
Benjamin Rossman
Rocco A. Servedio
Li-Yang Tan
An average-case depth hierarchy theorem for Boolean circuits.
TR15-065
2015
TR15
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2015/065
db/journals/eccc/eccc22.html#RossmanST15
Benjamin Rossman
The Monotone Complexity of k-Clique on Random Graphs.
256-279
2014
43
SIAM J. Comput.
1
https://doi.org/10.1137/110839059
db/journals/siamcomp/siamcomp43.html#Rossman14
Akinori Kawachi
Benjamin Rossman
Osamu Watanabe 0001
The Query Complexity of Witness Finding.
218-231
2014
CSR
https://doi.org/10.1007/978-3-319-06686-8_17
conf/csr/2014
db/conf/csr/csr2014.html#KawachiRW14
Yuan Li
Alexander A. Razborov
Benjamin Rossman
On the AC0 Complexity of Subgraph Isomorphism.
344-353
2014
FOCS
https://doi.org/10.1109/FOCS.2014.44
https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.44
conf/focs/2014
db/conf/focs/focs2014.html#LiRR14
Benjamin Rossman
Formulas vs. circuits for small distance connectivity.
203-212
2014
STOC
https://doi.org/10.1145/2591796.2591828
conf/stoc/2014
db/conf/stoc/stoc2014.html#Rossman14
Yuan Li
Alexander A. Razborov
Benjamin Rossman
On the AC0 Complexity of Subgraph Isomorphism.
TR14-145
2014
TR14
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2014/145
db/journals/eccc/eccc21.html#LiRR14
Benjamin Rossman
Formulas vs. Circuits for Small Distance Connectivity.
2013
abs/1312.0355
CoRR
http://arxiv.org/abs/1312.0355
db/journals/corr/corr1312.html#Rossman13
Benjamin Rossman
Formulas vs. Circuits for Small Distance Connectivity.
TR13-169
2013
TR13
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2013/169
db/journals/eccc/eccc20.html#Rossman13
Benjamin Rossman
A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs.
282-290
2012
WoLLIC
https://doi.org/10.1007/978-3-642-32621-9_21
conf/wollic/2012
db/conf/wollic/wollic2012.html#Rossman12
Akinori Kawachi
Benjamin Rossman
Osamu Watanabe 0001
Query Complexity and Error Tolerance of Witness Finding Algorithms.
TR12-002
2012
TR12
Electron. Colloquium Comput. Complex.
https://eccc.weizmann.ac.il/report/2012/002
db/journals/eccc/eccc19.html#KawachiRW12
Swastik Kopparty
Benjamin Rossman
The homomorphism domination exponent.
1097-1114
2011
32
Eur. J. Comb.
7
https://doi.org/10.1016/j.ejc.2011.03.009
db/journals/ejc/ejc32.html#KoppartyR11
Benjamin Rossman
Average-case complexity of detecting cliques.
2010
Massachusetts Institute of Technology, Cambridge, MA, USA
https://hdl.handle.net/1721.1/62441
ndltd.org (oai:dspace.mit.edu:1721.1/62441)
Benjamin Rossman
Choiceless Computation and Symmetry.
565-580
2010
Fields of Logic and Computation
https://doi.org/10.1007/978-3-642-15025-8_28
conf/birthday/2010gurevich
db/conf/birthday/gurevich2010.html#Rossman10
Benjamin Rossman
The Monotone Complexity of k-clique on Random Graphs.
193-201
2010
FOCS
https://doi.org/10.1109/FOCS.2010.26
https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.26
conf/focs/2010
db/conf/focs/focs2010.html#Rossman10
Benjamin Rossman
Thomas Schwentick
Denis Thérien
Heribert Vollmer
Circuits, Logic, and Games, 07.02. - 12.02.2010
Circuits, Logic, and Games
10061
2010
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
Dagstuhl Seminar Proceedings
db/conf/dagstuhl/P10061.html
http://drops.dagstuhl.de/portals/10061/
Benjamin Rossman
Thomas Schwentick
Denis Thérien
Heribert Vollmer
10061 Abstracts Collection - Circuits, Logic, and Games.
2010
Circuits, Logic, and Games
http://drops.dagstuhl.de/opus/volltexte/2010/2528/
conf/dagstuhl/2010P10061
db/conf/dagstuhl/P10061.html#RossmanSTV10
Benjamin Rossman
Thomas Schwentick
Denis Thérien
Heribert Vollmer
10061 Executive Summary - Circuits, Logic, and Games.
2010
Circuits, Logic, and Games
http://drops.dagstuhl.de/opus/volltexte/2010/2527/
conf/dagstuhl/2010P10061
db/conf/dagstuhl/P10061.html#RossmanSTV10a
Erik D. Demaine
Shay Mozes
Benjamin Rossman
Oren Weimann
An optimal decomposition algorithm for tree edit distance.
2009
6
ACM Trans. Algorithms
1
https://doi.org/10.1145/1644015.1644017
https://www.wikidata.org/entity/Q60143028
db/journals/talg/talg6.html#DemaineMRW09
2:1-2:19
Benjamin Rossman
Combining Ehrenfeucht-Fraïssé Games.
331
2009
LICS
https://doi.org/10.1109/LICS.2009.50
https://doi.ieeecomputersociety.org/10.1109/LICS.2009.50
conf/lics/2009
db/conf/lics/lics2009.html#Rossman09
Benjamin Rossman
Ehrenfeucht-Fraïssé Games on Random Structures.
350-364
2009
WoLLIC
https://doi.org/10.1007/978-3-642-02261-6_28
conf/wollic/2009
db/conf/wollic/wollic2009.html#Rossman09
Anuj Dawar
David Richerby
Benjamin Rossman
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs.
31-50
2008
152
Ann. Pure Appl. Log.
1-3
https://doi.org/10.1016/j.apal.2007.11.011
https://www.wikidata.org/entity/Q58215577
db/journals/apal/apal152.html#DawarRR08
Benjamin Rossman
Homomorphism preservation theorems.
2008
55
J. ACM
3
https://doi.org/10.1145/1379759.1379763
db/journals/jacm/jacm55.html#Rossman08
15:1-15:53
Benjamin Rossman
On the constant-depth complexity of k-clique.
721-730
2008
STOC
https://doi.org/10.1145/1374376.1374480
conf/stoc/2008
db/conf/stoc/stoc2008.html#Rossman08
Benjamin Rossman
Successor-invariant first-order logic on finite structures.
601-618
2007
72
J. Symb. Log.
2
https://doi.org/10.2178/jsl/1185803625
http://projecteuclid.org/euclid.jsl/1185803625
db/journals/jsyml/jsyml72.html#Rossman07
Andreas Blass
Yuri Gurevich
Dean Rosenzweig
Benjamin Rossman
Interactive Small-Step Algorithms I: Axiomatization.
2007
3
Log. Methods Comput. Sci.
4
https://doi.org/10.2168/LMCS-3(4:3)2007
db/journals/lmcs/lmcs3.html#BlassGRR07
Andreas Blass
Yuri Gurevich
Dean Rosenzweig
Benjamin Rossman
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.
2007
3
Log. Methods Comput. Sci.
4
https://doi.org/10.2168/LMCS-3(4:4)2007
db/journals/lmcs/lmcs3.html#BlassGRR07a
Erik D. Demaine
Shay Mozes
Benjamin Rossman
Oren Weimann
An Optimal Decomposition Algorithm for Tree Edit Distance.
146-157
2007
conf/icalp/2007
ICALP
https://doi.org/10.1007/978-3-540-73420-8_15
https://www.wikidata.org/entity/Q60143033
db/conf/icalp/icalp2007.html#DemaineMRW07
Andreas Blass
Yuri Gurevich
Dean Rosenzweig
Benjamin Rossman
Interactive Small-Step Algorithms I: Axiomatization
http://arxiv.org/abs/0707.3782
2007
CoRR
abs/0707.3782
db/journals/corr/corr0707.html#abs-0707-3782
Andreas Blass
Yuri Gurevich
Dean Rosenzweig
Benjamin Rossman
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
http://arxiv.org/abs/0707.3789
2007
CoRR
abs/0707.3789
db/journals/corr/corr0707.html#abs-0707-3789
Erik D. Demaine
Shay Mozes
Benjamin Rossman
Oren Weimann
An O(n^3)-Time Algorithm for Tree Edit Distance
http://arxiv.org/abs/cs/0604037
2006
CoRR
abs/cs/0604037
db/journals/corr/corr0604.html#abs-cs-0604037
Andreas Blass
Benjamin Rossman
Explicit Graphs with Extension Properties.
166-175
2005
86
Bull. EATCS
db/journals/eatcs/eatcs86.html#BlassR05
Yuri Gurevich
Benjamin Rossman
Wolfram Schulte
Semantic essence of AsmL.
370-412
2005
343
Theor. Comput. Sci.
3
https://doi.org/10.1016/j.tcs.2005.06.017
db/journals/tcs/tcs343.html#GurevichRS05
Benjamin Rossman
Existential Positive Types and Preservation under Homomorphisisms.
467-476
2005
conf/lics/2005
LICS
https://doi.org/10.1109/LICS.2005.16
https://doi.ieeecomputersociety.org/10.1109/LICS.2005.16
db/conf/lics/lics2005.html#Rossman05
Anuj Dawar
David Richerby
Benjamin Rossman
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract).
13-26
2005
conf/wollic/2005
WoLLIC
https://doi.org/10.1016/j.entcs.2005.05.024
https://www.wikidata.org/entity/Q58215644
db/journals/entcs/entcs143.html#DawarRR06
Yuri Gurevich
Benjamin Rossman
Wolfram Schulte
Semantic Essence of AsmL.
240-259
https://doi.org/10.1007/978-3-540-30101-1_11
2003
conf/fmco/2003
FMCO
db/conf/fmco/fmco2003.html#GurevichRS03
Benjamin Rossman
Successor-Invariance in the Finite.
148-
2003
conf/lics/2003
LICS
https://doi.org/10.1109/LICS.2003.1210054
https://doi.ieeecomputersociety.org/10.1109/LICS.2003.1210054
db/conf/lics/lics2003.html#Rossman03
Andreas Blass
Bruno Pasqualotto Cavalar
Stephen A. Cook
Anuj Dawar
Erik D. Demaine
Yuri Gurevich
Johan Håstad
William He
Akinori Kawachi
Ken-ichi Kawarabayashi
Swastik Kopparty
Mrinal Kumar 0001
Deepanshu Kush
Yuan Li
Shay Mozes
Toniann Pitassi
Alexander A. Razborov
David Richerby
Robert Robere
Dean Rosenzweig
Wolfram Schulte
Thomas Schwentick
Rocco A. Servedio
Srikanth Srinivasan 0001
Li-Yang Tan
Denis Thérien
Heribert Vollmer
Osamu Watanabe 0001
Oren Weimann