Contact

All Stories

  1. Classification via Two-Way Comparisons

    Article • ACM Transactions on Algorithms, December 2024, ACM (Association for Computing Machinery)

    Neal Young

  2. Online Paging with Heterogeneous Cache Slots

    Article • Algorithmica, October 2024, Springer Science + Business Media

    Neal Young

  3. Competitive Data-Structure Dynamization

    Article • ACM Transactions on Algorithms, June 2024, ACM (Association for Computing Machinery)

    Neal Young

  4. Classification via Two-Way Comparisons (Extended Abstract)

    Article • January 2023, Springer Science + Business Media

    Neal Young

  5. On Huang and Wong’s algorithm for generalized binary split trees

    Article • Acta Informatica, February 2022, Springer Science + Business Media

    Neal Young

  6. A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

    Article • ACM Transactions on Algorithms, January 2022, ACM (Association for Computing Machinery)

    Neal Young

  7. On the cost of unsuccessful searches in search trees with two-way comparisons

    Article • Information and Computation, December 2021, Elsevier

    Neal Young

  8. Comparison and evaluation of state-of-the-art LSM merge policies

    Article • The VLDB Journal, February 2021, Springer Science + Business Media

    Neal Young

  9. Experimental Evaluation of Bounded-Depth LSM Merge Policies

    Article • December 2019, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  10. Introduction to the Special Issue on SODA 2017

    Article • ACM Transactions on Algorithms, May 2019, ACM (Association for Computing Machinery)

    Neal Young

  11. Unsupervised Ontology- and Sentiment-Aware Review Summarization

    Article • January 2019, Springer Science + Business Media

    Neal Young

  12. Balanced centroidal power diagrams for redistricting

    Article • November 2018, ACM (Association for Computing Machinery)

    Neal Young

  13. Exploiting Transitivity for Learning Person Re-identification Models on a Budget

    Article • June 2018, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  14. Ontology- and Sentiment-Aware Review Summarization

    Article • April 2017, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  15. Online Paging and Caching

    Article • January 2016, Springer Science + Business Media

    Neal Young

  16. Greedy Set-Cover Algorithms

    Article • January 2016, Springer Science + Business Media

    Neal Young

  17. Accelerating the discovery of unsupervised-shapelets

    Article • Data Mining and Knowledge Discovery, May 2015, Springer Science + Business Media

    Neal Young

  18. Optimal Search Trees with 2-Way Comparisons

    Article • January 2015, Springer Science + Business Media

    Neal Young

  19. On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms

    Article • SIAM Journal on Computing, January 2015, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  20. Approximation algorithms for the joint replenishment problem with deadlines

    Article • Journal of Scheduling, August 2014, Springer Science + Business Media

    Neal Young

  21. Greedy Set-Cover Algorithms

    Article • January 2014, Springer Science + Business Media

    Neal Young

  22. On a Linear Program for Minimum-Weight Triangulation

    Article • SIAM Journal on Computing, January 2014, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  23. First Come First Served for Online Slot Allocation and Huffman Coding

    Article • December 2013, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  24. A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs

    Article • Algorithmica, March 2013, Springer Science + Business Media

    Neal Young

  25. Approximation Algorithms for the Joint Replenishment Problem with Deadlines

    Article • January 2013, Springer Science + Business Media

    Neal Young

  26. Hamming Approximation of NP Witnesses

    Article • Theory of Computing, January 2013, Theory of Computing Exchange

    Neal Young

  27. Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

    Article • Algorithmica, March 2012, Springer Science + Business Media

    Neal Young

  28. Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme

    Article • SIAM Journal on Computing, January 2012, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  29. Distributed algorithms for covering, packing and maximum weighted matching

    Article • Distributed Computing, March 2011, Springer Science + Business Media

    Neal Young

  30. Logical-shapelets

    Article • January 2011, ACM (Association for Computing Machinery)

    Neal Young

  31. Topology Management in Directional Antenna-Equipped Ad Hoc Networks

    Article • IEEE Transactions on Mobile Computing, May 2009, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  32. Distributed and parallel algorithms for weighted vertex cover and other covering problems

    Article • January 2009, ACM (Association for Computing Machinery)

    Neal Young

  33. Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality

    Article • January 2009, Springer Science + Business Media

    Neal Young

  34. Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

    Article • January 2009, Springer Science + Business Media

    Neal Young

  35. Online Paging and Caching

    Article • January 2008, Springer Science + Business Media

    Neal Young

  36. Greedy Set-Cover Algorithms

    Article • January 2008, Springer Science + Business Media

    Neal Young

  37. Beating Simplex for Fractional Packing and Covering Linear Programs

    Article • October 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  38. Beating Simplex for Fractional Packing and Covering Linear Programs

    Article • October 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  39. Incremental Medians via Online Bidding

    Article • Algorithmica, September 2007, Springer Science + Business Media

    Neal Young

  40. ALGORITHMIC APPROACHES TO SELECTING CONTROL CLONES IN DNA ARRAY HYBRIDIZATION EXPERIMENTS

    Article • Journal of Bioinformatics and Computational Biology, August 2007, World Scientific Pub Co Pte Lt

    Neal Young

  41. Handbook of Approximation Algorithms and Metaheuristics

    Article • May 2007, Taylor & Francis

    Neal Young

  42. Efficient and effective explanation of change in hierarchical summaries

    Article • January 2007, ACM (Association for Computing Machinery)

    Neal Young

  43. ALGORITHMIC APPROACHES TO SELECTING CONTROL CLONES IN DNA ARRAY HYBRIDIZATION EXPERIMENTS

    Article • January 2007, World Scientific Pub Co Pte Lt

    Neal Young

  44. Parsimonious Explanations of Change in Hierarchical Data

    Article • January 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  45. An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad hoc Networks

    Article • October 2006, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  46. Oblivious Medians Via Online Bidding

    Article • January 2006, Springer Science + Business Media

    Neal Young

  47. The reverse greedy algorithm for the metric k-median problem

    Article • Information Processing Letters, January 2006, Elsevier

    Neal Young

  48. Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks

    Article • January 2006, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  49. Approximation algorithms for covering/packing integer programs

    Article • Journal of Computer and System Sciences, November 2005, Elsevier

    Neal Young

  50. The Reverse Greedy Algorithm for the Metric K-Median Problem

    Article • January 2005, Springer Science + Business Media

    Neal Young

  51. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

    Article • Mathematics of Operations Research, August 2004, INFORMS

    Neal Young

  52. An Efficient Targeting Strategy for Multiobject Spectrograph Surveys: the Sloan Digital Sky Survey “Tiling” Algorithm

    Article • The Astronomical Journal, April 2003, American Astronomical Society

    Neal Young

  53. Huffman coding with unequal letter costs

    Article • January 2002, ACM (Association for Computing Machinery)

    Neal Young

  54. On-Line File Caching

    Article • Algorithmica, January 2002, Springer Science + Business Media

    Neal Young

  55. Huffman coding with unequal letter costs

    Article • January 2002, ACM (Association for Computing Machinery)

    Neal Young

  56. Tight approximation results for general covering integer programs

    Article • January 2001, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  57. Sequential and parallel algorithms for mixed packing and covering

    Article • January 2001, Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  58. On-Line Paging Against Adversarially Biased Random Inputs

    Article • Journal of Algorithms, October 2000, Elsevier

    Neal Young

  59. Polynomial-time approximation scheme for data broadcast

    Article • January 2000, ACM (Association for Computing Machinery)

    Neal Young

  60. Rounding algorithms for a geometric embedding of minimum multiway cut

    Article • January 1999, ACM (Association for Computing Machinery)

    Neal Young

  61. On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms

    Article • January 1999, Springer Science + Business Media

    Neal Young

  62. Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic

    Article • Journal of Algorithms, May 1998, Elsevier

    Neal Young

  63. Orienting graphs to optimize reachability

    Article • Information Processing Letters, September 1997, Elsevier

    Neal Young

  64. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees

    Article • Journal of Algorithms, August 1997, Elsevier

    Neal Young

  65. Prefix Codes: Equiprobable Words, Unequal Letter Costs

    Article • SIAM Journal on Computing, December 1996, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  66. A New Operation on Sequences: The Boustrophedon Transform

    Article • Journal of Combinatorial Theory Series A, October 1996, Elsevier

    Neal Young

  67. On strongly connected digraphs with bounded cycle length

    Article • Discrete Applied Mathematics, August 1996, Elsevier

    Neal Young

  68. Low-Degree Spanning Trees of Small Weight

    Article • SIAM Journal on Computing, April 1996, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  69. A network-flow technique for finding low-weight bounded-degree spanning trees

    Article • January 1996, Springer Science + Business Media

    Neal Young

  70. Balancing minimum spanning trees and shortest-path trees

    Article • Algorithmica, October 1995, Springer Science + Business Media

    Neal Young

  71. Approximating the Minimum Equivalent Digraph

    Article • SIAM Journal on Computing, August 1995, Society for Industrial & Applied Mathematics (SIAM)

    Neal Young

  72. A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers

    Article • Journal of Algorithms, September 1994, Elsevier

    Neal Young

  73. Thek-server dual and loose competitiveness for paging

    Article • Algorithmica, June 1994, Springer Science + Business Media

    Neal Young

  74. Designing multi-commodity flow trees

    Article • Information Processing Letters, April 1994, Elsevier

    Neal Young

  75. Prefix codes: Equiprobable words, unequal letter costs

    Article • January 1994, Springer Science + Business Media

    Neal Young

  76. Simple strategies for large zero-sum games with applications to complexity theory

    Article • January 1994, ACM (Association for Computing Machinery)

    Neal Young

  77. Low degree spanning trees of small weight

    Article • January 1994, ACM (Association for Computing Machinery)

    Neal Young

  78. Designing multi-commodity flow trees

    Article • January 1993, Springer Science + Business Media

    Neal Young

  79. Competitive paging algorithms

    Article • Journal of Algorithms, December 1991, Elsevier

    Neal Young

  80. Faster parametric shortest path and minimum-balance algorithms

    Article • Networks, March 1991, Wiley

    Neal Young

  81. On-line end-to-end congestion control

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young

  82. A codebook generation algorithm for document image compression

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Neal Young