D
Daniel H. Greene
Researcher at PARC
Publications - 159
Citations - 9250
Daniel H. Greene is an academic researcher from PARC. The author has contributed to research in topics: Parking guidance and information & Node (networking). The author has an hindex of 42, co-authored 159 publications receiving 9090 citations. Previous affiliations of Daniel H. Greene include Xerox.
Papers
More filters
Proceedings ArticleDOI
Epidemic algorithms for replicated database maintenance
Alan J. Demers,Daniel H. Greene,Carl Hauser,Wes Irish,John Larson,Scott Shenker,Howard E. Sturgis,Dan Swinehart,Douglas B. Terry +8 more
TL;DR: This paper descrikrs several randomized algorit, hms for dist,rihut.ing updates and driving t,he replicas toward consist,c>nc,y.
Journal ArticleDOI
Epidemic algorithms for replicated database maintenance
Alan J. Demers,Daniel H. Greene,Carl Houser,Wes Irish,John Larson,Scott Shenker,Howard E. Sturgis,Dan Swinehart,Douglas B. Terry +8 more
TL;DR: Several randomized algorithms for distributing updates and driving the replicas toward consistency are described, solving long-standing problems of high traffic and database inconsistency.
Proceedings ArticleDOI
Detecting and correcting malicious data in VANETs
TL;DR: A general approach to evaluating the validity of VANET data, where a node searches for possible explanations for the data it has collected based on the fact that malicious nodes may be present and accepts the data as dictated by the highest scoring explanations.
Proceedings ArticleDOI
Optimal algorithms for approximate clustering
Tomás Feder,Daniel H. Greene +1 more
TL;DR: This work gives a polynomial time approximation scheme that estimates the optimal number of clusters under the second measure of cluster size within factors arbitrarily close to 1 for a fixed cluster size.
BookDOI
Mathematics for the Analysis of Algorithms
Donald E. Knuth,Daniel H. Greene +1 more
TL;DR: Inverse relations with the Harmonic Numbers Recurrence Relations (HRSR) have been studied in the context of operator calculus and hypergeometric series in this article, where they have been shown to be useful in the identification of useful identities.