Neal E. Young
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
6912003
Competitive paging algorithms
A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young
Journal of Algorithms 12 (4), 685-699, 1991
5091991
Balancing minimum spanning and shortest path trees
S Khuller, B Raghavachari, N Young
Proc. Fourth ACM-SIAM Symp. on Discrete Algorithms, 243-250, 1993
364*1993
Balancing minimum spanning trees and shortest-path trees
S Khuller, B Raghavachari, NE Young
Algorithmica 14 (4), 305--321, 1995
3601995
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
3172011
The k-server dual and loose competitiveness for paging
NE Young
Algorithmica 11 (6), 525-541, 1994
2751994
Randomized rounding without solving the linear program
NE Young
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995
236*1995
Faster parametric shortest path and minimum‐balance algorithms
NE Young, RE Tarjan, JB Orlin
Networks 21 (2), 205-221, 1991
2241991
Sequential and parallel algorithms for mixed packing and covering
NE Young
Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001
2172001
On-line file caching
NE Young
Algorithmica 33 (3), 371-383, 2002
2112002
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
1892004
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
189*1999
On-line caching as cache size varies
NE Young
Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991
1421991
Approximating the minimum equivalent digraph
S Khuller, B Raghavachari, NE Young
SIAM Journal on Computing 24 (4), 859-872, 1995
1111995
Approximating the minimum equivalent digraph
S Khuller, B Raghavachari, N Young
Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994
1111994
Low degree spanning trees of small weight
S Khuller, B Raghavachari, NE Young
SIAM Journal on Computing 25 (2), 355-368, 1998
1091998
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
1091994
A nearly linear-time PTAS for explicit fractional packing and covering linear programs
C Koufogiannakis, NE Young
Algorithmica 70 (4), 648–674, 2014
1022014
Beating Simplex for fractional packing and covering linear programs
C Koufogiannakis, NE Young
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer …, 2007
102*2007
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
951994
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20