Publications
Export 481 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is K [Clear All Filters]
2008. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. Algorithms-ESA 2008. :601-610.
1991. Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
1995. A simple randomized sieve algorithm for the closest-pair problem. Information and Computation. 118(1):34-37.
2006. Improved algorithms for data migration. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :164-175.
1989. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. Foundations of Computer Science, 1989., 30th Annual Symposium on. :288-293.
1995. Improved approximation algorithms for uniform connectivity problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :1-10.
2007. Finding most probable worlds of probabilistic logic programs. Scalable Uncertainty Management. :45-59.
1994. On the parallel complexity of digraph reachability. Information Processing Letters. 52(5):239-241.
2007. Finding Most Probable Worlds of Probabilistic Logic Programs. Scalable Uncertainty Management. 4772:45-59.
1998. Facility Location with Dynamic Distance Functions. Journal of Combinatorial Optimization. 2(3):199-217.
2005. Broadcasting on networks of workstations. Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures. :279-288.
1993. The lattice structure of flow in planar graphs. SIAM Journal on Discrete Mathematics. 6:477-477.
2000. On local search and placement of meters in networks. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :319-328.
2007. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 10^30,000 worlds. Annals of Mathematics and Artificial Intelligence. 51(2):295-331.