Neal E. Young 个人学术档案

引用次数

	总计	2019 年至今
引用	6458	1379
h 指数	41	20
i10 指数	61	35

340

170

255

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202427 36 42 57 77 80 111 113 127 150 169 256 240 269 284 277 257 245 234 222 235 246 303 265 297 325 268 273 254 263 224 97

开放获取的出版物数量

查看全部

9 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

samir khullerBarris Professor and Chair of Computer Science, Northwestern University在 northwestern.edu 的电子邮件经过验证
Marek ChrobakUniversity of California at Riverside在 cs.ucr.edu 的电子邮件经过验证
Philip KleinProfessor of Computer Science, Brown University在 brown.edu 的电子邮件经过验证
Mordecai GolinProfessor: Department of Computer Science & Engineering, HKUST在 cse.ust.hk 的电子邮件经过验证
Daniel SleatorProfessor of Computer Science, Carnegie Mellon University在 cs.cmu.edu 的电子邮件经过验证
Eamonn KeoghDistinguished Professor of Computer Science, University of California - Riverside在 cs.ucr.edu 的电子邮件经过验证
Abdullah MueenAssociate Professor, Department of Computer Science, University of New Mexico在 cs.unm.edu 的电子邮件经过验证
Amos FiatProfessor of Computer Science, Tel Aviv University在 tau.ac.il 的电子邮件经过验证
Michael LubyBitRipple and ICSI在 bitripple.com 的电子邮件经过验证
Clifford SteinProfessor of IEOR and CS, Columbia University在 ieor.columbia.edu 的电子邮件经过验证
Stavros KolliopoulosNational and Kapodistrian University of Athens在 di.uoa.gr 的电子邮件经过验证
Yossi MatiasGoogle在 tau.ac.il 的电子邮件经过验证
Srikanth KrishnamurthyUC Riverside在 cs.ucr.edu 的电子邮件经过验证
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, France在 enseeiht.fr 的电子邮件经过验证
Ece Gelal SoyakBahcesehir University在 eng.bau.edu.tr 的电子邮件经过验证
James B. OrlinProfessor, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Robert TarjanProfessor of Computer Science, Princeton University在 cs.princeton.edu 的电子邮件经过验证
David KargerProfessor of Computer Science, MIT在 mit.edu 的电子邮件经过验证
Mikkel ThorupUniversity of Copenhagen在 diku.dk 的电子邮件经过验证
Ian MunroUniversity Professor, University of Waterloo在 uwaterloo.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	605	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	442	2011
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	406	1995
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	317	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	266*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	260	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	244	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	241	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	152	1991
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 24 (4), 859-872, 1995	124	1995
A nearly linear-time PTAS for explicit fractional packing and covering linear programs C Koufogiannakis, NE Young Algorithmica 70 (4), 648–674, 2014	120	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	108	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	94	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	85	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	81	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	71	2006

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用