First Page | Document Content | |
---|---|---|
Date: 2013-06-30 22:33:39Mathematics Algorithms Streaming algorithm Time complexity Quantile Applied mathematics Computational complexity theory Computer science | A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given twoAdd to Reading ListSource URL: www.cs.utah.eduDownload Document from Source WebsiteFile Size: 573,05 KBShare Document on Facebook |
A Family of Provably Correct Algorithms for Exact Triangle Coun;ng Ma=hew Lee, Tze Meng Low Correctness 2017DocID: 1xVUG - View Document | |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Formal Correctness of Comparison Algorithms between Binary64 and Decimal64 Floating-point Numbers Arthur Blot ENS Lyon, France NSV, July 22-23, 2017DocID: 1xVvl - View Document | |
Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. CookDocID: 1xVkB - View Document | |
Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms Ari Juels Department of Computer ScienceDocID: 1xVfc - View Document |