Follow
Howard Karloff
Howard Karloff
Goldman Sachs
Verified email at cc.gatech.edu - Homepage
Title
Cited by
Cited by
Year
Algebraic methods for interactive proof systems
C Lund, L Fortnow, H Karloff, N Nisan
Journal of the ACM (JACM) 39 (4), 859-868, 1992
11231992
A model of computation for MapReduce
H Karloff, S Suri, S Vassilvitskii
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
7392010
Combining geometry and combinatorics: A unified approach to sparse signal recovery
R Berinde, AC Gilbert, P Indyk, H Karloff, MJ Strauss
2008 46th Annual Allerton Conference on Communication, Control, and …, 2008
4792008
New Results on Server Problems
M Chrobak, H Karloff, T Payne, S Vishwanathan
SIAM Journal on Discrete Mathematics 4, 172-181, 1991
3511991
Linear programming
H Karloff
Springer, 2008
3462008
New algorithms for an ancient scheduling problem
Y Bartal, A Fiat, H Karloff, R Vohra
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992
3201992
An improved approximation algorithm for multiway cut
C Gruia, H Karloff, Y Rabani
ACM Press, 1998
302*1998
A 7/8-approximation algorithm for MAX 3SAT?
H Karloff, U Zwick
Proceedings 38th Annual Symposium on Foundations of Computer Science, 406-415, 1997
2871997
New results on the old k-opt algorithm for the traveling salesman problem
B Chandra, H Karloff, C Tovey
SIAM Journal on Computing 28 (6), 1998-2029, 1999
195*1999
Approximation algorithms for the 0-extension problem
G Calinescu, H Karloff, Y Rabani
SIAM Journal on Computing 34 (2), 358-372, 2005
1902005
On generating near-optimal tableaux for conditional functional dependencies
L Golab, H Karloff, F Korn, D Srivastava, B Yu
Proceedings of the VLDB Endowment 1 (1), 376-390, 2008
1782008
Improved approximation algorithms for prize-collecting Steiner tree and TSP
A Archer, MH Bateni, MT Hajiaghayi, H Karloff
SIAM journal on computing 40 (2), 309-332, 2011
1622011
Sequential dependencies
L Golab, H Karloff, F Korn, A Saha, D Srivastava
Proceedings of the VLDB Endowment 2 (1), 574-585, 2009
1452009
On the complexity of the view-selection problem
H Karloff, M Mihail
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 1999
1331999
How good is the Goemans-Williamson MAX CUT algorithm?
H Karloff
Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996
1301996
Set cover algorithms for very large datasets
G Cormode, H Karloff, A Wirth
Proceedings of the 19th ACM international conference on Information and …, 2010
1162010
Compressing rectilinear pictures and minimizing access control lists
DA Applegate, G Calinescu, DS Johnson, H Karloff, K Ligett, J Wang
SODA 7, 1066-1075, 2007
1122007
A better lower bound for on-line scheduling
Y Bartal, H Karloff, Y Rabani
Information Processing Letters 50 (3), 113-116, 1994
1101994
Efficient parallel algorithms for edge coloring problems
HJ Karloff, DB Shmoys
Journal of Algorithms 8 (1), 39-52, 1987
1101987
Lower bounds for linear locally decodable codes and private information retrieval
O Goldreich, H Karloff, LJ Schulman, L Trevisan
Proceedings 17th IEEE Annual Conference on Computational Complexity, 175-183, 2002
1082002
The system can't perform the operation now. Try again later.
Articles 1–20