default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArvin Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1993
[c13]Jeffrey C. Becker, Arvin Park:
An Analysis of the Information Content of Address and Data Reference Streams. SIGMETRICS 1993: 262-263- 1992
- [j8]Charles U. Martel, Arvin Park, Ramesh Subramonian:
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM J. Comput. 21(6): 1070-1099 (1992) - [j7]Arvin Park, Ron Maeder:
Codes to reduce switching transients across VLSI I/O pins. SIGARCH Comput. Archit. News 20(4): 17-21 (1992) - [c12]Matthew K. Farrens, Arvin Park, Allison Woodruff:
CCHIME: A Cache Coherent Hybrid Interconnected Memory Extension. IPPS 1992: 573-577 - [c11]Matthew K. Farrens, Arvin Park, Rob Fanfelle, Pius Ng, Gary S. Tyson:
A partitioned translation lookaside buffer approach to reducing address bandwith. ISCA 1992: 435 - [c10]Matthew K. Farrens, Arvin Park, Gary S. Tyson:
Modifying VM hardware to reduce address pin requirements. MICRO 1992: 210-213 - 1991
- [j6]Jeffrey C. Becker, Arvin Park:
Analysis of the Paging Behavior of UNIX. SIGMETRICS Perform. Evaluation Rev. 19(2): 36-43 (1991) - [j5]Jonathan W. Brandt, Arvin Park:
Using color-image maps to study collisions in the three-body problem. Vis. Comput. 7(1): 13-18 (1991) - [c9]Jeffrey C. Becker, Charles U. Martel, Arvin Park:
General Asynchrony Is Not Expensive for PRAMs. IPPS 1991: 70-75 - [c8]Matthew K. Farrens, Arvin Park:
Dynamic Base Register Caching: A Technique for Reducing Address Bus Width. ISCA 1991: 128-137 - [c7]Jeffrey C. Becker, Arvin Park, Matthew K. Farrens:
An Analysis of the Information Content of Address Reference Streams. MICRO 1991: 19-24 - [c6]Matthew K. Farrens, Arvin Park:
Workload and Implementation Considerations for Dynamic Base Register Caching. MICRO 1991: 62-68 - [c5]Arvin Park, Jeffrey C. Becker:
Measurements of the Paging Behavior of UNIX. SIGMETRICS 1991: 216-217 - 1990
- [j4]Richard J. Lipton, Arvin Park:
The Processor Identity Problem. Inf. Process. Lett. 36(2): 91-94 (1990) - [j3]Arvin Park, Krishnaswamy Balasubramanian:
Reducing Communication Costs for Sorting on Mesh-Connected and Linearly Connected Parallel Computers. J. Parallel Distributed Comput. 9(3): 318-322 (1990) - [j2]Arvin Park, Jeffrey C. Becker, Richard J. Lipton:
IOStone: a synthetic file system benchmark. SIGARCH Comput. Archit. News 18(2): 45-52 (1990) - [c4]Charles U. Martel, Ramesh Subramonian, Arvin Park:
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs. FOCS 1990: 590-599 - [c3]Arvin Park, Matthew K. Farrens:
Address compression through base register caching. MICRO 1990: 193-199
1980 – 1989
- 1989
- [j1]Arvin Park, Krishnaswamy Balasubramanian, Richard J. Lipton:
Array Access Bounds for Block Storage Memory Systems. IEEE Trans. Computers 38(6): 909-913 (1989) - 1987
- [c2]Arvin Park, Krishnaswamy Balasubramanian:
Improved sorting algorithms for parallel computers. ACM Conference on Computer Science 1987: 239-244 - [c1]Hector Garcia-Molina, Arvin Park, Lawrence R. Rogers:
Performance Through Memory. SIGMETRICS 1987: 122-131
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 2025-01-09 13:25 CET 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:
