Neal E. Young

Cited by

	All	Since 2016
Citations	5833	1653
h-index	39	23
i10-index	56	39

320

160

240

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202128 33 43 62 78 86 111 121 130 149 161 263 235 275 274 270 276 251 239 220 233 235 291 260 298 318 257 296 224

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityVerified email at northwestern.edu
Marek ChrobakUniversity of California at RiversideVerified email at cs.ucr.edu
Philip KleinProfessor of Computer Science, Brown UniversityVerified email at brown.edu
Daniel SleatorProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Eamonn KeoghDistinguished Professor of Computer Science, University of California - RiversideVerified email at cs.ucr.edu
Abdullah MueenAssociate Professor, Department of Computer Science, University of New MexicoVerified email at cs.unm.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Amos FiatProfessor of Computer Science, Tel Aviv UniversityVerified email at tau.ac.il
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Yossi MatiasGoogleVerified email at tau.ac.il
Stavros KolliopoulosNational and Kapodistrian University of AthensVerified email at di.uoa.gr
Srikanth KrishnamurthyUC RiversideVerified email at cs.ucr.edu
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, FranceVerified email at enseeiht.fr
Ece Gelal SoyakBahcesehir UniversityVerified email at eng.bau.edu.tr
James B. OrlinProfessor, Massachusetts Institute of TechnologyVerified email at mit.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
David KargerProfessor of Computer Science, MITVerified email at mit.edu
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
Sándor P. FeketeTechnische Universität BraunschweigVerified email at tu-bs.de
Dimitrios GunopulosNational and Kapodistrian University of AthensVerified email at di.uoa.gr

Neal E. Young

University of California, Riverside

Verified email at ucr.edu - Homepage

approximation algorithms online algorithms algorithms combinatorial optimization theory of computation


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An efficient targeting strategy for multiobject spectrograph surveys: the Sloan Digital Sky Survey MR Blanton, H Lin, RH Lupton, FM Maley, NE Young, I Zehavi, J Loveday The Astronomical Journal 125, 2276, 2003	707	2003
Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991	538	1991
Balancing minimum spanning and shortest path trees S Khuller, B Raghavachari, N Young Proc. Fourth ACM-SIAM Symp. on Discrete Algorithms, 243-250, 1993	386*	1993
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	382	1995
Logical-shapelets: an expressive primitive for time series classification A Mueen, E Keogh, NE Young Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011	336	2011
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	293*	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	249*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	239	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	230	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	225	2001
Rounding algorithms for a geometric embedding of minimum multiway cut DR Karger, P Klein, C Stein, M Thorup, NE Young Mathematics of Operations Research 29 (3), 436-461, 2004	193	2004
Rounding algorithms for a geometric embedding of minimum multiway cut DR Karger, P Klein, C Stein, M Thorup, NE Young Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	193*	1999
On-line caching as cache size varies NE Young Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991	148	1991
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 24 (4), 859-872, 1995	115	1995
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, N Young Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994	115	1994
Low degree spanning trees of small weight S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 25 (2), 355-368, 1998	111	1998
Low degree spanning trees of small weight S Khuller, B Raghavachari, N Young Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	111	1994
A nearly linear-time PTAS for explicit fractional packing and covering linear programs C Koufogiannakis, NE Young Algorithmica 70 (4), 648–674, 2014	104	2014
Simple strategies for large zero-sum games with applications to complexity theory RJ Lipton, NE Young Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	96	1994
Polynomial-time approximation scheme for data broadcast C Kenyon, N Schabanel, NE Young Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	83	2000

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors