Neal E. Young

Citirano

	Sve	Od 2018.
Citati	6332	1583
H-indeks	40	22
i10-indeks	59	37

340

170

255

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202327 35 45 59 80 82 119 121 126 151 172 256 244 272 281 275 252 249 227 221 231 242 308 254 299 324 270 273 252 262 202

Javni pristup

Prikaži sve

9 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityPotvrđena adresa e-pošte na northwestern.edu
Marek ChrobakUniversity of California at RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Philip KleinProfessor of Computer Science, Brown UniversityPotvrđena adresa e-pošte na brown.edu
Mordecai GolinProfessor: Department of Computer Science & Engineering, HKUSTPotvrđena adresa e-pošte na cse.ust.hk
Daniel SleatorProfessor of Computer Science, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Eamonn KeoghDistinguished Professor of Computer Science, University of California - RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Abdullah MueenAssociate Professor, Department of Computer Science, University of New MexicoPotvrđena adresa e-pošte na cs.unm.edu
Amos FiatProfessor of Computer Science, Tel Aviv UniversityPotvrđena adresa e-pošte na tau.ac.il
Michael LubyBitRipple and ICSIPotvrđena adresa e-pošte na bitripple.com
Clifford SteinProfessor of IEOR and CS, Columbia UniversityPotvrđena adresa e-pošte na ieor.columbia.edu
Stavros KolliopoulosNational and Kapodistrian University of AthensPotvrđena adresa e-pošte na di.uoa.gr
Yossi MatiasGooglePotvrđena adresa e-pošte na tau.ac.il
Srikanth KrishnamurthyUC RiversidePotvrđena adresa e-pošte na cs.ucr.edu
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, FrancePotvrđena adresa e-pošte na enseeiht.fr
Ece Gelal SoyakBahcesehir UniversityPotvrđena adresa e-pošte na eng.bau.edu.tr
James B. OrlinProfessor, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityPotvrđena adresa e-pošte na cs.princeton.edu
David KargerProfessor of Computer Science, MITPotvrđena adresa e-pošte na mit.edu
Mikkel ThorupUniversity of CopenhagenPotvrđena adresa e-pošte na diku.dk
Ian MunroUniversity Professor, University of WaterlooPotvrđena adresa e-pošte na uwaterloo.ca

Prati

Neal E. Young

University of California, Riverside

Potvrđena adresa e-pošte na ucr.edu - Početna stranica

approximation algorithms online algorithms algorithms combinatorial optimization theory of computation


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori