default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter J. Downey
Person information
- affiliation: University of Arizona, Tucson, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j14]Young-Kyoon Suh, Richard T. Snodgrass, John D. Kececioglu, Peter J. Downey, Robert S. Maier
, Cheng Yi:
EMP: execution time measurement protocol for compute-bound programs. Softw. Pract. Exp. 47(4): 559-597 (2017)
2000 – 2009
- 2002
- [j13]Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler:
Packing rectangles in a strip. Acta Informatica 38(10): 673-693 (2002)
1990 – 1999
- 1995
- [j12]Peter J. Downey:
Bounds and Approximations for Overheads in the Time to Join Parallel Forks. INFORMS J. Comput. 7(2): 125-139 (1995) - 1991
- [j11]Peter J. Downey:
Bounding Synchronization Overhead for Parallel Iteration. INFORMS J. Comput. 3(4): 288-298 (1991)
1980 – 1989
- 1986
- [j10]John L. Bruno, Peter J. Downey:
Probabilistic Bounds on the Performance of List Scheduling. SIAM J. Comput. 15(2): 409-417 (1986) - 1985
- [j9]John L. Bruno, Peter J. Downey:
Probabilistic Bounds for Dual Bin-Packing. Acta Informatica 22(3): 333-345 (1985) - 1982
- [c6]Gregory R. Andrews, David P. Dobkin, Peter J. Downey:
Distributed Allocation with Pools of Servers. PODC 1982: 73-83 - 1981
- [j8]John L. Bruno, Peter J. Downey, Greg N. Frederickson:
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. J. ACM 28(1): 100-113 (1981) - [j7]Peter J. Downey, Benton L. Leong, Ravi Sethi:
Computing Sequences with Addition Chains. SIAM J. Comput. 10(3): 638-646 (1981) - [j6]Amnon Barak, Peter J. Downey:
Distributed Processor Scheduling and User Countermeasures. SIAM J. Comput. 10(4): 809-819 (1981) - [c5]Gautam Barua, John L. Bruno, Peter J. Downey:
Performance Analysis of a Distributed File Cache. Berkeley Workshop 1981: 240 - [c4]Gregory R. Andrews, David P. Dobkin, Peter J. Downey:
Active Data Structures. ICSE 1981: 354-362 - 1980
- [j5]Peter J. Downey, Ravi Sethi, Robert Endre Tarjan:
Variations on the Common Subexpression Problem. J. ACM 27(4): 758-771 (1980)
1970 – 1979
- 1978
- [j4]Peter J. Downey, Ravi Sethi:
Assignment Commands with Array References. J. ACM 25(4): 652-666 (1978) - [j3]John L. Bruno, Peter J. Downey:
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. SIAM J. Comput. 7(4): 393-404 (1978) - [c3]Peter J. Downey, Hanan Samet, Ravi Sethi:
Off-Line and On-Line Algorithms for Deducing Equalities. POPL 1978: 158-170 - 1977
- [j2]Eva-Maria Mückstein Wotschke, Detlef Wotschke, Peter J. Downey:
Size, Index, and Context-Sensitivity of Controlled Partition Grammars. Math. Syst. Theory 11: 47-60 (1977) - 1976
- [j1]Peter J. Downey, Ravi Sethi:
Correct Computation Rules for Recursive Languages. SIAM J. Comput. 5(3): 378-401 (1976) - [c2]Peter J. Downey, Ravi Sethi:
Assignment Commands and Array Structures. FOCS 1976: 57-66 - 1975
- [c1]Peter J. Downey, Ravi Sethi:
Correct Computation Rules for Recursive Languages (Extended Abstract). FOCS 1975: 48-56 - 1974
- [b1]Peter J. Downey:
Formal languages and recursion schemes. Harvard University, TR 16-74, 1974
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:17 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:
