Publications

Search
Export 6 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is combinatorial problems  [Clear All Filters]
2011
Li J, Deshpande A.  2011.  Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
2008
Mathieu C, Papamanthou C.  2008.  Distortion lower bounds for line embeddings. Information Processing Letters. 108(4):175-178.
2000
Saks M, Srinivasan A, Zhou S, Zuckerman D.  2000.  Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters. 73(1–2):29-32.
1994
Khuller S, Vishkin U.  1994.  On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
1992
Greenberg R, JaJa JF, Krishnamurthy S.  1992.  On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
Khuller S, Schieber B.  1992.  On independent spanning trees. Information Processing Letters. 42(6):321-323.