Neal E. Young

인용

	전체	2019년 이후
서지정보	6539	1453
h-index	42	20
i10-index	61	39

340

170

255

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202428 36 42 57 78 79 110 113 128 146 169 254 241 275 283 276 257 248 230 223 236 245 308 262 298 330 268 272 256 258 218 181

공개 액세스

모두 보기

자료 10개

자료 0개

공개

비공개

재정 지원 요구사항 기준

공동 저자

samir khullerBarris Professor and Chair of Computer Science, Northwestern Universitynorthwestern.edu의 이메일 확인됨
Marek ChrobakUniversity of California at Riversidecs.ucr.edu의 이메일 확인됨
Philip KleinProfessor of Computer Science, Brown Universitybrown.edu의 이메일 확인됨
Mordecai GolinProfessor: Department of Computer Science & Engineering, HKUSTcse.ust.hk의 이메일 확인됨
Daniel SleatorProfessor of Computer Science, Carnegie Mellon Universitycs.cmu.edu의 이메일 확인됨
Eamonn KeoghDistinguished Professor of Computer Science, University of California - Riversidecs.ucr.edu의 이메일 확인됨
Abdullah MueenProfessor, Department of Computer Science, University of New Mexicocs.unm.edu의 이메일 확인됨
Amos FiatProfessor of Computer Science, Tel Aviv Universitytau.ac.il의 이메일 확인됨
Michael LubyBitRipple and ICSIbitripple.com의 이메일 확인됨
Clifford SteinProfessor of IEOR and CS, Columbia Universityieor.columbia.edu의 이메일 확인됨
Stavros KolliopoulosNational and Kapodistrian University of Athensdi.uoa.gr의 이메일 확인됨
Yossi MatiasGoogletau.ac.il의 이메일 확인됨
Srikanth KrishnamurthyUC Riversidecs.ucr.edu의 이메일 확인됨
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, Franceenseeiht.fr의 이메일 확인됨
Ece Gelal SoyakBahcesehir Universitybau.edu.tr의 이메일 확인됨
James B. OrlinProfessor, Massachusetts Institute of Technologymit.edu의 이메일 확인됨
Robert TarjanProfessor of Computer Science, Princeton Universitycs.princeton.edu의 이메일 확인됨
David KargerProfessor of Computer Science, MITmit.edu의 이메일 확인됨
Mikkel ThorupUniversity of Copenhagendiku.dk의 이메일 확인됨
Ian MunroUniversity Professor, University of Waterloouwaterloo.ca의 이메일 확인됨

팔로우

Neal E. Young

University of California, Riverside

ucr.edu의 이메일 확인됨 - 홈페이지

approximation algorithms online algorithms algorithms combinatorial optimization theory of computation


제목 서지정보순 정렬 연도순 정렬 제목순 정렬	인용 인용	연도
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	730	2003
Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991	611	1991
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	444	2011
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	412	1995
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	322	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	269*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	261	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	247	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	242	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	207*	2004
On-line caching as cache size varies NE Young Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991	155	1991
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 24 (4), 859-872, 1995	126	1995
A nearly linear-time PTAS for explicit fractional packing and covering linear programs C Koufogiannakis, NE Young Algorithmica 70 (4), 648–674, 2014	122	2014
Low degree spanning trees of small weight S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 25 (2), 355-368, 1998	116*	1998
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	112	1994
On the number of iterations for Dantzig--Wolfe optimization and packing-covering approximation algorithms P Klein, NE Young SIAM Journal on Computing 44 (4), 1154-1172, 2015	96*	2015
Approximation algorithms for covering/packing integer programs SG Kolliopoulos, NE Young Journal of Computer and System Sciences 71 (4), 495-505, 2005	95	2005
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	84	2000
A primal-dual parallel approximation technique applied to weighted set and vertex covers S Khuller, U Vishkin, NE Young J. Algorithms 17 (2), 280-289, 1994	82	1994
The reverse greedy algorithm for the metric k-median problem M Chrobak, C Kenyon, NE Young Information Processing Letters 97 (2), 68-72, 2006	76	2006

현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.

학술자료 1–20

연간 인용횟수

중복된 서지정보

병합된 서지정보

공동 저자 추가공동 저자

팔로우

인용

공동 저자