☰

Nathan L. Segerlind, Ph.D. - Publications

Affiliations: 
2003 University of California, San Diego, La Jolla, CA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

5 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2010 Beame P, Impagliazzo R, Pitassi T, Segerlind N. Formula caching in DPLL Acm Transactions On Computation Theory. 1. DOI: 10.1145/1714450.1714452  0.523
2006 Impagliazzo R, Segerlind N. Constant-depth frege systems with counting axioms polynomially simulate nullstellensatz refutations Acm Transactions On Computational Logic. 7: 199-218. DOI: 10.1145/1131313.1131314  0.512
2006 Beame P, Pitassi T, Segerlind N, Wigderson A. A strong direct product theorem for corruption and the multiparty communication complexity of disjointness Computational Complexity. 15: 391-432. DOI: 10.1007/S00037-007-0220-2  0.435
2005 Beame P, Pitassi T, Segerlind N. Lower bounds for Lovász-Schrijver systems and beyond follow from multiparty communication complexity Lecture Notes in Computer Science. 3580: 1176-1188. DOI: 10.1137/060654645  0.511
2002 Segerlind N, Buss S, Impagliazzo R. A switching lemma for small restrictions and lower bounds for k-DNF resolution Annual Symposium On Foundations of Computer Science - Proceedings. 604-613. DOI: 10.1137/S0097539703428555  0.475
Show low-probability matches.