default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNick Reingold
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j13]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
- [j12]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
- [j11]Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford:
NetScope: traffic engineering for IP networks. IEEE Netw. 14(2): 11-19 (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 R. Westbrook:
Generating adversaries for request-answer games. SODA 2000: 564-565
1990 – 1999
- 1999
- [j10]Carsten Lund, Steven J. 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 R. 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 R. 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 R. 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 J. 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 J. Phillips, Nick Reingold, Huzur Saran:
An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE J. Sel. Areas Commun. 13(8): 1371-1382 (1995) - [c10]Carsten Lund, Steven J. Phillips, Nick Reingold:
Adaptive Hodling Policies for IP over ATM Networks. INFOCOM 1995: 80-87 - 1994
- [j1]Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994) - [c9]Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan:
On-Line Distributed Data Management. ESA 1994: 202-214 - [c8]Carsten Lund, Steven J. Phillips, Nick Reingold:
IP over connection-oriented networks and distributional paging. FOCS 1994: 424-434 - [c7]Carsten Lund, Nick Reingold:
Linear Programs for Randomized On-Line Algorithms. SODA 1994: 382-391 - 1993
- [c6]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. 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. SCT 1991: 13-15 - [c3]Richard Beigel, Nick Reingold, Daniel A. Spielman:
The Perceptron Strikes Back. SCT 1991: 286-291 - [c2]Sandy Irani, Nick Reingold, Jeffery R. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
