default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul R. Wilson 0001
Person information
- affiliation: University of Texas at Austin, TX, USA
- affiliation: University of Illinois at Chicago, Software Systems Laboratory, IL, USA
Other persons with the same name
- Paul R. Wilson — disambiguation page
- Paul R. Wilson 0002 — Independent Consultant
Other persons with a similar name
- Paul Wilson — disambiguation page
- Paul D. Wilson — University of Derby, School of Mathematics and Computing, UK
- Paul F. R. Wilson
- Paul N. Wilson — University of Hull, Department of Psychology, UK
- Paul P. H. Wilson
![[0000-0002-8555-4410]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-8555-4410")
— University of Wisconsin-Madison, Department of Nuclear Engineering and Engineering Physics, Madison, WI, USA - Paul Wilson 0001 (aka: Paul J. Wilson) — University of Wolverhampton, School of Mathematics and Computer Science, UK (and 1 more)
- Paul A. Wilson 0001 — University of Łódź, Poland
- Paul W. Wilson 0001 — Clemson University, Department of Economics, SC, USA (and 1 more)
- Paul Wilson 0002 — University of Leeds, School of Design, UK (and 1 more)
- Paul W. Wilson 0002 — University College London, UK (and 1 more)
- show all similar names
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j9]Yannis Smaragdakis, Scott F. Kaplan, Paul R. Wilson:
The EELRU adaptive replacement algorithm. Perform. Evaluation 53(2): 93-123 (2003)- [j8]Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson:
Flexible reference trace reduction for VM simulations. ACM Trans. Model. Comput. Simul. 13(1): 1-38 (2003) - 2000
- [c18]Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe, Paul R. Wilson:
Hoard: A Scalable Memory Allocator for Multithreaded Applications. ASPLOS 2000: 117-128 - [c17]Yannis Smaragdakis, Paul R. Wilson:
Performing Replacement in Modem Pools. USENIX ATC, General Track 2000: 277-292
1990 – 1999
- 1999
- [c16]Sheetal V. Kakkad, Paul R. Wilson:
Address Translation Strategies in the Texas Persistent Store. COOTS 1999: 99-114 - [c15]Scott F. Kaplan, Yannis Smaragdakis, Paul R. Wilson:
Trace Reduction for Virtual Memory Simulations. SIGMETRICS 1999: 47-58 - [c14]Yannis Smaragdakis, Scott F. Kaplan, Paul R. Wilson:
EELRU: Simple and Effective Adaptive Page Replacement. SIGMETRICS 1999: 122-133 - [c13]Paul R. Wilson, Scott F. Kaplan, Yannis Smaragdakis:
The Case for Compressed Caching in Virtual Memory Systems. USENIX ATC, General Track 1999: 101-116 - 1998
- [c12]Mark S. Johnstone, Paul R. Wilson:
The Memory Fragmentation Problem: Solved? ISMM 1998: 26-36 - [c11]Sheetal V. Kakkad, Mark S. Johnstone, Paul R. Wilson:
Portable Run-Time Type Description for Conventional Compilers. ISMM 1998: 146-153 - 1995
- [c10]Paul R. Wilson, Mark S. Johnstone, Michael Neely, David Boles:
Dynamic Storage Allocation: A Survey and Critical Review. IWMM 1995: 1-116 - 1994
- [j7]Paul R. Wilson, Sheetal V. Kakkad, Shubhendu S. Mukherjee:
Anomalies and adaptation in the analysis and development of prepaging policies. J. Syst. Softw. 27(2): 147-153 (1994) - 1992
- [c9]Paul R. Wilson:
Uniprocessor Garbage Collection Techniques. IWMM 1992: 1-42 - [c8]Michael S. Lam, Paul R. Wilson, Thomas G. Moher:
Object Type Directed Garbage Collection To Improve Locality. IWMM 1992: 404-425 - [c7]Paul R. Wilson, Michael S. Lam, Thomas G. Moher:
Caching Considerations for Generational Garbage Collection. LISP and Functional Programming 1992: 32-42 - [c6]Vivek Singhal, Sheetal V. Kakkad, Paul R. Wilson:
Texas: An Efficient, Portable Persistent Store. POS 1992: 11-33 - [c5]Vivek Singhal, Sheetal V. Kakkad, Paul R. Wilson:
Texas: good, fast, cheap persistence for C++. OOPSLA Addendum 1992: 145-147 - 1991
- [j6]Paul R. Wilson:
Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware. SIGARCH Comput. Archit. News 19(4): 6-13 (1991) - [j5]Paul R. Wilson:
Some issues and strategies in heap management and memory hierarchies. ACM SIGPLAN Notices 26(3): 45-52 (1991) - [j4]Thomas G. Moher, Paul R. Wilson:
Offsetting Human Limits With Debugging Technoloy - Guest Editors' Introduction. IEEE Softw. 8(3): 11-13 (1991) - [c4]Paul R. Wilson, Michael S. Lam, Thomas G. Moher:
Effective "Static-Graph" Reorganization to Improve Locality in Garbage-Collected Systems. PLDI 1991: 177-191 - [c3]Paul R. Wilson, Barry Hayes:
Garbage collection in object oriented systems. OOPSLA Addendum 1991: 63-71
1980 – 1989
- 1989
- [j3]Paul R. Wilson:
A simple bucket-brigade advancement mechanism for generation-bases garbage collection. ACM SIGPLAN Notices 24(5): 38-46 (1989) - [j2]Paul R. Wilson, Thomas G. Moher:
A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardware. ACM SIGPLAN Notices 24(5): 87-92 (1989) - [c2]Paul R. Wilson, Thomas G. Moher:
Design of the Opportunistic Garbage Collector. OOPSLA 1989: 23-35 - [c1]Paul R. Wilson, Thomas G. Moher:
Demonic Memories for Process Histories. PLDI 1989: 330-343 - 1988
- [j1]Paul R. Wilson:
Opportunistic garbage collection. ACM SIGPLAN Notices 23(12): 98-102 (1988)
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-07-17 20:30 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:
