We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
There are many applications where multiple data sources, each with its own features, are integrated in order to perform an inference task in an optimal way. Researchers have shown...
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...