Publications
Export 6 results:
Author [ Title] Type Year Filters: Keyword is combinatorial problems [Clear All Filters]
1992. On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
2000. Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters. 73(1–2):29-32.
2011. Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
1994. On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.