141 search results - page 21 / 29 » Destruction of Very Simple Trees |
STACS
1992
Springer
15 years 3 months ago
1992
Springer
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...
IACR
2011
13 years 11 months ago
2011
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...
STOC
2007
ACM
16 years 9 hour ago
2007
ACM
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...
127
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
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...
100
click to vote
RECOMB
2005
Springer
16 years 11 hour ago
2005
Springer
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...