Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
In this paper we provide properties of moments of matrix exponential distributions and joint moments of matrix exponential processes. Based on the provided properties, an algorith...
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Symplectic integrators are numerical integration schemes for hamiltonian systems. The integration step is an explicit symplectic map. We find symplectic integrators using universa...