Neal E. Young

인용

	전체	2018년 이후
서지정보	6334	1584
h-index	40	22
i10-index	59	37

340

170

255

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202327 35 45 59 80 82 119 121 126 151 171 255 244 270 282 276 252 248 229 219 233 243 307 254 300 324 270 273 252 262 203

공개 액세스

모두 보기

자료 9개

자료 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 MueenAssociate Professor, 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 Universityeng.bau.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	724	2003
Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991	586	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	425	2011
Balancing minimum spanning and shortest path trees S Khuller, B Raghavachari, N Young Proc. Fourth ACM-SIAM Symp. on Discrete Algorithms, 243-250, 1993	404*	1993
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	402	1995
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	307	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	262*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	257	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	240	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	236	2001
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	203	1999
On-line caching as cache size varies NE Young Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991	161	1991
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 24 (4), 859-872, 1995	123	1995
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, N Young Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994	123	1994
A nearly linear-time PTAS for explicit fractional packing and covering linear programs C Koufogiannakis, NE Young Algorithmica 70 (4), 648–674, 2014	118	2014
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	117	1994
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	99	1994
Approximation algorithms for covering/packing integer programs SG Kolliopoulos, NE Young Journal of Computer and System Sciences 71 (4), 495-505, 2005	91	2005
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	85*	2015
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

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

학술자료 1–20

연간 인용횟수

중복된 서지정보

병합된 서지정보

공동 저자 추가공동 저자

팔로우

인용

공동 저자