Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bradford, Phillip G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A probabilistic study on combinatorial expanders and hashing
Phillip G. Bradford
,
Michael N. Katehakis
SIAM Journal on Computing
37
(1), 2007, pp. 83-111
Efficient matrix chain ordering in polylog time
Phillip G. Bradford
,
Gregory J.E. Rawlins
,
Gregory E. Shannon
SIAM Journal on Computing
27
(2), 1998, pp. 466-490
More efficient parallel totally monotone matrix searching
Phillip G. Bradford
,
Rudolf Fleischer
,
Michiel Smid
Journal of Algorithms
23
(2), 1997, pp. 386-400
Matching nuts and bolts faster
Noga Alon
,
Phillip G. Bradford
,
Rudolf Fleischer
Information Processing Letters
59
(3), 1996, pp. 123-127
Lower bounds for row minima searching
Phillip G. Bradford
,
Knut Reinert
Lecture Notes in Computer Science
1099
, 1996, pp. 454-465
Lower bounds for the matrix chain ordering problem
Phillip G. Bradford
,
Venkatesh Choppella
,
Gregory J.E. Rawlins
Lecture Notes in Computer Science
911
, 1995, pp. 112-130
Matching nuts and bolts faster
Phillip G. Bradford
,
Rudolf Fleischer
Lecture Notes in Computer Science
1004
, 1995, pp. 402-408
Efficient matrix chain ordering in polylog time
Phillip G. Bradford
,
Gregory J.E. Rawlins
,
Gregory E. Shannon
Proceedings of the 8th International Parallel Processing Symposium, IPPS'94 (CancĂșn, Mexico, April 26-29, 1994)
, 1994, pp. 234-241