Neal E. Young

ORCID

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 23

Top Venues

CoRR

SODA

Algorithmica

ACM Trans. Algorithms

Publications

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

Neal E. Young.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Neal E. Young