Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nick Reingold
2000 – 2009
- 2004
[j12]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004)- 2003
[c13]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564- 2001
[j11]Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True: Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Trans. Netw. 9(3): 265-280 (2001)- 2000
[c12]Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True: Deriving traffic demands for operational IP networks: methodology and experience. SIGCOMM 2000: 257-270
[c11]Todd Gormley, Nick Reingold, Eric Torng, Jeffery Westbrook: Generating adversaries for request-answer games. SODA 2000: 564-565
1990 – 1999
- 1999
[j10]Carsten Lund, Steven Phillips, Nick Reingold: Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. 58(1): 222-232 (1999)
[j9]Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan: Competitive On-Line Algorithms for Distributed Data Management. SIAM J. Comput. 28(3): 1086-1111 (1999)- 1997
[j8]Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold: A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. 63(2): 79-83 (1997)
[j7]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997)- 1996
[j6]Lance Fortnow, Nick Reingold: PP is Closed Under Truth-Table Reductions. Inf. Comput. 124(1): 1-6 (1996)
[j5]Nick Reingold, Jeffery Westbrook: Off-Line Algorithms for the List Update Problem. Inf. Process. Lett. 60(2): 75-80 (1996)- 1995
[j4]Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold: Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55(6): 329-332 (1995)
[j3]Richard Beigel, Nick Reingold, Daniel A. Spielman: PP Is Closed under Intersection. J. Comput. Syst. Sci. 50(2): 191-202 (1995)
[j2]Srinivasan Keshav, Carsten Lund, Steven Phillips, Nick Reingold, Huzur Saran: An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE Journal on Selected Areas in Communications 13(8): 1371-1382 (1995)
[c10]Carsten Lund, Steven Phillips, Nick Reingold: Adaptive Hodling Policies for IP over ATM Networks. INFOCOM 1995: 80-87- 1994
[j1]Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994)
[c9]Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan: On-Line Distributed Data Management. ESA 1994: 202-214
[c8]Carsten Lund, Steven Phillips, Nick Reingold: IP over connection-oriented networks and distributional paging. FOCS 1994: 424-434
[c7]- 1993
[c6]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415- 1992
[c5]Nick Reingold, Da-Wei Wang, Lenore D. Zuck: Games I/O Automata Play (Extended Abstract). CONCUR 1992: 325-339- 1991
[c4]Lance Fortnow, Nick Reingold: PP is Closed Under Truth-Table Reductions. Structure in Complexity Theory Conference 1991: 13-15
[c3]Richard Beigel, Nick Reingold, Daniel A. Spielman: The Perceptron Strikes Back. Structure in Complexity Theory Conference 1991: 286-291
[c2]Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260
[c1]Richard Beigel, Nick Reingold, Daniel A. Spielman: PP Is Closed Under Intersection (Extended Abstract). STOC 1991: 1-9
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:57 CET by the dblp team



