Feder, Tomás; Motwani, Rajeev; O’Callaghan, Liadan; Olston, Chris; Panigrahy, Rina Computing shortest paths with uncertainty. (English) Zbl 1115.68111 J. Algorithms 62, No. 1, 1-18 (2007). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{T. Feder} et al., J. Algorithms 62, No. 1, 1--18 (2007; Zbl 1115.68111) Full Text: DOI
Feder, T.; Motwani, R.; O’Callaghan, L.; Olston, C.; Panigrahy, R. Computing shortest paths with uncertainty. (English) Zbl 1035.68079 Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 367-378 (2003). MSC: 68R10 68W25 68Q17 05C85 PDFBibTeX XMLCite \textit{T. Feder} et al., Lect. Notes Comput. Sci. 2607, 367--378 (2003; Zbl 1035.68079) Full Text: Link
Feder, Tomás; Motwani, Rajeev; Panigrahy, Rina; Olston, Chris; Widom, Jennifer Computing the median with uncertainty. (English) Zbl 1029.68161 SIAM J. Comput. 32, No. 2, 538-547 (2003). MSC: 68W25 68P99 PDFBibTeX XMLCite \textit{T. Feder} et al., SIAM J. Comput. 32, No. 2, 538--547 (2003; Zbl 1029.68161) Full Text: DOI
Feder, Tomas; Motwani, Rajeev; Panigrahy, Rina; Olston, Chris; Widom, Jennifer Computing the median with uncertainty. (English) Zbl 1296.65014 Proceedings of the thirty-second annual ACM symposium on theory of computing (STOC 2000), Portland, Oregon, USA, May 21–23, 2000. New York, NY: ACM Press (ISBN 1-58113-184-4). 602-607 (2000). MSC: 65C50 68W27 PDFBibTeX XMLCite \textit{T. Feder} et al., in: Proceedings of the thirty-second annual ACM symposium on theory of computing, STOC 2000. Portland, Oregon, USA, May 21--23, 2000. New York, NY: ACM Press. 602--607 (2000; Zbl 1296.65014) Full Text: DOI