팔로우
Neal E. Young
제목
인용
인용
연도
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
7242003
Competitive paging algorithms
A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young
Journal of Algorithms 12 (4), 685-699, 1991
5861991
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
4252011
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
4021995
The k-server dual and loose competitiveness for paging
NE Young
Algorithmica 11 (6), 525-541, 1994
3071994
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
2572002
Faster parametric shortest path and minimum‐balance algorithms
NE Young, RE Tarjan, JB Orlin
Networks 21 (2), 205-221, 1991
2401991
Sequential and parallel algorithms for mixed packing and covering
NE Young
Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001
2362001
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
2031999
On-line caching as cache size varies
NE Young
Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991
1611991
Approximating the minimum equivalent digraph
S Khuller, B Raghavachari, NE Young
SIAM Journal on Computing 24 (4), 859-872, 1995
1231995
Approximating the minimum equivalent digraph
S Khuller, B Raghavachari, N Young
Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994
1231994
A nearly linear-time PTAS for explicit fractional packing and covering linear programs
C Koufogiannakis, NE Young
Algorithmica 70 (4), 648–674, 2014
1182014
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
1171994
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
991994
Approximation algorithms for covering/packing integer programs
SG Kolliopoulos, NE Young
Journal of Computer and System Sciences 71 (4), 495-505, 2005
912005
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
842000
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20