Phillip G. Bradford

From MaRDI portal
Person:671401

Available identifiers

zbMath Open bradford.phillip-gMaRDI QIDQ671401

List of research outcomes





PublicationDate of PublicationType
Matching nuts and bolts faster2023-03-21Paper
Lower bounds for the matrix chain ordering problem2022-08-16Paper
Labeled shortest paths in digraphs with negative and positive edge weights2009-07-15Paper
Protocol completion incentive problems in cryptographic Vickrey auctions2008-07-31Paper
A Probabilistic Study on Combinatorial Expanders and Hashing2008-03-28Paper
https://portal.mardi4nfdi.de/entity/Q48188572004-09-24Paper
Efficient Matrix Chain Ordering in Polylog Time1998-05-10Paper
More Efficient Parallel Totally Monotone Matrix Searching1997-11-10Paper
Weak \(\varepsilon\)-nets for points on a hypersphere1997-10-19Paper
Matching nuts and bolts faster1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q47119591992-06-25Paper

Research outcomes over time

This page was built for person: Phillip G. Bradford

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:671401&oldid=10936791"
Powered by MediaWiki