![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 2 | Ketan Mulmuley, Pradyut Shah: A Lower Bound for the Shortest Path Problem. J. Comput. Syst. Sci. 63(2): 253-267 (2001) | |
| 1 | Ketan Mulmuley, Pradyut Shah: A Lower Bound for the Shortest Path Problem. IEEE Conference on Computational Complexity 2000: 14-21 |
Selection of 2 from 3 records - Pradyut Shah has 2 coauthors
Last update 2012-02-17 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page