@inproceedings{10368,
  title = "Fighting Perebor: New and Improved Algorithms for Formula and QBF Satisfiability",
  author = "Rahul Santhanam",
  year = "2010",
  journal = "Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science",
}
@inproceedings{10369,
  title = "Infeasibility of Instance Compression and Succinct PCPs for NP",
  author = "Rahul Santhanam and Lance Fortnow",
  year = "2008",
  journal = "Proceedings of the 40th Annual ACM Symposium on Theory of Computing",
}
@inproceedings{10370,
  title = "Circuit Lower Bounds for Merlin-Arthur Classes",
  author = "Rahul Santhanam",
  year = "2007",
  journal = "Proceedings of the 39th Annual ACM Symposium on Theory of Computing",
}
@inproceedings{10371,
  title = "Hierarchy Theorems for Probabilistic Polynomial Time",
  author = "Rahul Santhanam and Lance Fortnow",
  year = "2004",
  journal = "Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science",
}