The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Neal E. Young: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms. [Citation Graph (3, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:685-699 [Journal]
  2. Q. Fu, E. Bent, James Borneman, Marek Chrobak, N. Young
    Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:17-26 [Conf]
  3. Marek Chrobak, Claire Kenyon, Neal E. Young
    The Reverse Greedy Algorithm for the Metric K-Median Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:654-660 [Conf]
  4. Qin Zhang, John M. Danskin, Neal E. Young
    A Codebook Generation Algorithm for Document Image Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:300-309 [Conf]
  5. Naveen Garg, Neal E. Young
    On-Line End-to-End Congestion Control. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:303-312 [Conf]
  6. Stavros G. Kolliopoulos, Neal E. Young
    Tight Approximation Results for General Covering Integer Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:522-528 [Conf]
  7. Neal E. Young
    Sequential and Parallel Algorithms for Mixed Packing and Covering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:538-546 [Conf]
  8. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:605-617 [Conf]
  9. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:105-117 [Conf]
  10. Samir Khuller, Uzi Vishkin, Neal E. Young
    A primal-dual parallel approximation technique applied to weighted set and vertex cover. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:333-341 [Conf]
  11. Philip N. Klein, Neal E. Young
    On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:320-327 [Conf]
  12. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians Via Online Bidding. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:311-322 [Conf]
  13. Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young
    Improved Bicriteria Existence Theorems for Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:846-847 [Conf]
  14. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:243-250 [Conf]
  15. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Diagraph. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:177-186 [Conf]
  16. Robert Lupton, F. Miller Maley, Neal E. Young
    Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:296-303 [Conf]
  17. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
    Approximate Data Structures with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:187-194 [Conf]
  18. Neal E. Young
    K-medians, facility location, and the Chernoff-Wald bound. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:86-95 [Conf]
  19. Neal E. Young
    On-Line Caching as Cache Size Varies. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:241-250 [Conf]
  20. Neal E. Young
    Randomized Rounding Without Solving the Linear Program. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:170-178 [Conf]
  21. Neal E. Young
    On-Line File Caching. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:82-86 [Conf]
  22. Neal E. Young
    Bounding the Diffuse Adversary. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:420-425 [Conf]
  23. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman coding with unequal letter costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:785-791 [Conf]
  24. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:668-678 [Conf]
  25. Claire Kenyon, Nicolas Schabanel, Neal E. Young
    Polynomial-time approximation scheme for data broadcast. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:659-666 [Conf]
  26. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low degree spanning trees of small weight. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:412-421 [Conf]
  27. Richard J. Lipton, Neal E. Young
    Simple strategies for large zero-sum games with applications to complexity theory. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:734-740 [Conf]
  28. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:433-441 [Conf]
  29. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning Trees and Shortest-Path Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:305-321 [Journal]
  30. Neal E. Young
    On-Line File Caching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:371-383 [Journal]
  31. Neal E. Young
    The k-Server Dual and Loose Competitiveness for Paging. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:6, pp:525-541 [Journal]
  32. László Lovász, Neal E. Young
    Lecture Notes on Evasiveness of Graph Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  33. Richard J. Lipton, Neal E. Young
    Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  34. Neal E. Young
    On-Line Paging against Adversarially Biased Random Inputs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  35. Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young
    Improved Bicriteria Existence Theorems for Scheduling [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  36. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
    Approximate Data Structures with Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  37. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  38. Claire Kenyon, Nicolas Schabanel, Neal E. Young
    Polynomial-Time Approximation Scheme for Data Broadcast [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  39. Qin Zhang, John M. Danskin, Neal E. Young
    A Codebook Generation Algorithm for Document Image Compression [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  40. Stavros G. Kolliopoulos, Neal E. Young
    Tight Approximation Results for General Covering Integer Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  41. Naveen Garg, Neal E. Young
    On-Line End-to-End Congestion Control [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  42. Neal E. Young
    On-Line File Caching [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  43. Robert Lupton, F. Miller Maley, Neal E. Young
    Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. Neal E. Young
    Randomized Rounding without Solving the Linear Program [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  45. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  46. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
    Competitive Paging Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  47. Neal E. Young
    Sequential and Parallel Algorithms for Mixed Packing and Covering [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  48. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Digraph [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. Neal E. Young, Robert Endre Tarjan, James B. Orlin
    Faster Parametric Shortest Path and Minimum Balance Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  51. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  52. Neal E. Young
    The K-Server Dual and Loose Competitiveness for Paging [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  53. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  54. Philip N. Klein, Neal E. Young
    On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  55. Neal E. Young
    K-Medians, Facility Location, and the Chernoff-Wald Bound [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  56. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman Coding with Unequal Letter Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  57. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  58. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  59. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  60. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  61. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:281-289 [Journal]
  62. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:2, pp:68-72 [Journal]
  63. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
    Orienting Graphs to Optimize Reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:5, pp:229-235 [Journal]
  64. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:49-55 [Journal]
  65. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
    A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:310-324 [Journal]
  66. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:280-289 [Journal]
  67. Robert Lupton, F. Miller Maley, Neal E. Young
    Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:27, n:2, pp:339-356 [Journal]
  68. Neal E. Young
    On-Line Paging Against Adversarially Biased Random Inputs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:218-235 [Journal]
  69. Stavros G. Kolliopoulos, Neal E. Young
    Approximation algorithms for covering/packing integer programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:4, pp:495-505 [Journal]
  70. Jessica Millar, N. J. A. Sloane, Neal E. Young
    A New Operation on Sequences: The Boustrophedon Transform. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:76, n:1, pp:44-54 [Journal]
  71. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
    Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:3, pp:436-461 [Journal]
  72. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1281-1292 [Journal]
  73. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:355-368 [Journal]
  74. Dhiman Barman, Flip Korn, Divesh Srivastava, Dimitrios Gunopulos, Neal E. Young, Deepak Agarwal
    Parsimonious Explanations of Change in Hierarchical Data. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1273-1275 [Conf]
  75. Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos, Neal E. Young, Flip Korn, Divesh Srivastava
    Efficient and effective explanation of change in hierarchical summaries. [Citation Graph (0, 0)][DBLP]
    KDD, 2007, pp:6-15 [Conf]
  76. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians via Online Bidding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  77. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  78. Beating Simplex for Fractional Packing and Covering Linear Programs. [Citation Graph (, )][DBLP]


  79. Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. [Citation Graph (, )][DBLP]


  80. Distributed and parallel algorithms for weighted vertex cover and other covering problems. [Citation Graph (, )][DBLP]


  81. Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. [Citation Graph (, )][DBLP]


  82. Incremental Medians via Online Bidding. [Citation Graph (, )][DBLP]


  83. Beating Simplex for Fractional Packing and Covering Linear Programs [Citation Graph (, )][DBLP]


  84. Flooding Overcomes Small Covering Constraints [Citation Graph (, )][DBLP]


  85. A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002