default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhillip G. Bradford
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Agron Gemajli, Shivam Patel, Phillip G. Bradford:
Towards a low carbon proof-of-work blockchain. CoRR abs/2404.04729 (2024)- 2023
- [j16]Marcus Tanque, Phillip G. Bradford:
Chapter Six - Virtual Raspberry Pi-s with blockchain and cybersecurity applications. Advances in Computers 131: 201-232 (2023)
2010 – 2019
- 2018
- [c26]Phillip G. Bradford:
Preliminary exploration of co-functional gene networks for wireless sensor networks. CCWC 2018: 1005-1008 - [i2]Phillip G. Bradford:
Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability. CoRR abs/1802.05239 (2018) - 2017
- [c25]Phillip G. Bradford:
Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract). UEMCON 2017: 247-253 - 2016
- [c24]Phillip G. Bradford, Venkatesh Choppella:
Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract). UEMCON 2016: 1-7
2000 – 2009
- 2009
- [j15]Phillip G. Bradford, David A. Thomas:
Labeled shortest paths in digraphs with negative and positive edge weights. RAIRO Theor. Informatics Appl. 43(3): 567-583 (2009) - 2008
- [j14]Phillip G. Bradford, Sunju Park, Michael H. Rothkopf, Heejin Park:
Protocol completion incentive problems in cryptographic Vickrey auctions. Electron. Commer. Res. 8(1-2): 57-77 (2008) - [j13]Lei Tang, Xiaoyan Hong, Phillip G. Bradford:
Privacy-preserving secure relative localization in vehicular networks. Secur. Commun. Networks 1(3): 195-204 (2008) - [c23]Phillip G. Bradford, Daniel A. Ray:
Semantics for a domain-specific language for the digital forensics domain. CSIIRW 2008: 11:1-11:3 - [c22]Phillip G. Bradford, Daniel A. Ray:
Requirements for Digital Forensics Investigation Domain-Specific Languages. Security and Management 2008: 428-434 - [c21]Charles B. Ward, Nathan M. Wiegand, Phillip G. Bradford:
A Distributed Context-Free Language Constrained Shortest Path Algorithm. ICPP 2008: 373-380 - 2007
- [j12]Phillip G. Bradford, Michael N. Katehakis:
A Probabilistic Study on Combinatorial Expanders and Hashing. SIAM J. Comput. 37(1): 83-111 (2007) - [c20]Phillip G. Bradford, Alina Olteanu
:
Issues in Simulation for Valuing Long-Term Forwards. SCSS (1) 2007: 394-398 - [c19]Phillip G. Bradford, Daniel A. Ray:
Finding the Change-Point in a Binary Stream with Two Unknown, but Distant, Distributions. Security and Management 2007: 426-431 - [c18]Daniel A. Ray, Phillip G. Bradford:
An Integrated System for Insider Threat Detection. IFIP Int. Conf. Digital Forensics 2007: 75-86 - [c17]Phillip G. Bradford, Daniel A. Ray:
Using Digital Chains of Custody on Constrained Devices to Verify Evidence. ISI 2007: 8-15 - [i1]Phillip G. Bradford, Daniel A. Ray:
An online algorithm for generating fractal hash chains applied to digital chains of custody. CoRR abs/0705.2876 (2007) - 2006
- [j11]Victoria Ungureanu, Benjamin Melamed, Michael N. Katehakis, Phillip G. Bradford:
Deferred Assignment Scheduling in Cluster-Based Servers. Clust. Comput. 9(1): 57-65 (2006) - [j10]Phillip G. Bradford, Olga V. Gavrylyako:
Hash chains with diminishing ranges for sensors. Int. J. High Perform. Comput. Netw. 4(1/2): 31-38 (2006) - [c16]Ning Hu, Phillip G. Bradford, Jun Liu:
Applying role based access control and genetic algorithms to insider threat detection. ACM Southeast Regional Conference 2006: 790-791 - [c15]Phillip G. Bradford, Irina Perevalova, Michiel H. M. Smid, Charles B. Ward:
Indicator Random Variables in Traffic Analysis and the Birthday Problem. LCN 2006: 1016-1023 - [c14]Lei Tang, Xiaoyan Hong, Phillip G. Bradford:
Secure Relative Location Determination in Vehicular Network. MSN 2006: 543-554 - 2005
- [j9]Phillip G. Bradford, Olga V. Gavrylyako:
Foundations of Security for Hash Chains in Ad Hoc Networks. Clust. Comput. 8(2-3): 189-195 (2005) - [c13]Phillip G. Bradford, Olga V. Gavrylyako, Charles B. Ward, Nathan M. Wiegand:
A Proposal for a Multimedia Traffic Analysis Attack. ICWN 2005: 261-267 - 2004
- [c12]Shuang Liu, Olga V. Gavrylyako, Phillip G. Bradford:
Implementing the TEA algorithm on sensors. ACM Southeast Regional Conference 2004: 64-69 - [c11]Ning Hu, Randy K. Smith, Phillip G. Bradford:
Security for fixed sensor networks. ACM Southeast Regional Conference 2004: 212-213 - [c10]Phillip G. Bradford, Olga V. Gavrylyako:
Hash Chains with Diminishing Ranges for Sensors. ICPP Workshops 2004: 77-83 - [c9]Phillip G. Bradford, Marcus Brown, Josh Perdue, Bonnie Self:
Towards Proactive Computer-System Forensics. ITCC (2) 2004: 648-652 - [c8]Victoria Ungureanu, Benjamin Melamed, Phillip G. Bradford, Michael N. Katehakis:
Class-Dependent Assignment in cluster-based servers. SAC 2004: 1420-1425 - 2003
- [c7]Phillip G. Bradford, Olga V. Gavrylyako:
Foundations of Security for Hash Chains in Ad Hoc Networks. ICDCS Workshops 2003: 743-748 - [c6]Phillip G. Bradford, Olga V. Gavrylyako, Randy K. Smith:
Perfect Secrecy in Wireless Networks. ICPP Workshops 2003: 409-416 - 2002
- [j8]Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42(2): 277-303 (2002) - 2001
- [j7]Phillip G. Bradford, Herbert E. Brown, Paula M. Saunders:
Pricing, Agents, Perceived Value and the Internet. First Monday 6(6) (2001) - 2000
- [j6]Paul Walton Purdom Jr., Phillip G. Bradford, Koichiro Tamura, Sudhir Kumar:
Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees. Bioinform. 16(2): 140-151 (2000)
1990 – 1999
- 1998
- [j5]Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time. SIAM J. Comput. 27(2): 466-490 (1998) - [c5]Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA 1998: 43-54 - 1997
- [j4]Phillip G. Bradford, Vasilis Capoyleas:
Weak epsilon-Nets for Points on a Hypersphere. Discret. Comput. Geom. 18(1): 83-91 (1997) - [j3]Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid:
More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997) - 1996
- [j2]Noga Alon, Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. Inf. Process. Lett. 59(3): 123-127 (1996) - [c4]Phillip G. Bradford, Knut Reinert:
Lower Bounds for Row Minima Searching (Extended Abstract). ICALP 1996: 454-465 - 1995
- [j1]Phillip G. Bradford, Michael Wollowski:
A Formalization of the Turing Test. SIGART Bull. 6(4): 3-10 (1995) - [c3]Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. ISAAC 1995: 402-408 - [c2]Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins:
Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract). LATIN 1995: 112-130 - 1994
- [c1]Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time. IPPS 1994: 234-241
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 2025-01-20 22:58 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
