Howard J. Karloff

	2010
76		Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010)
	2009
75		Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34
74		Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff: Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436
73		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
72		Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava: Sequential Dependencies. PVLDB 2(1): 574-585 (2009)
71		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39(2): 371-387 (2009)
	2008
70		Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks: Online multicast with egalitarian cost sharing. SPAA 2008: 70-76
69		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)
68		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)
67		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
66		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
65		Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao: l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027
64		Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556
63		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)
62		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
61		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. Combinatorica 25(3): 251-269 (2005)
60		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)
59		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)
58		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
57		Moses Charikar, Michel X. Goemans, Howard J. Karloff: On the Integrality Ratio for Asymmetric TSP. FOCS 2004: 101-107
56		Howard J. Karloff: On the convergence time of a path-vector protocol. SODA 2004: 605-614
55		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)
54		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004)
	2003
53		Anna C. Gilbert, Howard J. Karloff: On the fractal behavior of TCP. STOC 2003: 297-306
52		Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564
51		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
50		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
49		Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani: Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414
48		Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with expiration times. SODA 2002: 540-547
47		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
46		Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. FOCS 2001: 320-328
45		Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner: Thresholds and Optimal Binary Comparison Search Trees. FSTTCS 2001: 83-95
44		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation algorithms for the 0-extension problem. SODA 2001: 8-16
43		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
42		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)
41		Howard J. Karloff: Foreword. J. Algorithms 37(1): 1 (2000)
40		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000)
39		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
38		Howard J. Karloff, Milena Mihail: On the Complexity of the View-Selection Problem. PODS 1999: 167-173
37		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)
36		Howard J. Karloff: How Good is the Goemans-Williamson MAX CUT Algorithm? SIAM J. Comput. 29(1): 336-350 (1999)
	1998
35		Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52
34		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)
33		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
32		Howard J. Karloff, Uri Zwick: A 7/8-Approximation Algorithm for MAX 3SAT? FOCS 1997: 406-415
31		Howard J. Karloff, Yishay Mansour: On Construction of k-Wise Independent Random Variables. Combinatorica 17(1): 91-107 (1997)
	1996
30		Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25
29		Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks: Randomized Robot Navigation Algorithms. SODA 1996: 75-84
28		Howard J. Karloff: How Good is the Goemans-Williamson MAX CUT Algorithm? STOC 1996: 427-434
	1995
27		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
26		Barun Chandra, Howard J. Karloff, Craig A. Tovey: New Results on the Old k-Opt Algorithm for the TSP. SODA 1994: 150-159
25		Yair Bartal, Howard J. Karloff, Yuval Rabani: A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994)
24		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
23		Howard J. Karloff: Fast Algorithms for Approximately Counting Mismatches. Inf. Process. Lett. 48(2): 53-60 (1993)
22		Howard J. Karloff, Prabhakar Raghavan: Randomized Algorithms and Pseudorandom Numbers. J. ACM 40(3): 454-476 (1993)
	1992
21		Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks: A Decomposition Theorem and Bounds for Randomized Server Problems FOCS 1992: 197-207
20		Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem STOC 1992: 51-58
19		Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)
18		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
17		Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan: Competitive Algorithms for Layered Graph Traversal FOCS 1991: 288-297
16		Howard J. Karloff, Yuval Rabani, Yiftach Ravid: Lower Bounds for Randomized k-Server and Motion Planning Algorithms STOC 1991: 278-288
15		Marek Chrobak, Howard J. Karloff, Tomasz Radzik: Connectivity vs. Reachability Inf. Comput. 91(2): 177-188 (1991)
14		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
13		Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems FOCS 1990: 2-10
12		Piotr Berman, Howard J. Karloff, Gábor Tardos: A Competitive 3-Server Algorithm. SODA 1990: 280-290
11		Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: title=New Results on Server Problems. SODA 1990: 291-300
	1989
10		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
9		Howard J. Karloff, Walter L. Ruzzo: The Iterated Mod Problem Inf. Comput. 80(3): 193-204 (1989)
8		Howard J. Karloff: How Long can a Euclidean Traveling Salesman Tour Be? SIAM J. Discrete Math. 2(1): 91-99 (1989)
7		Marek Chrobak, Howard J. Karloff: A lower bound on the size of universal sets for planar graphs. SIGACT News 20(4): 83-86 (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	[45] [47]
2	David Applegate	[66]
3	Aaron Archer	[74]
4	Yair Bartal	[20] [25] [27]
5	MohammadHossein Bateni	[73] [74]
6	Radu Berinde	[69]
7	Piotr Berman	[12] [29]
8	Marshall W. Bern	[10] [18]
9	Avrim Blum	[21] [29] [39]
10	Joan Boyar	[2]
11	Adam L. Buchsbaum	[52] [55]
12	Gruia Calinescu	[30] [34] [35] [40] [44] [49] [51] [54] [59] [66]
13	Amit Chakrabarti	[49]
14	Barun Chandra	[26] [37]
15	Moses Charikar	[57] [62] [65] [70] [75] [76]
16	Joseph Cheriyan	[46] [61] [68]
17	Marek Chrobak	[7] [11] [14] [15]
18	Adrian Dumitrescu	[59]
19	Cristina G. Fernandes	[30] [34] [51]
20	Amos Fiat	[17] [20] [27] [29] [33]
21	Ulrich Finkler	[30] [34]
22	Lance Fortnow	[13] [19]
23	Dean P. Foster	[17] [33]
24	Ari Freund	[42]
25	Anna C. Gilbert	[53] [69]
26	Michel X. Goemans	[57] [62]
27	Lukasz Golab	[67] [72] [73]
28	Oded Goldreich	[43] [50] [63]
29	Parikshit Gopalan	[48] [58]
30	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[65] [73] [74] [75] [76]
31	Piotr Indyk	[69]
32	David S. Johnson	[66]
33	Sampath Kannan	[45] [47]
34	Rohit Khandekar	[68]
35	Subhash Khot	[60] [64] [71]
36	Jochen Könemann	[68]
37	Flip Korn	[67] [72]
38	Richard E. Ladner	[45] [47]
39	Katrina Ligett	[66]
40	Carsten Lund	[13] [19]
41	Yishay Mansour	[31]
42	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[52] [55] [70]
43	Aranyak Mehta	[48] [58] [60] [64] [71]
44	Milena Mihail	[38] [48] [58]
45	Joseph Naor (Seffi Naor)	[70]
46	Noam Nisan	[13] [19]
47	Ramamohan Paturi	[4]
48	Thomas H. Payne (T. H. Payne)	[11] [14]
49	Yuval Rabani	[16] [17] [21] [24] [25] [33] [35] [39] [40] [44] [46] [49] [54] [60] [61] [64] [71]
50	Tomasz Radzik	[15]
51	Prabhakar Raghavan	[5] [10] [18] [22]
52	Satish Rao	[65] [76]
53	Yiftach Ravid	[16] [17] [24] [33]
54	Nick Reingold	[52] [55]
55	Adi Rosén	[29]
56	Walter L. Ruzzo	[9]
57	Avishek Saha	[72]
58	Michael E. Saks	[21] [29] [39] [70]
59	Baruch Schieber	[10] [18]
60	Leonard J. Schulman	[43] [50] [63]
61	David B. Shmoys	[3]
62	Janos Simon	[4]
63	Divesh Srivastava	[67] [72]
64	Martin Strauss (Martin J. Strauss)	[69]
65	Gábor Tardos	[12]
66	Mikkel Thorup	[52] [55]
67	Craig A. Tovey	[26] [37]
68	Luca Trevisan	[43] [50] [63]
69	Nisheeth K. Vishnoi	[48] [58]
70	Sundar Vishwanathan	[11] [14] [17] [33]
71	Rakesh V. Vohra (Rakesh Vohra)	[20] [27]
72	Peng-Jun Wan	[59]
73	Jia Wang	[66]
74	Bei Yu	[67]
75	Alexander Zelikovsky	[51]
76	Uri Zwick	[32]