Digital Symposium Collection 2000  

 
 
 
 
 
 

 














Howard J. Karloff

On the Complexity of the View-Selection Problem

Publications

Note: Links lead to the DBLP on the Web.

Howard J. Karloff

30 Howard J. Karloff, Milena Mihail : On the Complexity of the View-Selection Problem. PODS 1999 : 167-173

29 Gruia Calinescu , Howard J. Karloff, Yuval Rabani : An Improved Approximation Algorithm for Multiway Cut. STOC 1998 : 48-52

28 Gruia Calinescu , Cristina G. Fernandes , Ulrich Finkler , Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27 (2): 269-302 (1998)

27 Gruia Calinescu , Cristina G. Fernandes , Ulrich Finkler , Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996 : 16-25

26 Piotr Berman , Avrim Blum , Amos Fiat , Howard J. Karloff, Adi Rosén , Michael E. Saks : Randomized Robot Navigation Algorithms. SODA 1996 : 75-84

25 Howard J. Karloff: How Good is the Goemans-Williamson MAX CUT Algorithm? STOC 1996 : 427-434

24 Yair Bartal , Amos Fiat , Howard J. Karloff, Rakesh Vohra : New Algorithms for an Ancient Scheduling Problem. JCSS 51 (3): 359-366 (1995)

23 Barun Chandra , Howard J. Karloff, Craig A. Tovey : New Results on the Old k-Opt Algorithm for the TSP. SODA 1994 : 150-159

22 Howard J. Karloff, Yishay Mansour : On Construction of k-wise Independent Random Variables. STOC 1994 : 564-573

21 Yair Bartal , Howard J. Karloff, Yuval Rabani : A Better Lower Bound for On-Line Scheduling. IPL 50 (3): 113-116 (1994)

20 Howard J. Karloff, Yuval Rabani , Yiftach Ravid : Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. SIAM J. Comput. 23 (2): 293-312 (1994)

19 Howard J. Karloff: Fast Algorithms for Approximately Counting Mismatches. IPL 48 (2): 53-60 (1993)

18 Howard J. Karloff, Prabhakar Raghavan : Randomized Algorithms and Pseudorandom Numbers. JACM 40 (3): 454-476 (1993)

17 Avrim Blum , Howard J. Karloff, Yuval Rabani , Michael E. Saks : A Decomposition Theorem and Bounds for Randomized Server Problems. FOCS 1992 : 197-207

16 Yair Bartal , Amos Fiat , Howard J. Karloff, Rakesh Vohra : New Algorithms for an Ancient Scheduling Problem. STOC 1992 : 51-58

15 Carsten Lund , Lance Fortnow , Howard J. Karloff, Noam Nisan : Algebraic Methods for Interactive Proof Systems. JACM 39 (4): 859-868 (1992)

14 Marshall W. Bern , Howard J. Karloff, Prabhakar Raghavan , Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. TCS 106 (2): 265-281 (1992)

13 Amos Fiat , Dean P. Foster , Howard J. Karloff, Yuval Rabani , Yiftach Ravid , Sundar Vishwanathan : Competitive Algorithms for Layered Graph Traversal. FOCS 1991 : 288-297

12 Howard J. Karloff, Yuval Rabani , Yiftach Ravid : Lower Bounds for Randomized k-Server and Motion Planning Algorithms. STOC 1991 : 278-288

11 Marek Chrobak , Howard J. Karloff, Tomasz Radzik : Connectivity vs. Reachability. Information and Computation 91 (2): 177-188 (1991)

10 Carsten Lund , Lance Fortnow , Howard J. Karloff, Noam Nisan : Algebraic Methods for Interactive Proof Systems. FOCS 1990 : 2-10

9 Piotr Berman , Howard J. Karloff, Gábor Tardos : A Competitive 3-Server Algorithm. SODA 1990 : 280-290

8 Marek Chrobak , Howard J. Karloff, T. H. Payne , Sundar Vishwanathan : title={New Results on Server Problems. SODA 1990 : 291-300

7 Marshall W. Bern , Howard J. Karloff, Prabhakar Raghavan , Baruch Schieber : Fast Geometric Approximation Techniques and Geometric Embedding Problems. Symposium on Computational Geometry 1989 : 292-301

6 Howard J. Karloff, Walter L. Ruzzo : The Iterated Mod Problem. Information and Computation 80 (3): 193-204 (1989)

5 Howard J. Karloff: An NC Algorithm for Brooks' Theorem. TCS 68 (1): 89-103 (1989)

4 Howard J. Karloff, Prabhakar Raghavan : Randomized Algorithms and Pseudorandom Numbers. STOC 1988 : 310-321

3 Howard J. Karloff, Ramamohan Paturi , Janos Simon : Universal Traversal Sequences of Length n^O(log n) for Cliques. IPL 28 (5): 241-243 (1988)

2 Howard J. Karloff, David B. Shmoys : Efficient Parallel Algorithms for Edge Coloring Problems. J. Algorithms 8 (1): 39-52 (1987)

1 Joan Boyar , Howard J. Karloff: Coloring Planar Graphs in Parallel. J. Algorithms 8 (4): 470-479 (1987)



























Copyright(C) 2000 ACM