2008 | ||
---|---|---|
36 | EE | Charles B. Ward, Nathan M. Wiegand, Phillip G. Bradford: A Distributed Context-Free Language Constrained Shortest Path Algorithm. ICPP 2008: 373-380 |
35 | EE | Phillip G. Bradford, Sunju Park, Michael H. Rothkopf, Heejin Park: Protocol completion incentive problems in cryptographic Vickrey auctions. Electronic Commerce Research 8(1-2): 57-77 (2008) |
34 | EE | Lei Tang, Xiaoyan Hong, Phillip G. Bradford: Privacy-preserving secure relative localization in vehicular networks. Security and Communication Networks 1(3): 195-204 (2008) |
2007 | ||
33 | EE | Daniel A. Ray, Phillip G. Bradford: An Integrated System for Insider Threat Detection. IFIP Int. Conf. Digital Forensics 2007: 75-86 |
32 | EE | Phillip G. Bradford, Daniel A. Ray: Using Digital Chains of Custody on Constrained Devices to Verify Evidence. ISI 2007: 8-15 |
31 | EE | Phillip G. Bradford, Alina Olteanu: Issues in Simulation for Valuing Long-Term Forwards. SCSS (1) 2007: 394-398 |
30 | 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 | |
29 | EE | 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) |
28 | EE | Phillip G. Bradford, Michael N. Katehakis: A Probabilistic Study on Combinatorial Expanders and Hashing. SIAM J. Comput. 37(1): 83-111 (2007) |
2006 | ||
27 | EE | 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 |
26 | EE | 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 |
25 | EE | Lei Tang, Xiaoyan Hong, Phillip G. Bradford: Secure Relative Location Determination in Vehicular Network. MSN 2006: 543-554 |
24 | EE | Victoria Ungureanu, Benjamin Melamed, Michael Katehakis, Phillip G. Bradford: Deferred Assignment Scheduling in Cluster-Based Servers. Cluster Computing 9(1): 57-65 (2006) |
23 | EE | Phillip G. Bradford, Olga V. Gavrylyako: Hash chains with diminishing ranges for sensors. IJHPCN 4(1/2): 31-38 (2006) |
2005 | ||
22 | Phillip G. Bradford, Olga V. Gavrylyako, Charles B. Ward, Nathan M. Wiegand: A Proposal for a Multimedia Traffic Analysis Attack. ICWN 2005: 261-267 | |
21 | EE | Phillip G. Bradford, Olga V. Gavrylyako: Foundations of Security for Hash Chains in Ad Hoc Networks. Cluster Computing 8(2-3): 189-195 (2005) |
2004 | ||
20 | EE | Ning Hu, Randy K. Smith, Phillip G. Bradford: Security for fixed sensor networks. ACM Southeast Regional Conference 2004: 212-213 |
19 | EE | Shuang Liu, Olga V. Gavrylyako, Phillip G. Bradford: Implementing the TEA algorithm on sensors. ACM Southeast Regional Conference 2004: 64-69 |
18 | EE | Phillip G. Bradford, Olga V. Gavrylyako: Hash Chains with Diminishing Ranges for Sensors. ICPP Workshops 2004: 77-83 |
17 | EE | Phillip G. Bradford, Marcus Brown, Josh Perdue, Bonnie Self: Towards Proactive Computer-System Forensics. ITCC (2) 2004: 648-652 |
16 | EE | Victoria Ungureanu, Benjamin Melamed, Phillip G. Bradford, Michael Katehakis: Class-Dependent Assignment in cluster-based servers. SAC 2004: 1420-1425 |
2003 | ||
15 | EE | Phillip G. Bradford, Olga V. Gavrylyako: Foundations of Security for Hash Chains in Ad Hoc Networks. ICDCS Workshops 2003: 743-748 |
14 | EE | Phillip G. Bradford, Olga V. Gavrylyako, Randy K. Smith: Perfect Secrecy in Wireless Networks. ICPP Workshops 2003: 409-416 |
2002 | ||
13 | EE | 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 | ||
12 | EE | Phillip G. Bradford, Herbert E. Brown, Paula M. Saunders: Pricing, Agents, Perceived Value and the Internet. First Monday 6(6): (2001) |
2000 | ||
11 | 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. Bioinformatics 16(2): 140-151 (2000) | |
1998 | ||
10 | EE | 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 |
9 | 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) | |
1997 | ||
8 | EE | Phillip G. Bradford, Vasilis Capoyleas: Weak epsilon-Nets for Points on a Hypersphere. Discrete & Computational Geometry 18(1): 83-91 (1997) |
7 | Phillip G. Bradford, Rudolf Fleischer, Michiel H. M. Smid: More Efficient Parallel Totally Monotone Matrix Searching. J. Algorithms 23(2): 386-400 (1997) | |
1996 | ||
6 | Phillip G. Bradford, Knut Reinert: Lower Bounds for Row Minima Searching (Extended Abstract). ICALP 1996: 454-465 | |
5 | EE | Noga Alon, Phillip G. Bradford, Rudolf Fleischer: Matching Nuts and Bolts Faster. Inf. Process. Lett. 59(3): 123-127 (1996) |
1995 | ||
4 | Phillip G. Bradford, Rudolf Fleischer: Matching Nuts and Bolts Faster. ISAAC 1995: 402-408 | |
3 | Phillip G. Bradford, Venkatesh Chopella, Gregory J. E. Rawlins: Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract). LATIN 1995: 112-130 | |
2 | Phillip G. Bradford, Michael Wollowski: A Formalization of the Turing Test. SIGART Bulletin 6(4): 3-10 (1995) | |
1994 | ||
1 | Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon: Efficient Matrix Chain Ordering in Polylog Time. IPPS 1994: 234-241 |