1991
Neal E. Young
|
Associate Professor
Department of Computer Science University of California Riverside, CA 92521 |
(951) 827-7146
http://www.cs.ucr.edu/~neal 423 Engineering Building II |
Research Interests
Theoretical and practical analysis of algorithms, specializing in approximation algorithms for combinatorial optimization, including Lagrangian-relaxation algorithms and algorithms for NP-hard and online problems.
Education
1986
B.A. Computer Science and Mathematics, Cornell. Cum laude with distinction, Phi Beta Kappa
Experience
1/2004-present
Associate Professor, Computer Science, University of California Riverside
Teaching and research. NSF grant 0729071, Approximation Algorithms for Combinatorial Optimization. NSF grant 0626912, Physical Layer Dependent Neighbor Discovery and Topology Management in Ad hoc Networks. Student course evaluations are available online.
9/1999-12/2004
Senior Research Scientist, Senior Network Architect, Consultant, Akamai Technologies
Designed, coded, and operationalized network-wide, Lagrangian-relaxation-based, load-balancing components of the Internet's largest content-delivery network. Invented TCP/IP variant that maximizes network-wide throughput, with applications to bandwidth measurement. Continued basic research.
9/1995-3/2001
Assistant Professor, Computer Science, Dartmouth
Teaching and research. NSF CAREER grant 9720664, Combinatorial Approximation Algorithms. Invented a caching policy now in use in the Squid web proxy. Taught data structures and programming, discrete mathematics, algorithms, graphics, advanced algorithms, theory of computation, graduate algorithms and data structures, graduate theory of computation, novel frameworks in theoretical computer science, randomized rounding and Lagrangian relaxation algorithms. A few on-line course materials are available.
9/1994-9/1995
Postdoc, AT&T Bell Labs
Research in David Johnson's department, Mathematical Foundations of Computing.
1/1994-8/1994
Postdoc, Operations Research and Industrial Engineering, Cornell
Began research on the systematic design and analysis of Lagrangian-relaxation algorithms via the probabilistic method. Hosted by Eva Tardos.
9/1993-1/1997
Consultant, Astrophysics Department, Princeton and Fermilabs, Chicago
Designed and coded Lagrangian-relaxation algorithm to reduce data-collection cost of Sloan Digital Sky Survey.
9/1993-1/1994
Instructor, Computer Science, Princeton
9/1991-8/1993
Postdoc, UMIACS, University of Maryland
Research and teaching.
summer 1988
Research Intern, DEC (now HP) Systems Research Center, Palo Alto, California
Co-discovered the marking algorithm, a randomized cache replacement policy. Hosted by Jorge Stolfi.
summers 1985-1987
Instructor, Center for Talented Youth, Johns Hopkins
Taught computer science to teenagers.
summers 1984-1985
Programmer, Robotics Project, Computer Science, Cornell University
1/1983-8/1983
Programmer, Cornell Programming Environment Project, Computer Science, Cornell University
9/1981-9/1982
Programmer, Wintek Corporation, Lafayette, Indiana
Coded first generation of smARTWORK printed-circuit-board layout software.
Patent
Program Committees
Refereeing
ACM Journal of Experimental Algorithmics, ACM Transactions on Networking, Algorithmica, J. Algorithms, Cambridge Univ. Press, J. Computer System Sciences, Discrete Applied Mathematics, Distributed Computing, Information and Computation, Information Sciences, Information Processing Letters, INFORMS J. Computing, Mathematical Programming, Mathematica Slovaca, Mathematics of Operations Research, National Science Foundation (CISE), Networks, Operations Research, SIAM J. Optimization, SIAM J. Computing, SIAM J. Discrete Mathematics, SIAM J. Optimization, Theoretical Computer Science, Theory of Computing, ACM Symp. on Theory of Computing (STOC), ACM-SIAM Symp. on Discrete Algorithms (SODA), ACM Symposium on Parallel Algorithms and Architectures (SPAA), International Colloq. on Automata, Languages, and Programming (ICALP), IEEE Symp. on Foundations of Computer Science (FOCS), The International Computing and Combinatorics Conference (COCOON), International Symposium on Parallel Architectures, Algorithms & Networks (I-SPAN), The International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Scandinavian Workshop on Algorithm Theory (SWAT).
Publications (reverse chronological order)
2008
Incremental medians via online bidding
Algorithmica 50(455-478):311-322(2008); Latin American Theoretical Informatics 2005 (LATIN)
2007
Algorithmic approaches to selecting control clones in DNA array hybridization experiments
Journal of Bioinformatics and Computational Biology 5(4):937-961(2007); Asia Pacific Bioinformatics Conference (APBC2007)
2006
Greedy methods
Approximation Algorithms and Metaheuristics, edited by Teo Gonzales (Chapter 4)(2006)
2000
On-line paging against adversarially biased random inputs
Journal of Algorithms 37(1):218-235(2000); SODA'98
1996
Prefix codes: equiprobable words, unequal letter costs
SIAM Journal on Computing 25(6):1281-1304(1996); ICALP'94
1996
A new operation on sequences: the Boustrophedon transform
J. Combinatorial Theory, Series A 76(1):44-54(1996)
1996
On strongly connected digraphs with bounded cycle length
Discrete Applied Mathematics 69(3):281-289(1996)
1996
Low degree spanning trees of small weight
SIAM Journal on Computing 25(2):355-368(1996); STOC'94
1995
Approximating the minimum equivalent digraph
SIAM Journal on Computing 24(4):859-872(1995); SODA'94
1994
The k-server dual and loose competitiveness for paging
Algorithmica 11(6):525-541(1994); SODA'91
1991
Competitive paging and dual-guided algorithms for weighted caching and matching (Thesis)
Technical Report, Computer Science Department, Princeton University CS-TR-348-91(1991)
1991
Lecture notes on evasiveness of graph properties
Technical Report, Computer Science Department, Princeton University CS-TR-317-91(1991)