World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
43
Citations
7521
World Ranking
8006
National Ranking
3443

Overview

Neal E. Young is affiliated with the University of California, Riverside in the United States. Their research primarily falls within the field of Computer Science, with significant focus on several subfields including Artificial Intelligence, Computer Networks and Communications, Information Systems, Electrical and Electronic Engineering, and General Health Professions.

The scientist's research interests cover a range of topics related to machine learning and algorithms, algorithms and data compression, imbalanced data classification techniques, optimization and search problems, advanced data storage technologies, distributed systems and fault tolerance, as well as caching and content delivery.

Frequent collaborators include Marek Chrobák, Mordecai J. Golin, Rajmohan Rajaraman, J. Ian Munro, and Samuel Haney.

Their recent scholarly contributions include the following papers:

  • Comparison and evaluation of state-of-the-art LSM merge policies, 2021, The VLDB Journal
  • A Simple Algorithm for Optimal Search Trees with Two-way Comparisons, 2021, ACM Transactions on Algorithms
  • Online Paging with Heterogeneous Cache Slots, 2024, Algorithmica
  • Online Paging with Heterogeneous Cache Slots, 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Classification via Two-Way Comparisons, 2023, arXiv (Cornell University)

Neal E. Young has published in venues such as ACM Transactions on Algorithms, arXiv (Cornell University), The VLDB Journal, Algorithmica, and the Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Best Publications

  • An efficient targeting strategy for multiobject spectrograph surveys: The Sloan digital sky survey "tiling" algorithm

    Michael R. Blanton;Michael R. Blanton;Huan Lin;Robert H. Lupton;F. Miller Maley

  • Competitive paging algorithms

    Amos Fiat;Richard M. Karp;Michael Luby;Lyle A. McGeoch

  • Balancing minimum spanning trees and shortest-path trees

    S. Khuller;B. Raghavachari;N. Young

  • Logical-shapelets: an expressive primitive for time series classification

    Abdullah Mueen;Eamonn Keogh;Neal Young

  • The k -server dual and loose competitiveness for paging

    Neal E. Young

  • Sequential and parallel algorithms for mixed packing and covering

    N.E. Young

  • Randomized rounding without solving the linear program

    Neal E. Young

  • Faster Parametric Shortest Path and Minimum Balance Algorithms

    Neal E. Young;Robert E. Tarjant;James B. Orlin

  • Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

    David R. Karger;Philip Klein;Cliff Stein;Mikkel Thorup

  • On-line caching as cache size varies

    Neal Young

  • Approximating the Minimum Equivalent Digraph

    Samir Khuller;Balaji Raghavachari;Neal Young

  • Faster Parametric Shortest Path and Minimum Balance Algorithms

    Neal Young;Robert Tarjan;James Orlin

  • Low-Degree Spanning Trees of Small Weight

    Samir Khuller;Balaji Raghavachari;Neal Young;Neal Young

  • On-line file caching

    Neal E. Young

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

    Richard J. Lipton;Neal E. Young

  • Low degree spanning trees of small weight

    Samir Khuller;Balaji Raghavachari;Neal Young

  • On-line file caching

    Neal E. Young

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

    Christos Koufogiannakis;Neal E. Young

  • Approximation algorithms for covering/packing integer programs

    Stavros G. Kolliopoulos;Neal E. Young

  • Approximating the minimum equivalent digraph

    Samir Khuller;Balaji Raghavachari;Neal E. Young

Frequent Co-Authors

Samir Khuller
Samir Khuller Northwestern University
Marek Chrobak
Marek Chrobak University of California, Riverside
Claire Kenyon
Claire Kenyon Brown University
Philip N. Klein
Philip N. Klein Brown University
J. Ian Munro
J. Ian Munro University of Waterloo
Srikanth V. Krishnamurthy
Srikanth V. Krishnamurthy University of California, Riverside
Yossi Matias
Yossi Matias Google (United States)
Mikkel Thorup
Mikkel Thorup University of Copenhagen
Vagelis Hristidis
Vagelis Hristidis University of California, Riverside

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree in the USA opens doors to a wide range of online study options and career pathways. Many students are now considering related fields for broader opportunities and to tailor their skills for emerging industries.

For those interested in environmental impact and sustainability, exploring the cheapest online environmental science degree options can be a smart move. If you're more drawn to applied technologies, you might also want to investigate the mechanical engineering cost of education to find affordable and flexible programs.

Flexibility is key for remote learners. Prospective students often wonder, can you get a physics degree online? The answer is yes—many reputable institutions offer fully online physics and related science degrees.

Finally, data-driven industries are on the rise, making analytics a hot career. If you're thinking about postgraduate education, explore the cheapest data science masters in usa to save on tuition while building high-demand skills.

Best Scientists Citing Neal E. Young

Trending Scientists

Recently Published Articles