default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul E. Wright
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j18]Peter C. Fishburn, Paul E. Wright:
Interference Patterns in Regular Graphs with Bijective Colorings. SIAM J. Discret. Math. 15(3): 382-402 (2002)- 2000
- [j17]Peter C. Fishburn, Paul E. Wright:
Interference patterns in bijective colorings of 2-regular graphs. Discret. Appl. Math. 102(3): 189-204 (2000)
1990 – 1999
- 1998
- [j16]Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright:
Interference-Minimizing Colorings of Regular Graphs. SIAM J. Discret. Math. 11(1): 15-40 (1998) - [j15]Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright:
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM J. Optim. 9(1): 112-147 (1998) - 1997
- [j14]Mira Bernstein, Neil J. A. Sloane, Paul E. Wright:
On sublattices of the hexagonal lattice. Discret. Math. 170(1-3): 29-39 (1997) - [j13]Peter C. Fishburn, Paul E. Wright:
Bandwidth edge counts for linear arrangements of rectangular grids. J. Graph Theory 26(4): 195-202 (1997) - [j12]Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu:
Exact reliabilities of most reliable double-loop networks. Networks 30(2): 81-90 (1997) - [c4]Nabil Kahalé
, Paul E. Wright:
Dynamic Global Packet Routing in Wireless Networks. INFOCOM 1997: 1414-1421 - 1996
- [j11]Frank K. Hwang, Paul E. Wright:
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs. Oper. Res. Lett. 19(4): 171-174 (1996) - 1995
- [j10]Frank K. Hwang, Paul E. Wright:
Survival Reliability of Some Double-Loop Networks and Chordal Rings. IEEE Trans. Computers 44(12): 1468-1471 (1995) - [c3]Albert G. Greenberg, Boris D. Lubachevsky, David M. Nicol, Paul E. Wright:
Efficient Massively Parallel Simulation of Dynamic Channel Assignment Schemes for Wireless Cellular Communications. MASCOTS 1995: 45-47 - 1994
- [j9]Edward G. Coffman Jr., Anatolii A. Puhalskii, Martin I. Reiman, Paul E. Wright:
Processor-Shared Buffers with Reneging. Perform. Evaluation 19(1): 25-46 (1994) - [j8]Isi Mitrani, Paul E. Wright:
Routing in the Presence of Breakdowns. Perform. Evaluation 20(1-3): 151-164 (1994) - [j7]Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen, Paul E. Wright:
The Processor Minimization Problem with Independent Waiting-Time Constraints. Theor. Comput. Sci. 125(1): 3-16 (1994) - [j6]François Baccelli, William A. Massey, Paul E. Wright:
Determining the Exit Time Distribution for a Closed Cyclic Network. Theor. Comput. Sci. 125(1): 149-165 (1994) - [c2]Albert G. Greenberg, Boris D. Lubachevsky, David M. Nicol, Paul E. Wright:
Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications. PADS 1994: 187-197 - 1993
- [j5]Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
Stochastic Machine Minimization with Constant Service Times. Math. Oper. Res. 18(2): 300-316 (1993) - [j4]Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints. SIAM J. Comput. 22(2): 332-348 (1993) - [j3]Edward G. Coffman Jr., Leopold Flatto, Paul E. Wright:
A Stochastic Checkpoint Optimization Problem. SIAM J. Comput. 22(3): 650-659 (1993) - 1991
- [j2]Albert G. Greenberg, Paul E. Wright:
Design and Analysis of Master/Slave Multiprocessors. IEEE Trans. Computers 40(8): 963-976 (1991) - [c1]Martin I. Reiman, Paul E. Wright:
Performance Analysis of Concurrent-Read Exclusive-Write. SIGMETRICS 1991: 168-177
1980 – 1989
- 1989
- [j1]Paul E. Wright:
Statistical complexity of the power method for markov chains. J. Complex. 5(2): 119-143 (1989)
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-10-07 22:21 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:
