Samuel R. Buss

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alexander Knop

> Home > Persons > Samuel R. Buss

Publications

2021
[j73]
- view
  authority control:
- export record
  dblp key:
  - journals/tocl/BussIKRS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/BussIKRS21
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22(4): 26:1-26:30 (2021)
2020
[c35]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/csl/Buss0K20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/Buss0K20
Sam Buss, Anupam Das, Alexander Knop:
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL 2020: 12:1-12:17
[i14]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/BussIKRS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/BussIKRS20
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. TR20 (2020)
2019
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/BussK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BussK19
Sam Buss, Alexander Knop:
Strategies for Stable Merge Sorting. SODA 2019: 1272-1290
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1910-08503
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1910-08503
Sam Buss, Anupam Das, Alexander Knop:
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR abs/1910.08503 (2019)
2018
[c30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/coco/BussIKS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/BussIKS18
Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. CCC 2018: 16:1-16:24
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1801-04641
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1801-04641
Sam Buss, Alexander Knop:
Strategies for Stable Merge Sorting. CoRR abs/1801.04641 (2018)
[i10]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/BussIKS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/BussIKS18
Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. TR18 (2018)

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.