Laissez-Faire Caching for Parallel #SAT Solving

Jan Burchard, Tobias Schubert, Bernd Becker. Laissez-Faire Caching for Parallel #SAT Solving. In Marijn Heule, Sean Weaver, editors, Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings. Volume 9340 of Lecture Notes in Computer Science, pages 46-61, Springer, 2015. [doi]

@inproceedings{BurchardSB15,
  title = {Laissez-Faire Caching for Parallel #SAT Solving},
  author = {Jan Burchard and Tobias Schubert and Bernd Becker},
  year = {2015},
  doi = {10.1007/978-3-319-24318-4_5},
  url = {http://dx.doi.org/10.1007/978-3-319-24318-4_5},
  researchr = {https://researchr.org/publication/BurchardSB15},
  cites = {0},
  citedby = {0},
  pages = {46-61},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings},
  editor = {Marijn Heule and Sean Weaver},
  volume = {9340},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-24317-7},
}