Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Howard J.
    Last name: Karloff
    DBLP: 44/5186
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 102  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Dean P. Foster, Satyen Kale, Howard J. Karloff.
    Online Sparse Linear Regression.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Dean P. Foster, Satyen Kale, Howard J. Karloff.
    Online Sparse Linear Regression.
    Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016 2016 (0) 2016
    Conference paper
    David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu 0004, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen.
    Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Howard J. Karloff, Ramesh Subbaraman.
    Designing wireless metropolitan-area networks using mathematical optimization.
    2015 Wireless Telecommunications Symposium, WTS 2015, New York City, NY, USA, April 15-17, 2015 2015 (0) 2015
    Conference paper
    Dean P. Foster, Howard J. Karloff, Justin Thaler.
    Variable Selection is Hard.
    Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015 2015 (0) 2015
    Conference paper
    Gruia Calinescu, Howard J. Karloff.
    Sequential dependency computation via geometric data structures.
    Comput. Geom. 2014, Volume 47 (0) 2014
    Conference paper
    Richard Cole 0001, Howard J. Karloff.
    Fast Algorithms for Constructing Maximum Entropy Summary Trees.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava.
    Discovering Conservation Rules.
    IEEE Trans. Knowl. Data Eng. 2014, Volume 26 (0) 2014
    Conference paper
    Richard Cole, Howard J. Karloff.
    Fast Algorithms for Constructing Maximum Entropy Summary Trees.
    Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I 2014 (0) 2014
    Conference paper
    Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha.
    Distributed data placement to minimize communication costs via graph partitioning.
    Conference on Scientific and Statistical Database Management, SSDBM '14, Aalborg, Denmark, June 30 - July 02, 2014 2014 (0) 2014
    Conference paper
    Carlos E. Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa.
    Evolutionary algorithms for overlapping correlation clustering.
    Genetic and Evolutionary Computation Conference, GECCO '14, Vancouver, BC, Canada, July 12-16, 2014 2014 (0) 2014
    Journal article
    Dean P. Foster, Howard J. Karloff, Justin Thaler.
    Variable Selection is Hard.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Howard J. Karloff, Kenneth E. Shirley.
    Maximum Entropy Summary Trees.
    Comput. Graph. Forum 2013, Volume 32 (0) 2013
    Conference paper
    Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha.
    Distributed Data Placement via Graph Partitioning.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava.
    Discovering Conservation Rules.
    IEEE 28th International Conference on Data Engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1-5 April, 2012 2012 (0) 2012
    Journal article
    Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani.
    On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani.
    On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2011
    Conference paper
    Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra.
    Capacitated Metric Labeling.
    Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011 2011 (0) 2011
    Journal article
    Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Improved Approximation Algorithms for Label Cover Problems.
    Algorithmica 2011, Volume 61 (0) 2011
    Conference paper
    Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen.
    Disjoint-Path Facility Location: Theory and Practice.
    Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011 2011 (0) 2011
    Conference paper
    MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.
    Theory Comput. Syst. 2011, Volume 49 (0) 2011
    Conference paper
    Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani.
    An improved approximation algorithm for resource allocation.
    ACM Transactions on Algorithms 2010, Volume 7 (0) 2011
    Conference paper
    Gruia Calinescu, Howard J. Karloff.
    Sequential Dependency Computation via Geometric Data Structures.
    Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 10-12, 2011 2011 (0) 2011
    Conference paper
    Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii.
    A Model of Computation for MapReduce.
    Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 (0) 2010
    Journal article
    Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava.
    Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux.
    PVLDB 2010, Volume 3 (0) 2010
    Conference paper
    Graham Cormode, Howard J. Karloff, Anthony Wirth.
    Set cover algorithms for very large datasets.
    Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010 2010 (0) 2010
    Conference paper
    Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Improved Approximation Algorithms for Label Cover Problems.
    Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009 (0) 2009
    Conference paper
    MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Scheduling to minimize staleness and stretch in real-time data warehouses.
    SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 2009 (0) 2009
    Conference paper
    Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava.
    Sequential Dependencies.
    PVLDB 2009, Volume 2 (0) 2009
    Journal article
    Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani.
    On Earthmover Distance, Metric Labeling, and 0-Extension.
    SIAM J. Comput. 2009, Volume 39 (0) 2009
    Conference paper
    Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff.
    Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.
    50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA 2009 (0) 2009
    Conference paper
    Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks.
    Online multicast with egalitarian cost sharing.
    SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008 2008 (0) 2008
    Conference paper
    Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin Strauss.
    Combining geometry and combinatorics: A unified approach to sparse signal recovery
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann.
    On the integrality ratio for tree augmentation.
    Oper. Res. Lett. 2008, Volume 36 (0) 2008
    Conference paper
    Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava, Bei Yu.
    On generating near-optimal tableaux for conditional functional dependencies.
    PVLDB 2008, Volume 1 (0) 2008
    Conference paper
    David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang.
    Compressing rectilinear pictures and minimizing access control lists.
    Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 2007 (0) 2007
    Conference paper
    Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao.
    null
    Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006 (0) 2006
    Conference paper
    Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani.
    On earthmover distance, metric labeling, and 0-extension.
    Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006 2006 (0) 2006
    Conference paper
    Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan.
    Lower bounds for linear locally decodable codes and private information retrieval.
    Computational Complexity 2006, Volume 15 (0) 2006
    Conference paper
    Moses Charikar, Michel X. Goemans, Howard J. Karloff.
    On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.
    Math. Oper. Res. 2006, Volume 31 (0) 2006
    Conference paper
    Joseph Cheriyan, Howard J. Karloff, Yuval Rabani.
    Approximating Directed Multicuts.
    Combinatorica 2005, Volume 25 (0) 2005
    Conference paper
    Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani.
    On earthmover distance, metric labeling, and 0-extension
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan.
    Separating Points by Axis-parallel Lines.
    Int. J. Comput. Geometry Appl. 2005, Volume 15 (0) 2005
    Conference paper
    Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi.
    Caching with Expiration Times for Internet Applications.
    Internet Mathematics 2005, Volume 2 (0) 2005
    Conference paper
    Moses Charikar, Michel X. Goemans, Howard J. Karloff.
    On the Integrality Ratio for Asymmetric TSP.
    45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings 2004 (0) 2004
    Conference paper
    Howard J. Karloff.
    On the convergence time of a path-vector protocol.
    Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 (0) 2004
    Conference paper
    Adam L. Buchsbaum, Howard J. Karloff, Claire Mathieu, Nick Reingold, Mikkel Thorup.
    OPT Versus LOAD in Dynamic Storage Allocation.
    SIAM J. Comput. 2004, Volume 33 (0) 2004
    Conference paper
    Gruia Calinescu, Howard J. Karloff, Yuval Rabani.
    Approximation Algorithms for the 0-Extension Problem.
    SIAM J. Comput. 2004, Volume 34 (0) 2004
    Conference paper
    Adam L. Buchsbaum, Howard J. Karloff, Claire Mathieu, Nick Reingold, Mikkel Thorup.
    OPT versus LOAD in dynamic storage allocation.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    Anna C. Gilbert, Howard J. Karloff.
    On the fractal behavior of TCP.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alex Zelikovsky.
    A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
    Algorithmica 2003, Volume 36 (0) 2003
    Conference paper
    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 (0) 2002
    Conference paper
    Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani.
    Improved Approximation Algorithms for Resource Allocation.
    Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi.
    Caching with expiration times.
    SODA 2002 (0) 2002
    Conference paper
    Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner.
    Thresholds and optimal binary comparison search trees.
    J. Algorithms 2002, Volume 44 (0) 2002
    Conference paper
    Joseph Cheriyan, Howard J. Karloff, Yuval Rabani.
    Approximating Directed Multicuts.
    FOCS 2001 (0) 2001
    Conference paper
    Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner.
    Thresholds and Optimal Binary Comparison Search Trees.
    FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Gruia Calinescu, Howard J. Karloff, Yuval Rabani.
    Approximation algorithms for the 0-extension problem.
    SODA 2001 (0) 2001
    Conference paper
    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) 2001, Volume 8 (0) 2001
    Conference paper
    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. 2000, Volume 75 (0) 2000
    Conference paper
    Howard J. Karloff.
    Foreword.
    J. Algorithms 2000, Volume 37 (0) 2000
    Conference paper
    Gruia Calinescu, Howard J. Karloff, Yuval Rabani.
    An Improved Approximation Algorithm for MULTIWAY CUT.
    J. Comput. Syst. Sci. 2000, Volume 60 (0) 2000
    Conference paper
    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. 2000, Volume 30 (0) 2000
    Conference paper
    Howard J. Karloff, Milena Mihail.
    On the Complexity of the View-Selection Problem.
    Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania, USA 1999 (0) 1999
    Conference paper
    Barun Chandra, Howard J. Karloff, Craig A. Tovey.
    New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
    SIAM J. Comput. 1999, Volume 28 (0) 1999
    Conference paper
    Howard J. Karloff.
    How Good is the Goemans-Williamson MAX CUT Algorithm?
    SIAM J. Comput. 2000, Volume 29 (0) 1999
    Conference paper
    Gruia Calinescu, Howard J. Karloff, Yuval Rabani.
    An Improved Approximation Algorithm for Multiway Cut.
    STOC 1998 (0) 1998
    Conference paper
    Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff.
    A Better Approximation Algorithm for Finding Planar Subgraphs.
    J. Algorithms 1998, Volume 27 (0) 1998
    Conference paper
    Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan.
    Competitive Algorithms for Layered Graph Traversal.
    SIAM J. Comput. 1999, Volume 28 (0) 1998
    Conference paper
    Howard J. Karloff, Uri Zwick.
    A 7/8-Approximation Algorithm for MAX 3SAT?
    FOCS 1997 (0) 1997
    Conference paper
    Howard J. Karloff, Yishay Mansour.
    On Construction of
    Combinatorica 1997, Volume 17 (0) 1997
    Conference paper
    Howard J. Karloff.
    How Good is the Goemans-Williamson MAX CUT Algorithm?
    STOC 1996 (0) 1996
    Conference paper
    Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks.
    Randomized Robot Navigation Algorithms.
    SODA 1996 (0) 1996
    Conference paper
    Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff.
    A Better Approximation Algorithm for Finding Planar Subgraphs.
    SODA 1996 (0) 1996
    Conference paper
    Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh V. Vohra.
    New Algorithms for an Ancient Scheduling Problem.
    J. Comput. Syst. Sci. 1995, Volume 51 (0) 1995
    Conference paper
    Yair Bartal, Howard J. Karloff, Yuval Rabani.
    A Better Lower Bound for On-Line Scheduling.
    Inf. Process. Lett. 1994, Volume 50 (0) 1994
    Conference paper
    Howard J. Karloff, Yuval Rabani, Yiftach Ravid.
    Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.
    SIAM J. Comput. 1994, Volume 23 (0) 1994
    Conference paper
    Barun Chandra, Howard J. Karloff, Craig A. Tovey.
    New Results on the Old k-Opt Algorithm for the TSP.
    SODA 1994 (0) 1994
    Conference paper
    Howard J. Karloff.
    Fast Algorithms for Approximately Counting Mismatches.
    Inf. Process. Lett. 1993, Volume 48 (0) 1993
    Conference paper
    Howard J. Karloff, Prabhakar Raghavan.
    Randomized Algorithms and Pseudorandom Numbers.
    J. ACM 1993, Volume 40 (0) 1993
    Conference paper
    Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks.
    A Decomposition Theorem and Bounds for Randomized Server Problems
    33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992 1992 (0) 1992
    Conference paper
    Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh V. Vohra.
    New Algorithms for an Ancient Scheduling Problem
    Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada 1992 (0) 1992
    Conference paper
    Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan.
    Algebraic Methods for Interactive Proof Systems.
    J. ACM 1992, Volume 39 (0) 1992
    Conference paper
    Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber.
    Fast Geometric Approximation Techniques and Geometric Embedding Problems.
    Theor. Comput. Sci. 1992, Volume 106 (0) 1992
    Conference paper
    Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan.
    Competitive Algorithms for Layered Graph Traversal
    32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991 1991 (0) 1991
    Conference paper
    Howard J. Karloff, Yuval Rabani, Yiftach Ravid.
    Lower Bounds for Randomized k-Server and Motion Planning Algorithms
    Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA 1991 (0) 1991
    Conference paper
    Marek Chrobak, Howard J. Karloff, Tomasz Radzik.
    Connectivity vs. Reachability
    Inf. Comput. 1991, Volume 91 (0) 1991
    Conference paper
    Marek Chrobak, Howard J. Karloff, Thomas H. Payne, Sundar Vishwanathan.
    New Results on Server Problems.
    SIAM J. Discrete Math. 1991, Volume 4 (0) 1991
    Conference paper
    Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan.
    Algebraic Methods for Interactive Proof Systems
    31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I 1990 (0) 1990
    Conference paper
    Piotr Berman, Howard J. Karloff, Gábor Tardos.
    A Competitive 3-Server Algorithm.
    SODA 1990 (0) 1990
    Conference paper
    Marek Chrobak, Howard J. Karloff, Thomas H. Payne, Sundar Vishwanathan.
    title=New Results on Server Problems.
    SODA 1990 (0) 1990
    Conference paper
    Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber.
    Fast Geometric Approximation Techniques and Geometric Embedding Problems.
    Symposium on Computational Geometry 1989 (0) 1989
    Conference paper
    Howard J. Karloff, Walter L. Ruzzo.
    The Iterated Mod Problem
    Inf. Comput. 1989, Volume 80 (0) 1989
    Conference paper
    Howard J. Karloff.
    How Long can a Euclidean Traveling Salesman Tour Be?
    SIAM J. Discrete Math. 1989, Volume 2 (0) 1989
    Conference paper
    Howard J. Karloff.
    An NC Algorithm for Brooks' Theorem.
    Theor. Comput. Sci. 1989, Volume 68 (0) 1989
    Conference paper
    Marek Chrobak, Howard J. Karloff.
    A lower bound on the size of universal sets for planar graphs.
    SIGACT News 1989, Volume 20 (0) 1989
    Conference paper
    Howard J. Karloff, Prabhakar Raghavan.
    Randomized Algorithms and Pseudorandom Numbers
    Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA 1988 (0) 1988
    Conference paper
    Howard J. Karloff, Ramamohan Paturi, Janos Simon.
    Universal Traversal Sequences of Length n^O(log n) for Cliques.
    Inf. Process. Lett. 1988, Volume 28 (0) 1988
    Conference paper
    Joan Boyar, Howard J. Karloff.
    Coloring Planar Graphs in Parallel.
    J. Algorithms 1987, Volume 8 (0) 1987
    Show item 1 to 100 of 102  

    Your query returned 102 matches in the database.