Howard J. Karloff

	2009
72		Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34
71		MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff: Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA 2009: 29-38
70		Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava: Sequential Dependencies. PVLDB 2(1): 574-585 (2009)
	2008
69		Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks: Online multicast with egalitarian cost sharing. SPAA 2008: 70-76
68		Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss: Combining geometry and combinatorics: A unified approach to sparse signal recovery CoRR abs/0804.4666: (2008)
67		Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008)
66		Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava, Bei Yu: On generating near-optimal tableaux for conditional functional dependencies. PVLDB 1(1): 376-390 (2008)
	2007
65		David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang: Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075
	2006
64		Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027
63		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556
62		Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower bounds for linear locally decodable codes and private information retrieval. Computational Complexity 15(3): 263-296 (2006)
61		Moses Charikar, Michel X. Goemans, Howard J. Karloff: On the Integrality Ratio for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 31(2): 245-252 (2006)
	2005
60		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. Combinatorica 25(3): 251-269 (2005)
59		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension Electronic Colloquium on Computational Complexity (ECCC)(064): (2005)
58		Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan: Separating Points by Axis-parallel Lines. Int. J. Comput. Geometry Appl. 15(6): 575-590 (2005)
57		Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with Expiration Times for Internet Applications. Internet Mathematics 2(2): (2005)
	2004
56		Moses Charikar, Michel X. Goemans, Howard J. Karloff: On the Integrality Ratio for Asymmetric TSP. FOCS 2004: 101-107
55		Howard J. Karloff: On the convergence time of a path-vector protocol. SODA 2004: 605-614
54		Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004)
53		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004)
	2003
52		Anna C. Gilbert, Howard J. Karloff: On the fractal behavior of TCP. STOC 2003: 297-306
51		Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564
50		Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky: A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (2003)
	2002
49		Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. IEEE Conference on Computational Complexity 2002: 175-183
48		Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani: Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414
47		Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with expiration times. SODA 2002: 540-547
46		Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner: Thresholds and optimal binary comparison search trees. J. Algorithms 44(2): 338-358 (2002)
	2001
45		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. FOCS 2001: 320-328
44		Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner: Thresholds and Optimal Binary Comparison Search Trees. FSTTCS 2001: 83-95
43		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation algorithms for the 0-extension problem. SODA 2001: 8-16
42		Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval Electronic Colloquium on Computational Complexity (ECCC)(080): (2001)
	2000
41		Ari Freund, Howard J. Karloff: A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. Inf. Process. Lett. 75(1-2): 43-50 (2000)
40		Howard J. Karloff: Foreword. J. Algorithms 37(1): 1 (2000)
39		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000)
38		Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks: A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM J. Comput. 30(5): 1624-1661 (2000)
	1999
37		Howard J. Karloff, Milena Mihail: On the Complexity of the View-Selection Problem. PODS 1999: 167-173
36		Barun Chandra, Howard J. Karloff, Craig A. Tovey: New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. SIAM J. Comput. 28(6): 1998-2029 (1999)
35		Howard J. Karloff: How Good is the Goemans-Williamson MAX CUT Algorithm? SIAM J. Comput. 29(1): 336-350 (1999)
	1998
34		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52
33		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)
32		Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28(2): 447-462 (1998)
	1997
31		Howard J. Karloff, Uri Zwick: A 7/8-Approximation Algorithm for MAX 3SAT? FOCS 1997: 406-415
30		Howard J. Karloff, Yishay Mansour: On Construction of k-Wise Independent Random Variables. Combinatorica 17(1): 91-107 (1997)
	1996
29		Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25
28		Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks: Randomized Robot Navigation Algorithms. SODA 1996: 75-84
27		Howard J. Karloff: How Good is the Goemans-Williamson MAX CUT Algorithm? STOC 1996: 427-434
	1995
26		Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem. J. Comput. Syst. Sci. 51(3): 359-366 (1995)
	1994
25		Barun Chandra, Howard J. Karloff, Craig A. Tovey: New Results on the Old k-Opt Algorithm for the TSP. SODA 1994: 150-159
24		Yair Bartal, Howard J. Karloff, Yuval Rabani: A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994)
23		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)
	1993
22		Howard J. Karloff: Fast Algorithms for Approximately Counting Mismatches. Inf. Process. Lett. 48(2): 53-60 (1993)
21		Howard J. Karloff, Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers. J. ACM 40(3): 454-476 (1993)
	1992
20		Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks: A Decomposition Theorem and Bounds for Randomized Server Problems FOCS 1992: 197-207
19		Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem STOC 1992: 51-58
18		Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)
17		Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber: Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106(2): 265-281 (1992)
	1991
16		Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal FOCS 1991: 288-297
15		Howard J. Karloff, Yuval Rabani, Yiftach Ravid: Lower Bounds for Randomized k-Server and Motion Planning Algorithms STOC 1991: 278-288
14		Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability Inf. Comput. 91(2): 177-188 (1991)
13		Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: New Results on Server Problems. SIAM J. Discrete Math. 4(2): 172-181 (1991)
	1990
12		Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems FOCS 1990: 2-10
11		Piotr Berman, Howard J. Karloff, Gábor Tardos: A Competitive 3-Server Algorithm. SODA 1990: 280-290
10		Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: title=New Results on Server Problems. SODA 1990: 291-300
	1989
9		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
8		Howard J. Karloff, Walter L. Ruzzo: The Iterated Mod Problem Inf. Comput. 80(3): 193-204 (1989)
7		Howard J. Karloff: How Long can a Euclidean Traveling Salesman Tour Be? SIAM J. Discrete Math. 2(1): 91-99 (1989)
6		Howard J. Karloff: An NC Algorithm for Brooks' Theorem. Theor. Comput. Sci. 68(1): 89-103 (1989)
	1988
5		Howard J. Karloff, Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers STOC 1988: 310-321
4		Howard J. Karloff, Ramamohan Paturi, Janos Simon: Universal Traversal Sequences of Length n^O(log n) for Cliques. Inf. Process. Lett. 28(5): 241-243 (1988)
	1987
3		Howard J. Karloff, David B. Shmoys: Efficient Parallel Algorithms for Edge Coloring Problems. J. Algorithms 8(1): 39-52 (1987)
2		Joan Boyar, Howard J. Karloff: Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987)
	1986
1		Howard J. Karloff: A Las Vegas RNC algorithm for maximum matching. Combinatorica 6(4): 387-391 (1986)

Coauthor Index

1	Richard J. Anderson	[44] [46]
2	David Applegate	[65]
3	Yair Bartal	[19] [24] [26]
4	MohammadHossein Bateni	[71]
5	Radu Berinde	[68]
6	Piotr Berman	[11] [28]
7	Marshall W. Bern	[9] [17]
8	Avrim Blum	[20] [28] [38]
9	Joan Boyar	[2]
10	Adam L. Buchsbaum	[51] [54]
11	Gruia Calinescu	[29] [33] [34] [39] [43] [48] [50] [53] [58] [65]
12	Amit Chakrabarti	[48]
13	Barun Chandra	[25] [36]
14	Moses Charikar	[56] [61] [64] [69] [72]
15	Joseph Cheriyan	[45] [60] [67]
16	Marek Chrobak	[10] [13] [14]
17	Adrian Dumitrescu	[58]
18	Cristina G. Fernandes	[29] [33] [50]
19	Amos Fiat	[16] [19] [26] [28] [32]
20	Ulrich Finkler	[29] [33]
21	Lance Fortnow	[12] [18]
22	Dean P. Foster	[16] [32]
23	Ari Freund	[41]
24	Anna C. Gilbert	[52] [68]
25	Michel X. Goemans	[56] [61]
26	Lukasz Golab	[66] [70] [71]
27	Oded Goldreich	[42] [49] [62]
28	Parikshit Gopalan	[47] [57]
29	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[64] [71] [72]
30	Piotr Indyk	[68]
31	David S. Johnson	[65]
32	Sampath Kannan	[44] [46]
33	Rohit Khandekar	[67]
34	Subhash Khot	[59] [63]
35	Jochen Könemann	[67]
36	Flip Korn	[66] [70]
37	Richard E. Ladner	[44] [46]
38	Katrina Ligett	[65]
39	Carsten Lund	[12] [18]
40	Yishay Mansour	[30]
41	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[51] [54] [69]
42	Aranyak Mehta	[47] [57] [59] [63]
43	Milena Mihail	[37] [47] [57]
44	Joseph Naor (Seffi Naor)	[69]
45	Noam Nisan	[12] [18]
46	Ramamohan Paturi	[4]
47	Thomas H. Payne (T. H. Payne)	[10] [13]
48	Yuval Rabani	[15] [16] [20] [23] [24] [32] [34] [38] [39] [43] [45] [48] [53] [59] [60] [63]
49	Tomasz Radzik	[14]
50	Prabhakar Raghavan	[5] [9] [17] [21]
51	Satish Rao	[64]
52	Yiftach Ravid	[15] [16] [23] [32]
53	Nick Reingold	[51] [54]
54	Adi Rosén	[28]
55	Walter L. Ruzzo	[8]
56	Avishek Saha	[70]
57	Michael E. Saks	[20] [28] [38] [69]
58	Baruch Schieber	[9] [17]
59	Leonard J. Schulman	[42] [49] [62]
60	David B. Shmoys	[3]
61	Janos Simon	[4]
62	Divesh Srivastava	[66] [70]
63	Martin Strauss (Martin J. Strauss)	[68]
64	Gábor Tardos	[11]
65	Mikkel Thorup	[51] [54]
66	Craig A. Tovey	[25] [36]
67	Luca Trevisan	[42] [49] [62]
68	Nisheeth K. Vishnoi	[47] [57]
69	Sundar Vishwanathan	[10] [13] [16] [32]
70	Rakesh V. Vohra (Rakesh Vohra)	[19] [26]
71	Peng-Jun Wan	[58]
72	Jia Wang	[65]
73	Bei Yu	[66]
74	Alexander Zelikovsky	[50]
75	Uri Zwick	[31]