Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Benjamin Rossman
@article{DBLP:journals/siamcomp/KushR23,
author = {Deepanshu Kush and
Benjamin Rossman},
title = {Tree-Depth and the Formula Complexity of Subgraph Isomorphism},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {1},
pages = {273--325},
year = {2023},
url = {https://doi.org/10.1137/20m1372925},
doi = {10.1137/20M1372925},
timestamp = {Wed, 29 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KushR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HeR23,
author = {William He and
Benjamin Rossman},
editor = {Yael Tauman Kalai},
title = {Symmetric Formulas for Products of Permutations},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {68:1--68:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.68},
doi = {10.4230/LIPICS.ITCS.2023.68},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HeR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CavalarKR22,
author = {Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman},
title = {Monotone Circuit Lower Bounds from Robust Sunflowers},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3655--3685},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-01000-3},
doi = {10.1007/S00453-022-01000-3},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CavalarKR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-15520,
author = {William He and
Benjamin Rossman},
title = {Symmetric Formulas for Products of Permutations},
journal = {CoRR},
volume = {abs/2211.15520},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.15520},
doi = {10.48550/ARXIV.2211.15520},
eprinttype = {arXiv},
eprint = {2211.15520},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-15520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Rossman21,
author = {Benjamin Rossman},
editor = {James R. Lee},
title = {Shrinkage of Decision Lists and {DNF} Formulas},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {70:1--70:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.70},
doi = {10.4230/LIPICS.ITCS.2021.70},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Rossman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KushR20,
author = {Deepanshu Kush and
Benjamin Rossman},
editor = {Sandy Irani},
title = {Tree-depth and the Formula Complexity of Subgraph Isomorphism},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {31--42},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00012},
doi = {10.1109/FOCS46700.2020.00012},
timestamp = {Wed, 15 Dec 2021 10:49:16 +0100},
biburl = {https://dblp.org/rec/conf/focs/KushR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CavalarKR20,
author = {Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Monotone Circuit Lower Bounds from Robust Sunflowers},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {311--322},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_25},
doi = {10.1007/978-3-030-61792-9\_25},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/CavalarKR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Rossman20,
author = {Benjamin Rossman},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Thresholds in the Lattice of Subspaces of {\textdollar}{\textbackslash}mathbb
\{F\}{\_}q{\^{}}n{\textdollar}},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {504--515},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_40},
doi = {10.1007/978-3-030-61792-9\_40},
timestamp = {Thu, 03 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/Rossman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-13302,
author = {Deepanshu Kush and
Benjamin Rossman},
title = {Tree-depth and the Formula Complexity of Subgraph Isomorphism},
journal = {CoRR},
volume = {abs/2004.13302},
year = {2020},
url = {https://arxiv.org/abs/2004.13302},
eprinttype = {arXiv},
eprint = {2004.13302},
timestamp = {Sat, 02 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-13302.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-03883,
author = {Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman},
title = {Monotone Circuit Lower Bounds from Robust Sunflowers},
journal = {CoRR},
volume = {abs/2012.03883},
year = {2020},
url = {https://arxiv.org/abs/2012.03883},
eprinttype = {arXiv},
eprint = {2012.03883},
timestamp = {Thu, 08 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-03883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-05132,
author = {Benjamin Rossman},
title = {Shrinkage of Decision Lists and {DNF} Formulas},
journal = {CoRR},
volume = {abs/2012.05132},
year = {2020},
url = {https://arxiv.org/abs/2012.05132},
eprinttype = {arXiv},
eprint = {2012.05132},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-05132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CavalarKR20,
author = {Bruno Pasqualotto Cavalar and
Mrinal Kumar and
Benjamin Rossman},
title = {Monotone Circuit Lower Bounds from Robust Sunflowers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-181}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/181},
eprinttype = {ECCC},
eprint = {TR20-181},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CavalarKR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KushR20,
author = {Deepanshu Kush and
Benjamin Rossman},
title = {Tree-depth and the Formula Complexity of Subgraph Isomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-061}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/061},
eprinttype = {ECCC},
eprint = {TR20-061},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KushR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Rossman20,
author = {Benjamin Rossman},
title = {Shrinkage of Decision Lists and {DNF} Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-186}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/186},
eprinttype = {ECCC},
eprint = {TR20-186},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Rossman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/Rossman19,
author = {Benjamin Rossman},
title = {Subspace-Invariant AC00{\^{}}0 Formulas},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {3},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(3:3)2019},
doi = {10.23638/LMCS-15(3:3)2019},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/Rossman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Rossman019,
author = {Benjamin Rossman and
Srikanth Srinivasan},
title = {Separation of AC\({}^{\mbox{0}}\)[{\(\oplus\)}] Formulas and Circuits},
journal = {Theory Comput.},
volume = {15},
pages = {1--20},
year = {2019},
url = {https://doi.org/10.4086/toc.2019.v015a017},
doi = {10.4086/TOC.2019.V015A017},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Rossman019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Rossman19,
author = {Benjamin Rossman},
editor = {Amir Shpilka},
title = {Criticality of Regular Formulas},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {1:1--1:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.1},
doi = {10.4230/LIPICS.CCC.2019.1},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/Rossman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00656,
author = {Benjamin Rossman},
title = {Thresholds in the Lattice of Subspaces of (F\({}_{\mbox{q}}\))\({}^{\mbox{n}}\)},
journal = {CoRR},
volume = {abs/1910.00656},
year = {2019},
url = {http://arxiv.org/abs/1910.00656},
eprinttype = {arXiv},
eprint = {1910.00656},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Rossman18,
author = {Benjamin Rossman},
title = {The Average Sensitivity of Bounded-Depth Formulas},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {209--223},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0156-0},
doi = {10.1007/S00037-017-0156-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Rossman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rossman18,
author = {Benjamin Rossman},
title = {Formulas versus Circuits for Small Distance Connectivity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1986--2028},
year = {2018},
url = {https://doi.org/10.1137/15M1027310},
doi = {10.1137/15M1027310},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rossman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KawarabayashiR18,
author = {Ken{-}ichi Kawarabayashi and
Benjamin Rossman},
editor = {Artur Czumaj},
title = {A Polynomial Excluded-Minor Approximation of Treedepth},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {234--246},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.17},
doi = {10.1137/1.9781611975031.17},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/KawarabayashiR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04831,
author = {Benjamin Rossman},
title = {Subspace-Invariant AC\({}^{\mbox{0}}\) Formulas},
journal = {CoRR},
volume = {abs/1806.04831},
year = {2018},
url = {http://arxiv.org/abs/1806.04831},
eprinttype = {arXiv},
eprint = {1806.04831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HastadRST17,
author = {Johan H{\aa}stad and
Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {An Average-Case Depth Hierarchy Theorem for Boolean Circuits},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {35:1--35:27},
year = {2017},
url = {https://doi.org/10.1145/3095799},
doi = {10.1145/3095799},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HastadRST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KawachiRW17,
author = {Akinori Kawachi and
Benjamin Rossman and
Osamu Watanabe},
title = {The Query Complexity of Witness Finding},
journal = {Theory Comput. Syst.},
volume = {61},
number = {2},
pages = {305--321},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9708-y},
doi = {10.1007/S00224-016-9708-Y},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KawachiRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiRR17,
author = {Yuan Li and
Alexander A. Razborov and
Benjamin Rossman},
title = {On the AC\({}^{\mbox{0}}\) Complexity of Subgraph Isomorphism},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {3},
pages = {936--971},
year = {2017},
url = {https://doi.org/10.1137/14099721X},
doi = {10.1137/14099721X},
timestamp = {Wed, 05 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LiRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RossmanS17,
author = {Benjamin Rossman and
Srikanth Srinivasan},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Separation of AC{\^{}}0[oplus] Formulas and Circuits},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {50:1--50:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.50},
doi = {10.4230/LIPICS.ICALP.2017.50},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/RossmanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Rossman17,
author = {Benjamin Rossman},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Subspace-Invariant AC{\^{}}0 Formulas},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {93:1--93:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.93},
doi = {10.4230/LIPICS.ICALP.2017.93},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Rossman17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Rossman17,
author = {Benjamin Rossman},
editor = {Christos H. Papadimitriou},
title = {An Improved Homomorphism Preservation Theorem From Lower Bounds in
Circuit Complexity},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {27:1--27:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.27},
doi = {10.4230/LIPICS.ITCS.2017.27},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Rossman17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RossmanS17,
author = {Benjamin Rossman and
Srikanth Srinivasan},
title = {Separation of AC{\textdollar}{\^{}}0[{\textbackslash}oplus]{\textdollar}
Formulas and Circuits},
journal = {CoRR},
volume = {abs/1702.03625},
year = {2017},
url = {http://arxiv.org/abs/1702.03625},
eprinttype = {arXiv},
eprint = {1702.03625},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RossmanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RossmanS17,
author = {Benjamin Rossman and
Srikanth Srinivasan},
title = {Separation of AC\({}^{\mbox{0}}\)[{\(\oplus\)}] Formulas and Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-022}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/022},
eprinttype = {ECCC},
eprint = {TR17-022},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RossmanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Rossman16,
author = {Benjamin Rossman},
title = {An improved homomorphism preservation theorem from lower bounds in
circuit complexity},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {4},
pages = {33--46},
year = {2016},
url = {https://doi.org/10.1145/3026744.3026746},
doi = {10.1145/3026744.3026746},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Rossman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoberePRC16,
author = {Robert Robere and
Toniann Pitassi and
Benjamin Rossman and
Stephen A. Cook},
editor = {Irit Dinur},
title = {Exponential Lower Bounds for Monotone Span Programs},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {406--415},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.51},
doi = {10.1109/FOCS.2016.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RoberePRC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiRST16,
author = {Toniann Pitassi and
Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Poly-logarithmic Frege depth lower bounds via an expander switching
lemma},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {644--657},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897637},
doi = {10.1145/2897518.2897637},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PitassiRST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rossman16,
author = {Benjamin Rossman},
title = {An Improved Homomorphism Preservation Theorem From Lower Bounds in
Circuit Complexity},
journal = {CoRR},
volume = {abs/1612.08192},
year = {2016},
url = {http://arxiv.org/abs/1612.08192},
eprinttype = {arXiv},
eprint = {1612.08192},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rossman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CookPRR16,
author = {Stephen A. Cook and
Toniann Pitassi and
Robert Robere and
Benjamin Rossman},
title = {Exponential Lower Bounds for Monotone Span Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-064}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/064},
eprinttype = {ECCC},
eprint = {TR16-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CookPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Rossman16,
author = {Benjamin Rossman},
title = {An Improved Homomorphism Preservation Theorem From Lower Bounds in
Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-206}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/206},
eprinttype = {ECCC},
eprint = {TR16-206},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Rossman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/RossmanST15,
author = {Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles,
and Boolean Circuits},
journal = {{SIGACT} News},
volume = {46},
number = {4},
pages = {50--68},
year = {2015},
url = {https://doi.org/10.1145/2852040.2852052},
doi = {10.1145/2852040.2852052},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/RossmanST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Rossman15,
author = {Benjamin Rossman},
editor = {David Zuckerman},
title = {Correlation Bounds Against Monotone NC{\^{}}1},
booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
2015, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {33},
pages = {392--411},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.392},
doi = {10.4230/LIPICS.CCC.2015.392},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/Rossman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rossman15,
author = {Benjamin Rossman},
editor = {Venkatesan Guruswami},
title = {The Average Sensitivity of Bounded-Depth Formulas},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {424--430},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.33},
doi = {10.1109/FOCS.2015.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rossman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RossmanST15,
author = {Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Venkatesan Guruswami},
title = {An Average-Case Depth Hierarchy Theorem for Boolean Circuits},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1030--1048},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.67},
doi = {10.1109/FOCS.2015.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RossmanST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RossmanST15,
author = {Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {An average-case depth hierarchy theorem for Boolean circuits},
journal = {CoRR},
volume = {abs/1504.03398},
year = {2015},
url = {http://arxiv.org/abs/1504.03398},
eprinttype = {arXiv},
eprint = {1504.03398},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RossmanST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rossman15,
author = {Benjamin Rossman},
title = {The Average Sensitivity of Bounded-Depth Formulas},
journal = {CoRR},
volume = {abs/1508.07677},
year = {2015},
url = {http://arxiv.org/abs/1508.07677},
eprinttype = {arXiv},
eprint = {1508.07677},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rossman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Rossman15,
author = {Benjamin Rossman},
title = {The Average Sensitivity of Bounded-Depth Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-143}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/143},
eprinttype = {ECCC},
eprint = {TR15-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Rossman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RossmanST15,
author = {Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {An average-case depth hierarchy theorem for Boolean circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-065}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/065},
eprinttype = {ECCC},
eprint = {TR15-065},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RossmanST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Rossman14,
author = {Benjamin Rossman},
title = {The Monotone Complexity of k-Clique on Random Graphs},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {1},
pages = {256--279},
year = {2014},
url = {https://doi.org/10.1137/110839059},
doi = {10.1137/110839059},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Rossman14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/KawachiRW14,
author = {Akinori Kawachi and
Benjamin Rossman and
Osamu Watanabe},
editor = {Edward A. Hirsch and
Sergei O. Kuznetsov and
Jean{-}{\'{E}}ric Pin and
Nikolay K. Vereshchagin},
title = {The Query Complexity of Witness Finding},
booktitle = {Computer Science - Theory and Applications - 9th International Computer
Science Symposium in Russia, {CSR} 2014, Moscow, Russia, June 7-11,
2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8476},
pages = {218--231},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06686-8\_17},
doi = {10.1007/978-3-319-06686-8\_17},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/KawachiRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiRR14,
author = {Yuan Li and
Alexander A. Razborov and
Benjamin Rossman},
title = {On the {AC0} Complexity of Subgraph Isomorphism},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {344--353},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.44},
doi = {10.1109/FOCS.2014.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rossman14,
author = {Benjamin Rossman},
editor = {David B. Shmoys},
title = {Formulas vs. circuits for small distance connectivity},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {203--212},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591828},
doi = {10.1145/2591796.2591828},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rossman14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiRR14,
author = {Yuan Li and
Alexander A. Razborov and
Benjamin Rossman},
title = {On the AC\({}^{\mbox{0}}\) Complexity of Subgraph Isomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-145}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/145},
eprinttype = {ECCC},
eprint = {TR14-145},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/LiRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Rossman13,
author = {Benjamin Rossman},
title = {Formulas vs. Circuits for Small Distance Connectivity},
journal = {CoRR},
volume = {abs/1312.0355},
year = {2013},
url = {http://arxiv.org/abs/1312.0355},
eprinttype = {arXiv},
eprint = {1312.0355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Rossman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Rossman13,
author = {Benjamin Rossman},
title = {Formulas vs. Circuits for Small Distance Connectivity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-169}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/169},
eprinttype = {ECCC},
eprint = {TR13-169},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Rossman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/Rossman12,
author = {Benjamin Rossman},
editor = {C.{-}H. Luke Ong and
Ruy J. G. B. de Queiroz},
title = {A Tight Upper Bound on the Number of Variables for Average-Case k-Clique
on Ordered Graphs},
booktitle = {Logic, Language, Information and Computation - 19th International
Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7456},
pages = {282--290},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32621-9\_21},
doi = {10.1007/978-3-642-32621-9\_21},
timestamp = {Tue, 01 Jun 2021 15:22:32 +0200},
biburl = {https://dblp.org/rec/conf/wollic/Rossman12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KawachiRW12,
author = {Akinori Kawachi and
Benjamin Rossman and
Osamu Watanabe},
title = {Query Complexity and Error Tolerance of Witness Finding Algorithms},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-002}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/002},
eprinttype = {ECCC},
eprint = {TR12-002},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KawachiRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KoppartyR11,
author = {Swastik Kopparty and
Benjamin Rossman},
title = {The homomorphism domination exponent},
journal = {Eur. J. Comb.},
volume = {32},
number = {7},
pages = {1097--1114},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2011.03.009},
doi = {10.1016/J.EJC.2011.03.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KoppartyR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Rossman10,
author = {Benjamin Rossman},
title = {Average-case complexity of detecting cliques},
school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}},
year = {2010},
url = {https://hdl.handle.net/1721.1/62441},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Rossman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Rossman10,
author = {Benjamin Rossman},
editor = {Andreas Blass and
Nachum Dershowitz and
Wolfgang Reisig},
title = {Choiceless Computation and Symmetry},
booktitle = {Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich
on the Occasion of His 70th Birthday},
series = {Lecture Notes in Computer Science},
volume = {6300},
pages = {565--580},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15025-8\_28},
doi = {10.1007/978-3-642-15025-8\_28},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Rossman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rossman10,
author = {Benjamin Rossman},
title = {The Monotone Complexity of k-clique on Random Graphs},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {193--201},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.26},
doi = {10.1109/FOCS.2010.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rossman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10061,
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/portals/10061/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/RossmanSTV10,
author = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {10061 Abstracts Collection - Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2528/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/RossmanSTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/RossmanSTV10a,
author = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {10061 Executive Summary - Circuits, Logic, and Games},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2527/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/RossmanSTV10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineMRW09,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
title = {An optimal decomposition algorithm for tree edit distance},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {1},
pages = {2:1--2:19},
year = {2009},
url = {https://doi.org/10.1145/1644015.1644017},
doi = {10.1145/1644015.1644017},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DemaineMRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Rossman09,
author = {Benjamin Rossman},
title = {Combining Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} Games},
booktitle = {Proceedings of the 24th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2009, 11-14 August 2009, Los Angeles, CA, {USA}},
pages = {331},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/LICS.2009.50},
doi = {10.1109/LICS.2009.50},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Rossman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/Rossman09,
author = {Benjamin Rossman},
editor = {Hiroakira Ono and
Makoto Kanazawa and
Ruy J. G. B. de Queiroz},
title = {Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} Games on Random Structures},
booktitle = {Logic, Language, Information and Computation, 16th International Workshop,
WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5514},
pages = {350--364},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02261-6\_28},
doi = {10.1007/978-3-642-02261-6\_28},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wollic/Rossman09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/DawarRR08,
author = {Anuj Dawar and
David Richerby and
Benjamin Rossman},
title = {Choiceless polynomial time, counting and the Cai-F{\"{u}}rer-Immerman
graphs},
journal = {Ann. Pure Appl. Log.},
volume = {152},
number = {1-3},
pages = {31--50},
year = {2008},
url = {https://doi.org/10.1016/j.apal.2007.11.011},
doi = {10.1016/J.APAL.2007.11.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/DawarRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rossman08,
author = {Benjamin Rossman},
title = {Homomorphism preservation theorems},
journal = {J. {ACM}},
volume = {55},
number = {3},
pages = {15:1--15:53},
year = {2008},
url = {https://doi.org/10.1145/1379759.1379763},
doi = {10.1145/1379759.1379763},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rossman08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rossman08,
author = {Benjamin Rossman},
editor = {Cynthia Dwork},
title = {On the constant-depth complexity of k-clique},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {721--730},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374480},
doi = {10.1145/1374376.1374480},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rossman08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Rossman07,
author = {Benjamin Rossman},
title = {Successor-invariant first-order logic on finite structures},
journal = {J. Symb. Log.},
volume = {72},
number = {2},
pages = {601--618},
year = {2007},
url = {https://doi.org/10.2178/jsl/1185803625},
doi = {10.2178/JSL/1185803625},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Rossman07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlassGRR07,
author = {Andreas Blass and
Yuri Gurevich and
Dean Rosenzweig and
Benjamin Rossman},
title = {Interactive Small-Step Algorithms {I:} Axiomatization},
journal = {Log. Methods Comput. Sci.},
volume = {3},
number = {4},
year = {2007},
url = {https://doi.org/10.2168/LMCS-3(4:3)2007},
doi = {10.2168/LMCS-3(4:3)2007},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BlassGRR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BlassGRR07a,
author = {Andreas Blass and
Yuri Gurevich and
Dean Rosenzweig and
Benjamin Rossman},
title = {Interactive Small-Step Algorithms {II:} Abstract State Machines and
the Characterization Theorem},
journal = {Log. Methods Comput. Sci.},
volume = {3},
number = {4},
year = {2007},
url = {https://doi.org/10.2168/LMCS-3(4:4)2007},
doi = {10.2168/LMCS-3(4:4)2007},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BlassGRR07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DemaineMRW07,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {An Optimal Decomposition Algorithm for Tree Edit Distance},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {146--157},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_15},
doi = {10.1007/978-3-540-73420-8\_15},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DemaineMRW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-3782,
author = {Andreas Blass and
Yuri Gurevich and
Dean Rosenzweig and
Benjamin Rossman},
title = {Interactive Small-Step Algorithms {I:} Axiomatization},
journal = {CoRR},
volume = {abs/0707.3782},
year = {2007},
url = {http://arxiv.org/abs/0707.3782},
eprinttype = {arXiv},
eprint = {0707.3782},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-3782.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-3789,
author = {Andreas Blass and
Yuri Gurevich and
Dean Rosenzweig and
Benjamin Rossman},
title = {Interactive Small-Step Algorithms {II:} Abstract State Machines and
the Characterization Theorem},
journal = {CoRR},
volume = {abs/0707.3789},
year = {2007},
url = {http://arxiv.org/abs/0707.3789},
eprinttype = {arXiv},
eprint = {0707.3789},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0707-3789.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604037,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
title = {An O(n{\^{}}3)-Time Algorithm for Tree Edit Distance},
journal = {CoRR},
volume = {abs/cs/0604037},
year = {2006},
url = {http://arxiv.org/abs/cs/0604037},
eprinttype = {arXiv},
eprint = {cs/0604037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/BlassR05,
author = {Andreas Blass and
Benjamin Rossman},
title = {Explicit Graphs with Extension Properties},
journal = {Bull. {EATCS}},
volume = {86},
pages = {166--175},
year = {2005},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/BlassR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GurevichRS05,
author = {Yuri Gurevich and
Benjamin Rossman and
Wolfram Schulte},
title = {Semantic essence of AsmL},
journal = {Theor. Comput. Sci.},
volume = {343},
number = {3},
pages = {370--412},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.06.017},
doi = {10.1016/J.TCS.2005.06.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GurevichRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Rossman05,
author = {Benjamin Rossman},
title = {Existential Positive Types and Preservation under Homomorphisisms},
booktitle = {20th {IEEE} Symposium on Logic in Computer Science {(LICS} 2005),
26-29 June 2005, Chicago, IL, USA, Proceedings},
pages = {467--476},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/LICS.2005.16},
doi = {10.1109/LICS.2005.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Rossman05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/DawarRR06,
author = {Anuj Dawar and
David Richerby and
Benjamin Rossman},
editor = {Ruy J. G. B. de Queiroz and
Angus Macintyre and
Guilherme Bittencourt},
title = {Choiceless Polynomial Time, Counting and the Cai-F{\"{u}}rer-Immerman
Graphs: (Extended Abstract)},
booktitle = {Proceedings of the 12th Workshop on Logic, Language, Information and
Computation, WoLLIC 2005, Florian{\'{o}}polis, Santa Catarina,
Brazil, July 19-22, 2005},
series = {Electronic Notes in Theoretical Computer Science},
volume = {143},
pages = {13--26},
publisher = {Elsevier},
year = {2005},
url = {https://doi.org/10.1016/j.entcs.2005.05.024},
doi = {10.1016/J.ENTCS.2005.05.024},
timestamp = {Mon, 05 Dec 2022 16:35:24 +0100},
biburl = {https://dblp.org/rec/journals/entcs/DawarRR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fmco/GurevichRS03,
author = {Yuri Gurevich and
Benjamin Rossman and
Wolfram Schulte},
editor = {Frank S. de Boer and
Marcello M. Bonsangue and
Susanne Graf and
Willem P. de Roever},
title = {Semantic Essence of AsmL},
booktitle = {Formal Methods for Components and Objects, Second International Symposium,
{FMCO} 2003, Leiden, The Netherlands, November 4-7, 2003, Revised
Lectures},
series = {Lecture Notes in Computer Science},
volume = {3188},
pages = {240--259},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-30101-1\_11},
doi = {10.1007/978-3-540-30101-1\_11},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fmco/GurevichRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Rossman03,
author = {Benjamin Rossman},
title = {Successor-Invariance in the Finite},
booktitle = {18th {IEEE} Symposium on Logic in Computer Science {(LICS} 2003),
22-25 June 2003, Ottawa, Canada, Proceedings},
pages = {148},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/LICS.2003.1210054},
doi = {10.1109/LICS.2003.1210054},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Rossman03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:07 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:
