52 citations · 94 across the 5 of their papers we have counts for
6 papers
Optimal Uncoordinated Unique IDs
Peter C. Dillinger, Martín Farach-Colton, Guido Tagliavini +1
In the Uncoordinated Unique Identifiers Problem (UUIDP) there are independent instances of an algorithm that generates IDs from a universe , and…
Approximate Membership Query Filters with a False Positive Free Set
Pedro Reviriego, Alfonso Sánchez-Macián, Stefan Walzer +1
In the last decade, significant efforts have been made to reduce the false positive rate of approximate membership checking structures. This has led to the development of new struc…
Fast Succinct Retrieval and Approximate Membership using Ribbon
Peter C. Dillinger, Lorenz Hübschle-Schneider, Peter Sanders +1
A retrieval data structure for a static function supports queries that return for any . Retrieval data structures can be used to implemen…
Ribbon filter: practically smaller than Bloom and Xor
Peter C. Dillinger, Stefan Walzer
Filter data structures over-approximate a set of hashable keys, i.e. set membership queries may incorrectly come out positive. A filter with false positive rate is kn…
Data Definitions in the ACL2 Sedan
Harsh Raju Chamarthi, Peter C. Dillinger, Panagiotis Manolios
We present a data definition framework that enables the convenient specification of data types in ACL2s, the ACL2 Sedan. Our primary motivation for developing the data definition f…
Integrating Testing and Interactive Theorem Proving
Harsh Raju Chamarthi, Peter C. Dillinger, Matt Kaufmann +1
Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of…