Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDNeal E. Young
Person information
- affiliation: University of California, Riverside, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j36]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): 2:1-2:11 (2022)- 2021
- [j35]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: 104707 (2021) - [j34]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): 361-378 (2021) - [c46]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. SODA 2021: 2269-2287 - [i50]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 abs/2103.01052 (2021) - [i49]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR abs/2103.01084 (2021) - 2020
- [i48]Christos Koufogiannakis, Neal E. Young:
Distributed algorithms for covering, packing and maximum weighted matching. CoRR abs/2005.13628 (2020) - [i47]Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young:
Algorithmic approaches to selecting control clones in DNA array hybridization experiments. CoRR abs/2005.13645 (2020) - [i46]Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi:
Competitive Data-Structure Dynamization. CoRR abs/2011.02615 (2020)
2010 – 2019
- 2019
- [j33]Dániel Marx, Virginia Vassilevska Williams, Neal E. Young:
Introduction to the Special Issue on SODA 2017. ACM Trans. Algorithms 15(2): 17:1-17:2 (2019) - [c45]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: 523-532 - [c44]Nhat X. T. Le, Neal E. Young, Vagelis Hristidis:
Unsupervised Ontology- and Sentiment-Aware Review Summarization. WISE 2019: 747-762 - [i45]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR abs/1901.03783 (2019) - 2018
- [c43]Sourya Roy, Sujoy Paul, Neal E. Young, Amit K. Roy-Chowdhury:
Exploiting Transitivity for Learning Person Re-Identification Models on a Budget. CVPR 2018: 7064-7072 - [c42]Vincent Cohen-Addad, Philip N. Klein, Neal E. Young:
Balanced centroidal power diagrams for redistricting. SIGSPATIAL/GIS 2018: 389-396 - [p2]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 55-69 - 2017
- [c41]Nhat X. T. Le, Vagelis Hristidis, Neal E. Young:
Ontology- and Sentiment-Aware Review Summarization. ICDE 2017: 171-174 - [i44]Vincent Cohen-Addad, Philip N. Klein, Neal E. Young:
Balanced power diagrams for redistricting. CoRR abs/1710.03358 (2017) - 2016
- [j32]Jesin Zakaria, Abdullah Mueen, Eamonn J. Keogh, Neal E. Young:
Accelerating the discovery of unsupervised-shapelets. Data Min. Knowl. Discov. 30(1): 243-281 (2016) - [r5]Neal E. Young:
Greedy Set-Cover Algorithms. Encyclopedia of Algorithms 2016: 886-889 - [r4]Neal E. Young:
Online Paging and Caching. Encyclopedia of Algorithms 2016: 1457-1461 - 2015
- [j31]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): 545-560 (2015) - [j30]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): 1154-1172 (2015) - [c40]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal Search Trees with 2-Way Comparisons. ISAAC 2015: 71-82 - [i43]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal search trees with equality tests. CoRR abs/1505.00357 (2015) - 2014
- [j29]Christos Koufogiannakis, Neal E. Young:
A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs. Algorithmica 70(4): 648-674 (2014) - [j28]Arman Yousefi, Neal E. Young:
On a Linear Program for Minimum-Weight Triangulation. SIAM J. Comput. 43(1): 25-51 (2014) - [c39]Monik Khare, Claire Mathieu, Neal E. Young:
First Come First Served for Online Slot Allocation and Huffman Coding. SODA 2014: 445-454 - [i42]Claire Mathieu, Carl Staelin, Neal E. Young:
K-Slot SSTable Stack Compaction. CoRR abs/1407.3008 (2014) - [i41]Neal E. Young:
Nearly Linear-Time Approximation Schemes for Mixed Packing/Covering and Facility-Location Linear Programs. CoRR abs/1407.3015 (2014) - 2013
- [j27]Christos Koufogiannakis, Neal E. Young:
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Algorithmica 66(1): 113-152 (2013) - [j26]Daniel Sheldon, Neal E. Young:
Hamming Approximation of NP Witnesses. Theory Comput. 9: 685-702 (2013) - [c38]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: 135-147 - [i40]Neal E. Young:
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons. CoRR abs/1303.2920 (2013) - [i39]Monik Khare, Claire Mathieu, Neal E. Young:
First-Come-First-Served for Online Slot Allocation and Huffman Coding. CoRR abs/1307.5296 (2013) - 2012
- [j25]Mordecai J. Golin, Claire Mathieu, Neal E. Young:
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. 41(3): 684-713 (2012) - [c37]Arman Yousefi, Neal E. Young:
On a linear program for minimum-weight triangulation. SODA 2012: 811-823 - [i38]Daniel Sheldon, Neal E. Young:
Hamming Approximation of NP Witnesses. CoRR abs/1208.0257 (2012) - [i37]Monik Khare, Neal E. Young:
Caching with rental cost and nuking. CoRR abs/1208.2724 (2012) - 2011
- [j24]Christos Koufogiannakis, Neal E. Young:
Distributed algorithms for covering, packing and maximum weighted matching. Distributed Comput. 24(1): 45-63 (2011) - [c36]Abdullah Mueen, Eamonn J. Keogh, Neal E. Young:
Logical-shapelets: an expressive primitive for time series classification. KDD 2011: 1154-1162 - [i36]Arman Yousefi, Neal E. Young:
On a Linear Program for Minimum-Weight Triangulation. CoRR abs/1111.5305 (2011) - [i35]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): 67-93 (2011) - 2010
- [i34]Neal E. Young:
A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls. CoRR abs/1007.0217 (2010)
2000 – 2009
- 2009
- [j23]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): 590-605 (2009) - [c35]Christos Koufogiannakis, Neal E. Young:
Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. ICALP (1) 2009: 634-652 - [c34]Christos Koufogiannakis, Neal E. Young:
Distributed and parallel algorithms for weighted vertex cover and other covering problems. PODC 2009: 171-179 - [c33]Christos Koufogiannakis, Neal E. Young:
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. DISC 2009: 221-238 - 2008
- [j22]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008) - [r3]Neal E. Young:
Greedy Set-Cover Algorithms. Encyclopedia of Algorithms 2008 - [r2]Neal E. Young:
Online Paging and Caching. Encyclopedia of Algorithms 2008 - [i33]Christos Koufogiannakis, Neal E. Young:
Beating Simplex for Fractional Packing and Covering Linear Programs. CoRR abs/0801.1987 (2008) - [i32]Christos Koufogiannakis, Neal E. Young:
Flooding Overcomes Small Covering Constraints. CoRR abs/0807.0644 (2008) - 2007
- [j21]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): 937-961 (2007) - [c32]Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young:
Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. APBC 2007: 17-26 - [c31]Christos Koufogiannakis, Neal E. Young:
Beating Simplex for Fractional Packing and Covering Linear Programs. FOCS 2007: 494-504 - [c30]Dhiman Barman, Flip Korn, Divesh Srivastava, Dimitrios Gunopulos, Neal E. Young, Deepak Agarwal:
Parsimonious Explanations of Change in Hierarchical Data. ICDE 2007: 1273-1275 - [c29]Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos, Neal E. Young, Flip Korn, Divesh Srivastava:
Efficient and effective explanation of change in hierarchical summaries. KDD 2007: 6-15 - [r1]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j20]Marek Chrobak, Claire Kenyon, Neal E. Young:
The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett. 97(2): 68-72 (2006) - [c28]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians Via Online Bidding. LATIN 2006: 311-322 - [c27]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: 139-149 - [c26]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: 431-439 - 2005
- [j19]Stavros G. Kolliopoulos, Neal E. Young:
Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71(4): 495-505 (2005) - [c25]Marek Chrobak, Claire Kenyon, Neal E. Young:
The Reverse Greedy Algorithm for the Metric K-Median Problem. COCOON 2005: 654-660 - [i31]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians via Online Bidding. CoRR abs/cs/0504103 (2005) - [i30]Marek Chrobak, Claire Kenyon, Neal E. Young:
The reverse greedy algorithm for the metric k-median problem. CoRR abs/cs/0504104 (2005) - 2004
- [j18]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): 436-461 (2004) - 2002
- [j17]Neal E. Young:
On-Line File Caching. Algorithmica 33(3): 371-383 (2002) - [c24]Naveen Garg, Neal E. Young:
On-Line End-to-End Congestion Control. FOCS 2002: 303-312 - [c23]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman coding with unequal letter costs. STOC 2002: 785-791 - [i29]László Lovász, Neal E. Young:
Lecture Notes on Evasiveness of Graph Properties. CoRR cs.CC/0205031 (2002) - [i28]Richard J. Lipton, Neal E. Young:
Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory. CoRR cs.CC/0205035 (2002) - [i27]Neal E. Young:
On-Line Paging against Adversarially Biased Random Inputs. CoRR cs.DS/0205007 (2002) - [i26]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. CoRR cs.DS/0205008 (2002) - [i25]Yossi Matias, Jeffrey Scott Vitter, Neal E. Young:
Approximate Data Structures with Applications. CoRR cs.DS/0205010 (2002) - [i24]Samir Khuller, Balaji Raghavachari, Neal E. Young:
On Strongly Connected Digraphs with Bounded Cycle Length. CoRR cs.DS/0205011 (2002) - [i23]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-Time Approximation Scheme for Data Broadcast. CoRR cs.DS/0205012 (2002) - [i22]Qin Zhang, John M. Danskin, Neal E. Young:
A Codebook Generation Algorithm for Document Image Compression. CoRR cs.DS/0205029 (2002) - [i21]Stavros G. Kolliopoulos, Neal E. Young:
Tight Approximation Results for General Covering Integer Programs. CoRR cs.DS/0205030 (2002) - [i20]Naveen Garg, Neal E. Young:
On-Line End-to-End Congestion Control. CoRR cs.DS/0205032 (2002) - [i19]Neal E. Young:
On-Line File Caching. CoRR cs.DS/0205033 (2002) - [i18]Robert Lupton, F. Miller Maley, Neal E. Young:
Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic. CoRR cs.DS/0205034 (2002) - [i17]Neal E. Young:
Randomized Rounding without Solving the Linear Program. CoRR cs.DS/0205036 (2002) - [i16]Samir Khuller, Uzi Vishkin, Neal E. Young:
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover. CoRR cs.DS/0205037 (2002) - [i15]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002) - [i14]Neal E. Young:
Sequential and Parallel Algorithms for Mixed Packing and Covering. CoRR cs.DS/0205039 (2002) - [i13]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Digraph. CoRR cs.DS/0205040 (2002) - [i12]Neal E. Young, Robert Endre Tarjan, James B. Orlin:
Faster Parametric Shortest Path and Minimum Balance Algorithms. CoRR cs.DS/0205041 (2002) - [i11]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. CoRR cs.DS/0205042 (2002) - [i10]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Low-Degree Spanning Trees of Small Weight. CoRR cs.DS/0205043 (2002) - [i9]Neal E. Young:
The K-Server Dual and Loose Competitiveness for Paging. CoRR cs.DS/0205044 (2002) - [i8]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning and Shortest Path Trees. CoRR cs.DS/0205045 (2002) - [i7]Philip N. Klein, Neal E. Young:
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. CoRR cs.DS/0205046 (2002) - [i6]Neal E. Young:
K-Medians, Facility Location, and the Chernoff-Wald Bound. CoRR cs.DS/0205047 (2002) - [i5]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman Coding with Unequal Letter Costs. CoRR cs.DS/0205048 (2002) - [i4]Mordecai J. Golin, Neal E. Young:
Prefix Codes: Equiprobable Words, Unequal Letter Costs. CoRR cs.DS/0205049 (2002) - [i3]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 cs.DS/0205050 (2002) - [i2]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. CoRR cs.DS/0205051 (2002) - [i1]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. CoRR cs.DS/0205077 (2002) - 2001
- [c22]Stavros G. Kolliopoulos, Neal E. Young:
Tight Approximation Results for General Covering Integer Programs. FOCS 2001: 522-528 - [c21]Neal E. Young:
Sequential and Parallel Algorithms for Mixed Packing and Covering. FOCS 2001: 538-546 - 2000
- [j16]Neal E. Young:
On-Line Paging Against Adversarially Biased Random Inputs. J. Algorithms 37(1): 218-235 (2000) - [c20]Neal E. Young:
K-medians, facility location, and the Chernoff-Wald bound. SODA 2000: 86-95 - [c19]Claire Kenyon, Nicolas Schabanel, Neal E. Young:
Polynomial-time approximation scheme for data broadcast. STOC 2000: 659-666
1990 – 1999
- 1999
- [j15]Neal E. Young:
Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv. SIGACT News 30(4): 13-17 (1999) - [c18]Philip N. Klein, Neal E. Young:
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. IPCO 1999: 320-327 - [c17]Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling. SODA 1999: 846-847 - [c16]David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young:
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678 - [p1]Philip N. Klein, Neal E. Young:
Approximation Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j14]Robert Lupton, F. Miller Maley, Neal E. Young:
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. J. Algorithms 27(2): 339-356 (1998) - [c15]Neal E. Young:
On-Line File Caching. SODA 1998: 82-86 - [c14]Neal E. Young:
Bounding the Diffuse Adversary. SODA 1998: 420-425 - 1997
- [j13]S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young:
Orienting Graphs to Optimize Reachability. Inf. Process. Lett. 63(5): 229-235 (1997) - [j12]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. J. Algorithms 24(2): 310-324 (1997) - [c13]Qin Zhang, John M. Danskin, Neal E. Young:
A Codebook Generation Algorithm for Document Image Compression. Data Compression Conference 1997: 300-309 - 1996
- [j11]Samir Khuller, Balaji Raghavachari, Neal E. Young:
On Strongly Connected Digraphs with Bounded Cycle Length. Discret. Appl. Math. 69(3): 281-289 (1996) - [j10]Jessica Millar, Neil J. A. Sloane, Neal E. Young:
A New Operation on Sequences: The Boustrophedon Transform. J. Comb. Theory, Ser. A 76(1): 44-54 (1996) - [j9]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25(2): 355-368 (1996) - [j8]Mordecai J. Golin, Neal E. Young:
Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM J. Comput. 25(6): 1281-1292 (1996) - [c12]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. IPCO 1996: 105-117 - [c11]Robert Lupton, F. Miller Maley, Neal E. Young:
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. SODA 1996: 296-303 - 1995
- [j7]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995) - [j6]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995) - [c10]Neal E. Young:
Randomized Rounding Without Solving the Linear Program. SODA 1995: 170-178 - 1994
- [j5]Neal E. Young:
The k-Server Dual and Loose Competitiveness for Paging. Algorithmica 11(6): 525-541 (1994) - [j4]