The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Howard J. Karloff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  64. Improved Approximation Algorithms for Label Cover Problems. [Citation Graph (, )][DBLP]


  65. Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. [Citation Graph (, )][DBLP]


  66. A Model of Computation for MapReduce. [Citation Graph (, )][DBLP]


  67. Online multicast with egalitarian cost sharing. [Citation Graph (, )][DBLP]


  68. Scheduling to minimize staleness and stretch in real-time data warehouses. [Citation Graph (, )][DBLP]


  69. l22 Spreading Metrics for Vertex Ordering Problems. [Citation Graph (, )][DBLP]


  70. Combining geometry and combinatorics: A unified approach to sparse signal recovery [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002