![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jim Challenger
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j5]Gabriela Jacques-Silva, Jim Challenger, Lou Degenaro, James Giles, Rohit Wagle:
Self healing in System-S. Clust. Comput. 11(3): 247-257 (2008) - 2007
- [c10]Gabriela Jacques-Silva, Jim Challenger, Lou Degenaro, James Giles, Rohit Wagle:
Towards Autonomic Fault Recovery in System-S. ICAC 2007: 31 - 2005
- [j4]Jim Challenger, Paul Dantzig, Arun Iyengar, Karen Witting:
A fragment-based approach for efficiently creating dynamic web content. ACM Trans. Internet Techn. 5(2): 359-389 (2005) - 2004
- [j3]Jim Challenger, Paul Dantzig, Arun Iyengar, Mark S. Squillante, Li Zhang:
Efficiently serving dynamic data at highly accessed web sites. IEEE/ACM Trans. Netw. 12(2): 233-246 (2004) - 2003
- [j2]Arun Iyengar, Shudong Jin, Jim Challenger:
Techniques for efficiently allocating persistent storage. J. Syst. Softw. 68(2): 85-102 (2003) - [c9]Karen Witting, Jim Challenger, Brian O'Connell:
Monitoring Distributed Systems: A Publish/Subscribe Methodology and Architecture. Integrated Network Management 2003: 89-92 - 2002
- [c8]Robert Filepp, Jim Challenger, Daniela Rosu:
Improving the accessibility of aurally rendered HTML tables. ASSETS 2002: 9-16 - 2001
- [c7]Arun Iyengar, Shudong Jin, Jim Challenger:
Efficient Algorithms for Persistent Storage Allocation. MSS 2001: 85-100 - [c6]Jim Challenger, Arun Iyengar, Paul Dantzig, Daniel M. Dias, Nathaniel Mills:
Engineering Highly Accessed Web Sites for Performance. Web Engineering 2001: 247-265 - 2000
- [j1]Arun Iyengar, Jim Challenger, Daniel M. Dias, Paul Dantzig:
High-Performance Web Site Design Techniques. IEEE Internet Comput. 4(2): 17-26 (2000) - [c5]Jim Challenger, Arun Iyengar, Karen Witting, Cameron Ferstat, Paul Reed:
A Publishing System for Efficiently Creating Dynamic Web Content. INFOCOM 2000: 844-853
1990 – 1999
- 1999
- [c4]Jim Challenger, Arun Iyengar, Paul Dantzig:
A Scalable System for Consistently Caching Dynamic Web Data. INFOCOM 1999: 294-303 - 1998
- [c3]Jim Challenger, Paul Dantzig, Arun Iyengar:
A Scalable and Highly Available System for Serving Dynamic Data at Frequently Accessed Web Sites. SC 1998: 47 - 1997
- [c2]Arun Iyengar, Jim Challenger:
Improving Web Server Performance by Caching Dynamic Data. USENIX Symposium on Internet Technologies and Systems 1997 - 1996
- [c1]Yew-Huey Liu, Paul Dantzig, Ching-Farn Eric Wu, Jim Challenger, Lionel M. Ni:
A Distributed Scalable Web Server and Its Program Visualization in Multiple Platforms. ICDCS 1996: 665-672
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint