default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel H. Greene
Person information
- affiliation: Xerox Palo Alto Research Center, CA, USA
- affiliation (PhD 1983): Stanford University, CA, USA
Other persons with the same name
- Daniel Greene — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2010 – 2019
- 2011
[j4]Daniel Greene, Juan Liu, Jim Reich, Yukio Hirokawa, Akio Shinagawa, Hayuru Ito, Tatsuo Mikami:
An Efficient Computational Architecture for a Collision Early-Warning System for Vehicles, Pedestrians, and Bicyclists. IEEE Trans. Intell. Transp. Syst. 12(4): 942-953 (2011)- 2010
- [c14]Anthony Papavasiliou
, Haitham A. Hindi, Daniel Greene:
Market-based control mechanisms for electric power demand response. CDC 2010: 1891-1898
2000 – 2009
- 2005
- [c13]Arpita Ghosh, Daniel Greene, Qingfeng Huang, Juan Liu:
Variable-resolution information dissemination. SECON 2005: 487-497 - 2004
- [c12]Philippe Golle, Daniel H. Greene, Jessica Staddon:
Detecting and correcting malicious data in VANETs. Vehicular Ad Hoc Networks 2004: 29-37 - 2002
- [c11]Kris Popat, Daniel H. Greene, Tze-Lei Poo:
Adaptive Stack Algorithm in Document Image Decoding. ICPR (4) 2002: 231-234 - 2001
- [c10]Kris Popat, Daniel H. Greene, Justin K. Romberg, Dan S. Bloomberg:
Adding linguistic constraints to document image decoding: comparing the iterated complete path and stack algorithms. Document Recognition and Retrieval 2001: 259-271
1990 – 1999
- 1998
- [c9]Daniel H. Greene, F. Frances Yao, Tong Zhang:
A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. ICIP (1) 1998: 1:508-511 - 1997
- [c8]Daniel Greene, Mohan Vishwanath, F. Frances Yao, Tong Zhang:
A progressive Ziv-Lempel algorithm for image compression. SEQUENCES 1997: 136-144 - 1994
- [j3]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
On-Line Algorithms for Locating Checkpoints. Algorithmica 11(1): 33-52 (1994) - [c7]Daniel H. Greene, Michal Parnas, F. Frances Yao:
Multi-Index Hashing for Information Retrieval. FOCS 1994: 722-731 - 1993
- [c6]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan:
On-line algorithms for cache sharing. STOC 1993: 422-430 - 1992
- [c5]Daniel H. Greene, J. Bryan Lyles:
Reliability of Adaptation Layers. Protocols for High-Speed Networks 1992: 185-200 - 1990
- [c4]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
Online Algorithms for Locating Checkpoints. STOC 1990: 359-368
1980 – 1989
- 1989
- [j2]Edward R. Fiala, Daniel H. Greene:
Data Compression with Finite Windows. Commun. ACM 32(4): 490-505 (1989) - 1988
- [j1]Alan J. Demers, Daniel H. Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard E. Sturgis, Daniel C. Swinehart, Douglas B. Terry:
Epidemic Algorithms for Replicated Database Maintenance. ACM SIGOPS Oper. Syst. Rev. 22(1): 8-32 (1988) - [c3]Tomás Feder, Daniel H. Greene:
Optimal Algorithms for Approximate Clustering. STOC 1988: 434-444 - 1987
- [c2]Alan J. Demers, Daniel H. Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard E. Sturgis, Daniel C. Swinehart, Douglas B. Terry:
Epidemic Algorithms for Replicated Database Maintenance. PODC 1987: 1-12 - 1986
- [c1]Daniel H. Greene, F. Frances Yao:
Finite-Resolution Computational Geometry. FOCS 1986: 143-152 - 1983
- [b1]Daniel H. Greene:
Labelled formal languages and their uses. Stanford University, USA, 1983
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-07-24 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
