In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...