Neal E. Young

147 papers A* 28A 2B 12Misc 1Journal 93Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
An improved approximation algorithm for k-Median.
CoRR
Neal E. Young
2025 J jnl
Classification via Two-Way Comparisons.
ACM Trans. Algorithms
Marek Chrobak, Neal E. Young
2025 J jnl
Online Paging with Heterogeneous Cache Slots.
Algorithmica
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
2024 J jnl
Competitive Data-Structure Dynamization.
ACM Trans. Algorithms
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi
2023 B conf
Classification via Two-Way Comparisons (Extended Abstract).
WADS
Marek Chrobak, Neal E. Young
2023 J jnl
Classification via two-way comparisons.
CoRR
Marek Chrobak, Neal E. Young
2023 A conf
Online Paging with Heterogeneous Cache Slots.
STACS
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
2022 J jnl
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons.
ACM Trans. Algorithms
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022 J jnl
On Huang and Wong's algorithm for generalized binary split trees.
Acta Informatica
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022 J jnl
Online Paging with Heterogeneous Cache Slots.
CoRR
Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young
2021 J jnl
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons.
CoRR
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021 J jnl
Comparison and evaluation of state-of-the-art LSM merge policies.
VLDB J.
Qizhong Mao, Steven Jacobs, Waleed Amjad, Vagelis Hristidis, Vassilis J. Tsotras, Neal E. Young
2021 A* conf
Competitive Data-Structure Dynamization.
SODA
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi
2021 J jnl
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons.
CoRR
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021 J jnl
On the cost of unsuccessful searches in search trees with two-way comparisons.
Inf. Comput.
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2020 J jnl
Algorithmic approaches to selecting control clones in DNA array hybridization experiments.
CoRR
Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young
2020 J jnl
Competitive Data-Structure Dynamization.
CoRR
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi
2020 J jnl
Distributed algorithms for covering, packing and maximum weighted matching.
CoRR
Christos Koufogiannakis, Neal E. Young
2019 — conf
Experimental Evaluation of Bounded-Depth LSM Merge Policies.
IEEE BigData
Qizhong Mao, Steven Jacobs, Waleed Amjad, Vagelis Hristidis, Vassilis J. Tsotras, Neal E. Young
2019 J jnl
Introduction to the Special Issue on SODA 2017.
ACM Trans. Algorithms
Dániel Marx, Virginia Vassilevska Williams, Neal E. Young
2019 J jnl
On Huang and Wong's Algorithm for Generalized Binary Split Trees.
CoRR
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2019 B conf
Unsupervised Ontology- and Sentiment-Aware Review Summarization.
WISE
Nhat X. T. Le, Neal E. Young, Vagelis Hristidis
2018 — conf
Balanced centroidal power diagrams for redistricting.
SIGSPATIAL/GIS
Vincent Cohen-Addad, Philip N. Klein, Neal E. Young
2018 A* conf
Exploiting Transitivity for Learning Person Re-Identification Models on a Budget.
CVPR
Sourya Roy, Sujoy Paul, Neal E. Young, Amit K. Roy-Chowdhury
2018 — ch.
Greedy Methods.
Handbook of Approximation Algorithms and Metaheuristics (1)
Samir Khuller, Balaji Raghavachari, Neal E. Young
2017 J jnl
Balanced power diagrams for redistricting.
CoRR
Vincent Cohen-Addad, Philip N. Klein, Neal E. Young
2017 A* conf
Ontology- and Sentiment-Aware Review Summarization.
ICDE
Nhat X. T. Le, Vagelis Hristidis, Neal E. Young
2016 J jnl
Accelerating the discovery of unsupervised-shapelets.
Data Min. Knowl. Discov.
Jesin Zakaria, Abdullah Mueen, Eamonn J. Keogh, Neal E. Young
2016 — ch.
Greedy Set-Cover Algorithms.
Encyclopedia of Algorithms
Neal E. Young
2016 — ch.
Online Paging and Caching.
Encyclopedia of Algorithms
Neal E. Young
2015 J jnl
Approximation algorithms for the joint replenishment problem with deadlines.
J. Sched.
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
2015 J jnl
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.
SIAM J. Comput.
Philip N. Klein, Neal E. Young
2015 B conf
Optimal Search Trees with 2-Way Comparisons.
ISAAC
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015 J jnl
Optimal search trees with equality tests.
CoRR
Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2014 J jnl
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs.
Algorithmica
Christos Koufogiannakis, Neal E. Young
2014 A* conf
First Come First Served for Online Slot Allocation and Huffman Coding.
SODA
Monik Khare, Claire Mathieu, Neal E. Young
2014 J jnl
K-Slot SSTable Stack Compaction.
CoRR
Claire Mathieu, Carl Staelin, Neal E. Young
2014 J jnl
Nearly Linear-Time Approximation Schemes for Mixed Packing/Covering and Facility-Location Linear Programs.
CoRR
Neal E. Young
2014 J jnl
On a Linear Program for Minimum-Weight Triangulation.
SIAM J. Comput.
Arman Yousefi, Neal E. Young
2013 J jnl
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
CoRR
Neal E. Young
2013 — conf
Approximation Algorithms for the Joint Replenishment Problem with Deadlines.
ICALP (1)
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young
2013 J jnl
First-Come-First-Served for Online Slot Allocation and Huffman Coding.
CoRR
Monik Khare, Claire Mathieu, Neal E. Young
2013 J jnl
Greedy
Algorithmica
Christos Koufogiannakis, Neal E. Young
2013 J jnl
Hamming Approximation of NP Witnesses.
Theory Comput.
Daniel Sheldon, Neal E. Young
2012 J jnl
Caching with rental cost and nuking
CoRR
Monik Khare, Neal E. Young
2012 J jnl
Hamming Approximation of NP Witnesses
CoRR
Daniel Sheldon, Neal E. Young
2012 J jnl
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme.
SIAM J. Comput.
Mordecai J. Golin, Claire Mathieu, Neal E. Young
2012 A* conf
On a linear program for minimum-weight triangulation.
SODA
Arman Yousefi, Neal E. Young
2011 J jnl
Distributed algorithms for covering, packing and maximum weighted matching.
Distributed Comput.
Christos Koufogiannakis, Neal E. Young
2011 A* conf
Logical-shapelets: an expressive primitive for time series classification.
KDD
Abdullah Mueen, Eamonn J. Keogh, Neal E. Young
2011 J jnl
On a Linear Program for Minimum-Weight Triangulation
CoRR
Arman Yousefi, Neal E. Young
2011 J jnl
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).
Dagstuhl Reports
Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young
2010 J jnl
A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls
CoRR
Neal E. Young
2009 A conf
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality.
DISC
Christos Koufogiannakis, Neal E. Young
2009 A* conf
Distributed and parallel algorithms for weighted vertex cover and other covering problems.
PODC
Christos Koufogiannakis, Neal E. Young
2009 — conf
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost.
ICALP (1)
Christos Koufogiannakis, Neal E. Young
2009 J jnl
Topology Management in Directional Antenna-Equipped Ad Hoc Networks.
IEEE Trans. Mob. Comput.
Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young
2008 J jnl
Beating Simplex for Fractional Packing and Covering Linear Programs
CoRR
Christos Koufogiannakis, Neal E. Young
2008 J jnl
Flooding Overcomes Small Covering Constraints
CoRR
Christos Koufogiannakis, Neal E. Young
2008 — ch.
Greedy Set-Cover Algorithms.
Encyclopedia of Algorithms
Neal E. Young
2008 J jnl
Incremental Medians via Online Bidding.
Algorithmica
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2008 — ch.
Online Paging and Caching.
Encyclopedia of Algorithms
Neal E. Young
2007 B conf
Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.
APBC
Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young
2007 J jnl
Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments.
J. Bioinform. Comput. Biol.
Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young
2007 A* conf
Beating Simplex for Fractional Packing and Covering Linear Programs.
FOCS
Christos Koufogiannakis, Neal E. Young
2007 A* conf
Efficient and effective explanation of change in hierarchical summaries.
KDD
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos, Neal E. Young, Flip Korn, Divesh Srivastava
2007 — ch.
Greedy Methods.
Handbook of Approximation Algorithms and Metaheuristics
Samir Khuller, Balaji Raghavachari, Neal E. Young
2007 A* conf
Parsimonious Explanations of Change in Hierarchical Data.
ICDE
Dhiman Barman, Flip Korn, Divesh Srivastava, Dimitrios Gunopulos, Neal E. Young, Deepak Agarwal
2006 B conf
An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad hoc Networks.
MASS
Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young
2006 B conf
Oblivious Medians Via Online Bidding.
LATIN
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2006 J jnl
The reverse greedy algorithm for the metric
Inf. Process. Lett.
Marek Chrobak, Claire Kenyon, Neal E. Young
2006 B conf
Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks.
SECON
Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young
2005 J jnl
Approximation algorithms for covering/packing integer programs.
J. Comput. Syst. Sci.
Stavros G. Kolliopoulos, Neal E. Young
2005 J jnl
Oblivious Medians via Online Bidding
CoRR
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2005 Misc conf
The Reverse Greedy Algorithm for the Metric
COCOON
Marek Chrobak, Claire Kenyon, Neal E. Young
2005 J jnl
The reverse greedy algorithm for the metric k-median problem
CoRR
Marek Chrobak, Claire Kenyon, Neal E. Young
2004 J jnl
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut.
Math. Oper. Res.
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
2002 J jnl
A Codebook Generation Algorithm for Document Image Compression
CoRR
Qin Zhang, John M. Danskin, Neal E. Young
2002 J jnl
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
CoRR
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
2002 J jnl
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover
CoRR
Samir Khuller, Uzi Vishkin, Neal E. Young
2002 J jnl
Approximate Data Structures with Applications
CoRR
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
2002 J jnl
Approximating the Minimum Equivalent Digraph
CoRR
Samir Khuller, Balaji Raghavachari, Neal E. Young
2002 J jnl
Balancing Minimum Spanning and Shortest Path Trees
CoRR
Samir Khuller, Balaji Raghavachari, Neal E. Young
2002 J jnl
Competitive Paging Algorithms
CoRR
Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
2002 J jnl
Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic
CoRR
Robert Lupton, F. Miller Maley, Neal E. Young
2002 J jnl
Designing Multi-Commodity Flow Trees
CoRR
Samir Khuller, Balaji Raghavachari, Neal E. Young
2002 J jnl
Faster Parametric Shortest Path and Minimum Balance Algorithms
CoRR
Neal E. Young, Robert Endre Tarjan, James B. Orlin
2002 J jnl
Huffman Coding with Unequal Letter Costs
CoRR
Mordecai J. Golin, Claire Kenyon, Neal E. Young
2002 A* conf
Huffman coding with unequal letter costs.
STOC
Mordecai J. Golin, Claire Kenyon, Neal E. Young
2002 J jnl
Improved Bicriteria Existence Theorems for Scheduling
CoRR
Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young
2002 J jnl
K-Medians, Facility Location, and the Chernoff-Wald Bound
CoRR
Neal E. Young
2002 J jnl
Lecture Notes on Evasiveness of Graph Properties
CoRR
László Lovász, Neal E. Young
2002 J jnl
Low-Degree Spanning Trees of Small Weight
CoRR
Samir Khuller, Balaji Raghavachari, Neal E. Young
2002 J jnl
On Strongly Connected Digraphs with Bounded Cycle Length
CoRR
Samir Khuller, Balaji Raghavachari, Neal E. Young
2002 J jnl
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
CoRR
Philip N. Klein, Neal E. Young
2002 J jnl
On-Line End-to-End Congestion Control
CoRR
Naveen Garg, Neal E. Young
2002 A* conf
On-Line End-to-End Congestion Control.
FOCS
Naveen Garg, Neal E. Young
2002 J jnl
On-Line File Caching
CoRR
Neal E. Young
2002 J jnl
On-Line File Caching.
Algorithmica
Neal E. Young
2002 J jnl
On-Line Paging against Adversarially Biased Random Inputs
CoRR
Neal E. Young
2002 J jnl
Orienting Graphs to Optimize Reachability
CoRR
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
2002 J jnl
Polynomial-Time Approximation Scheme for Data Broadcast
CoRR
Claire Kenyon, Nicolas Schabanel, Neal E. Young
2002 J jnl
Prefix Codes: Equiprobable Words, Unequal Letter Costs
CoRR
Mordecai J. Golin, Neal E. Young
2002 J jnl
Randomized Rounding without Solving the Linear Program
CoRR
Neal E. Young
2002 J jnl
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
CoRR
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
2002 J jnl
Sequential and Parallel Algorithms for Mixed Packing and Covering
CoRR
Neal E. Young
2002 J jnl
Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory
CoRR
Richard J. Lipton, Neal E. Young
2002 J jnl
The K-Server Dual and Loose Competitiveness for Paging
CoRR
Neal E. Young
2002 J jnl
Tight Approximation Results for General Covering Integer Programs
CoRR
Stavros G. Kolliopoulos, Neal E. Young
2001 A* conf
Sequential and Parallel Algorithms for Mixed Packing and Covering.
FOCS
Neal E. Young
2001 A* conf
Tight Approximation Results for General Covering Integer Programs.
FOCS
Stavros G. Kolliopoulos, Neal E. Young
2000 J jnl
On-Line Paging Against Adversarially Biased Random Inputs.
J. Algorithms
Neal E. Young
2000 A* conf
Polynomial-time approximation scheme for data broadcast.
STOC
Claire Kenyon, Nicolas Schabanel, Neal E. Young
1999 — ch.
Approximation Algorithms.
Algorithms and Theory of Computation Handbook
Philip N. Klein, Neal E. Young
1999 A* conf
Improved Bicriteria Existence Theorems for Scheduling.
SODA
Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young
1999 B conf
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.
IPCO
Philip N. Klein, Neal E. Young
1999 J jnl
Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv.
SIGACT News
Neal E. Young
1999 A* conf
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut.
STOC
David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young
1998 A* conf
Bounding the Diffuse Adversary.
SODA
Neal E. Young
1998 J jnl
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic.
J. Algorithms
Robert Lupton, F. Miller Maley, Neal E. Young
1998 A* conf
On-Line File Caching.
SODA
Neal E. Young
1997 B conf
A Codebook Generation Algorithm for Document Image Compression.
Data Compression Conference
Qin Zhang, John M. Danskin, Neal E. Young
1997 J jnl
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
J. Algorithms
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
1997 J jnl
Orienting Graphs to Optimize Reachability.
Inf. Process. Lett.
S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young
1996 B conf
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
IPCO
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young
1996 J jnl
A New Operation on Sequences: The Boustrophedon Transform.
J. Comb. Theory A
Jessica Millar, Neil J. A. Sloane, Neal E. Young
1996 A* conf
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic.
SODA
Robert Lupton, F. Miller Maley, Neal E. Young
1996 J jnl
Low-Degree Spanning Trees of Small Weight.
SIAM J. Comput.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1996 J jnl
On Strongly Connected Digraphs with Bounded Cycle Length.
Discret. Appl. Math.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1996 J jnl
Prefix Codes: Equiprobable Words, Unequal Letter Costs.
SIAM J. Comput.
Mordecai J. Golin, Neal E. Young
1995 J jnl
Approximating the Minimum Equivalent Digraph.
SIAM J. Comput.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1995 J jnl
Balancing Minimum Spanning Trees and Shortest-Path Trees.
Algorithmica
Samir Khuller, Balaji Raghavachari, Neal E. Young
1995 A* conf
Randomized Rounding Without Solving the Linear Program.
SODA
Neal E. Young
1994 J jnl
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.
J. Algorithms
Samir Khuller, Uzi Vishkin, Neal E. Young
1994 A* conf
Approximate Data Structures with Applications.
SODA
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
1994 A* conf
Approximating the Minimum Equivalent Diagraph.
SODA
Samir Khuller, Balaji Raghavachari, Neal E. Young
1994 J jnl
Designing Multi-Commodity Flow Trees.
Inf. Process. Lett.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1994 A* conf
Low degree spanning trees of small weight.
STOC
Samir Khuller, Balaji Raghavachari, Neal E. Young
1994 A* conf
Prefix Codes: Equiprobable Words, Unequal Letter Costs.
ICALP
Mordecai J. Golin, Neal E. Young
1994 A* conf
Simple strategies for large zero-sum games with applications to complexity theory.
STOC
Richard J. Lipton, Neal E. Young
1994 J jnl
The k-Server Dual and Loose Competitiveness for Paging.
Algorithmica
Neal E. Young
1993 B conf
A primal-dual parallel approximation technique applied to weighted set and vertex cover.
IPCO
Samir Khuller, Uzi Vishkin, Neal E. Young
1993 A* conf
Balancing Minimum Spanning and Shortest Path Trees.
SODA
Samir Khuller, Balaji Raghavachari, Neal E. Young
1993 B conf
Designing Multi-Commodity Flow Trees.
WADS
Samir Khuller, Balaji Raghavachari, Neal E. Young
1991 J jnl
Competitive Paging Algorithms.
J. Algorithms
Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
1991 J jnl
Faster parametric shortest path and minimum-balance algorithms.
Networks
Neal E. Young, Robert Endre Tarjan, James B. Orlin
1991 A* conf
On-Line Caching as Cache Size Varies.
SODA
Neal E. Young