Sciweavers

341 search results - page 58 / 69
» Paired bondage in trees
Sort
View
VLDB
2001
ACM
148views Database» more  VLDB 2001»
15 years 2 months ago
Indexing and Querying XML Data for Regular Path Expressions
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...
Quanzhong Li, Bongki Moon
JCT
2011
141views more  JCT 2011»
14 years 4 months ago
Bijections for Baxter families and related objects
The Baxter number Bn can be written as Bn = n k=0 Θk,n−k−1 with Θk,ℓ = 2 (k + 1)2 (k + 2) k + ℓ k k + ℓ + 1 k k + ℓ + 2 k . These numbers have first appeared in the...
Stefan Felsner, Éric Fusy, Marc Noy, David ...
85
Voted
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
CIE
2006
Springer
15 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
POPL
1991
ACM
15 years 1 months ago
Subtyping Recursive Types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
Roberto M. Amadio, Luca Cardelli