Neal E. Young

Navedeno

	Vse	Od leta 2018
Navedbe	6287	1538
indeks h	40	21
indeks i10	59	37

320

160

240

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202327 35 45 59 80 82 119 121 126 151 171 255 246 271 283 276 252 248 229 219 233 242 307 254 300 317 270 272 251 265 163

Javni dostop

Prikaži vse

9 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityPreverjeni e-poštni naslov na northwestern.edu
Marek ChrobakUniversity of California at RiversidePreverjeni e-poštni naslov na cs.ucr.edu
Philip KleinProfessor of Computer Science, Brown UniversityPreverjeni e-poštni naslov na brown.edu
Mordecai GolinProfessor: Department of Computer Science & Engineering, HKUSTPreverjeni e-poštni naslov na cse.ust.hk
Daniel SleatorProfessor of Computer Science, Carnegie Mellon UniversityPreverjeni e-poštni naslov na cs.cmu.edu
Eamonn KeoghDistinguished Professor of Computer Science, University of California - RiversidePreverjeni e-poštni naslov na cs.ucr.edu
Abdullah MueenAssociate Professor, Department of Computer Science, University of New MexicoPreverjeni e-poštni naslov na cs.unm.edu
Amos FiatProfessor of Computer Science, Tel Aviv UniversityPreverjeni e-poštni naslov na tau.ac.il
Michael LubyBitRipple and ICSIPreverjeni e-poštni naslov na bitripple.com
Clifford SteinProfessor of IEOR and CS, Columbia UniversityPreverjeni e-poštni naslov na ieor.columbia.edu
Stavros KolliopoulosNational and Kapodistrian University of AthensPreverjeni e-poštni naslov na di.uoa.gr
Yossi MatiasGooglePreverjeni e-poštni naslov na tau.ac.il
Srikanth KrishnamurthyUC RiversidePreverjeni e-poštni naslov na cs.ucr.edu
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, FrancePreverjeni e-poštni naslov na enseeiht.fr
Ece Gelal SoyakBahcesehir UniversityPreverjeni e-poštni naslov na eng.bau.edu.tr
James B. OrlinProfessor, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityPreverjeni e-poštni naslov na cs.princeton.edu
David KargerProfessor of Computer Science, MITPreverjeni e-poštni naslov na mit.edu
Mikkel ThorupUniversity of CopenhagenPreverjeni e-poštni naslov na diku.dk
Ian MunroUniversity Professor, University of WaterlooPreverjeni e-poštni naslov na uwaterloo.ca

Spremljaj

Neal E. Young

University of California, Riverside

Preverjeni e-poštni naslov na ucr.edu - Domača stran

approximation algorithms online algorithms algorithms combinatorial optimization theory of computation


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	722	2003
Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991	581	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	416	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	403*	1993
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	401	1995
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	305	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	260*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	255	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	239	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	234	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	89	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	83	2000
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	82*	2015

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji