Phillip G. Bradford

According to our database1, Phillip G. Bradford authored at least 41 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards a low carbon proof-of-work blockchain.
CoRR, 2024

2023
Chapter Six - Virtual Raspberry Pi-s with blockchain and cybersecurity applications.
Advances in Computers, 2023

2018
Efficient Exact Paths For Dyck and semi-Dyck Labeled Path Reachability.
CoRR, 2018

Preliminary exploration of co-functional gene networks for wireless sensor networks.
Proceedings of the IEEE 8th Annual Computing and Communication Workshop and Conference, 2018

2017
Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract).
Proceedings of the 8th IEEE Annual Ubiquitous Computing, 2017

2016
Fast point-to-point Dyck constrained shortest paths on a DAG (Extended abstract).
Proceedings of the 7th IEEE Annual Ubiquitous Computing, 2016

2009
Labeled shortest paths in digraphs with negative and positive edge weights.
RAIRO Theor. Informatics Appl., 2009

2008
Privacy-preserving secure relative localization in vehicular networks.
Secur. Commun. Networks, 2008

Protocol completion incentive problems in cryptographic Vickrey auctions.
Electron. Commer. Res., 2008

A Distributed Context-Free Language Constrained Shortest Path Algorithm.
Proceedings of the 2008 International Conference on Parallel Processing, 2008

Requirements for Digital Forensics Investigation Domain-Specific Languages.
Proceedings of the 2008 International Conference on Security & Management, 2008

Semantics for a domain-specific language for the digital forensics domain.
Proceedings of the 4th annual workshop on Cyber security and information intelligence research, 2008

2007
A Probabilistic Study on Combinatorial Expanders and Hashing.
SIAM J. Comput., 2007

An online algorithm for generating fractal hash chains applied to digital chains of custody
CoRR, 2007

Using Digital Chains of Custody on Constrained Devices to Verify Evidence.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2007

An Integrated System for Insider Threat Detection.
Proceedings of the Advances in Digital Forensics III, 2007

Finding the Change-Point in a Binary Stream with Two Unknown, but Distant, Distributions.
Proceedings of the 2007 International Conference on Security & Management, 2007

Issues in Simulation for Valuing Long-Term Forwards.
Proceedings of the Advances in Computer and Information Sciences and Engineering, 2007

2006
Hash chains with diminishing ranges for sensors.
Int. J. High Perform. Comput. Netw., 2006

Deferred Assignment Scheduling in Cluster-Based Servers.
Clust. Comput., 2006

Secure Relative Location Determination in Vehicular Network.
Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

Indicator Random Variables in Traffic Analysis and the Birthday Problem.
Proceedings of the LCN 2006, 2006

Applying role based access control and genetic algorithms to insider threat detection.
Proceedings of the 44st Annual Southeast Regional Conference, 2006

2005
Foundations of Security for Hash Chains in Ad Hoc Networks.
Clust. Comput., 2005

A Proposal for a Multimedia Traffic Analysis Attack.
Proceedings of the 2005 International Conference on Wireless Networks, 2005

2004
Class-Dependent Assignment in cluster-based servers.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

Towards Proactive Computer-System Forensics.
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

Implementing the TEA algorithm on sensors.
Proceedings of the 42nd Annual Southeast Regional Conference, 2004

Security for fixed sensor networks.
Proceedings of the 42nd Annual Southeast Regional Conference, 2004

2003
Perfect Secrecy in Wireless Networks.
Proceedings of the 32nd International Conference on Parallel Processing Workshops (ICPP 2003 Workshops), 2003

2002
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property.
J. Algorithms, 2002

2001
Pricing, Agents, Perceived Value and the Internet.
First Monday, 2001

2000
Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees.
Bioinform., 2000

1998
Efficient Matrix Chain Ordering in Polylog Time.
SIAM J. Comput., 1998

1997
More Efficient Parallel Totally Monotone Matrix Searching.
J. Algorithms, 1997

Weak epsilon-Nets for Points on a Hypersphere.
Discret. Comput. Geom., 1997

1996
Matching Nuts and Bolts Faster.
Inf. Process. Lett., 1996

Lower Bounds for Row Minima Searching (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
A Formalization of the Turing Test.
SIGART Bull., 1995

Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Matching Nuts and Bolts Faster.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995


  Loading...