Jeffrey F. Naughton
From MaRDI portal
Person:1123650
Available identifiers
zbMath Open naughton.jeffrey-fDBLPn/JeffreyFNaughtonWikidataQ6176187 ScholiaQ6176187MaRDI QIDQ1123650
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| m-tables: Representing Missing Data | 2018-07-18 | Paper |
| On Differentially Private Inductive Logic Programming | 2015-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414541 | 2003-07-25 | Paper |
| Argument reduction by factoring | 1997-02-28 | Paper |
| Query size estimation by adaptive sampling | 1996-02-13 | Paper |
| Clocked adversaries for hashing | 1993-05-16 | Paper |
| A counting algorithm for a cyclic binary query | 1992-06-25 | Paper |
| One-sided recursions | 1991-01-01 | Paper |
| A simple characterization of uniform boundedness for a class of recursions | 1991-01-01 | Paper |
| Data independent recursion in deductive databases | 1989-01-01 | Paper |
| Minimizing function-free recursive inference rules | 1989-01-01 | Paper |
Research outcomes over time
This page was built for person: Jeffrey F. Naughton
