Learn More
Around 2002, Leonid Gurvits gave a striking randomized algorithm to approximate the permanent of an n × n matrix A. The algorithm runs in O n 2 /ε 2 time, and approximates Per (A) to within ±ε A n additive error. A major advantage of Gurvits's algorithm is that it works for arbitrary matrices, not just for nonnegative matrices. This makes it highly relevant(More)
We present an approach for dynamic information flow control across the application and database. Our approach reduces the amount of policy code required, yields formal guarantees across the application and database, works with existing relational database implementations, and scales for realistic applications. In this paper, we present a programming model(More)
1 Overview In the next two lectures we study the question of dynamic optimality, or whether there exists a binary search tree algorithm that performs " as well " as all other algorithms on any input string. In this lecture we will define a binary search tree as a formal model of computation, show some analytic bounds that a dynamically optimal binary search(More)
  • 1