285 search results - page 49 / 57 » New Ways to Construct Binary Search Trees |
118
click to vote
EUROPAR
2011
Springer
13 years 11 months ago
2011
Springer
Most applications manipulate structured data. Modern languages and platforms provide collection frameworks with basic data structures like lists, hashtables and trees. These data ...
120
Voted
KNINVI
2005
Springer
15 years 5 months ago
2005
Springer
Information visualization has been a research topic for many years, leading to a mature field where guidelines and practices are well established. Knowledge visualization, in contr...
ECCC
2007
14 years 11 months ago
2007
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
120
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
120
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...