First Page | Document Content | |
---|---|---|
Date: 2017-09-21 08:25:51Software engineering Computer programming Computing Functional languages Data types Type theory Logic in computer science Automated theorem proving OCaml Coq Disjoint-set data structure Proof assistant | Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time CreditsAdd to Reading ListSource URL: chargueraud.orgDownload Document from Source WebsiteFile Size: 372,81 KBShare Document on Facebook |
Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗DocID: 1qZUQ - View Document | |
Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno SiebesDocID: 1qYET - View Document | |
Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWENDocID: 1pSri - View Document | |
Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗DocID: 1poiO - View Document | |
PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: globalDocID: 1mRsU - View Document |