Sciweavers

922 search results - page 93 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
13 years 9 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
Luc Devroye
MLQ
2007
73views more  MLQ 2007»
13 years 9 months ago
On completely nonmeasurable unions
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
Szymon Zeberski
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 3 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
ACL2
2006
ACM
14 years 1 months ago
Quantification in tail-recursive function definitions
We investigate the logical issues behind axiomatizing equations that contain both recursive calls and quantifiers in ACL2. We identify a class of such equations, named extended ta...
Sandip Ray
BIRTHDAY
2006
Springer
14 years 1 months ago
Complete Categorical Deduction for Satisfaction as Injectivity
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
Grigore Rosu