| 2008 |
|---|
| 40 | EE | Stephen Murray,
John Geraghty,
Paul Young,
Steve Sievwright:
Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment.
Winter Simulation Conference 2008: 2109-2117 |
| 2004 |
|---|
| 39 | EE | Amr Arisha,
Paul Young:
Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility.
Winter Simulation Conference 2004: 1935- |
| 2003 |
|---|
| 38 | EE | Paul Young,
Nabendu Chaki,
Valdis Berzins,
Luqi:
Evaluation of Middleware Architectures in Achieving System Interoperability.
IEEE International Workshop on Rapid System Prototyping 2003: 108-116 |
| 2002 |
|---|
| 37 | EE | Paul Young,
Valdis Berzins,
Jun Ge,
Luqi:
Using an object oriented model for resolving representational differences between heterogeneous systems.
SAC 2002: 976-983 |
| 1994 |
|---|
| 36 | | Deborah Joseph,
Randall Pruim,
Paul Young:
Collapsing Degrees in Subexponential Time.
Structure in Complexity Theory Conference 1994: 367-382 |
| 1993 |
|---|
| 35 | | Giovanni Faglia,
Paul Young:
In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition.
Kurt Gödel Colloquium 1993: 187-189 |
| 34 | | Judy Goldsmith,
Deborah Joseph,
Paul Young:
Using Self-Reducibilities to Characterize Polynomial Time
Inf. Comput. 104(2): 288-308 (1993) |
| 33 | | Judy Goldsmith,
Deborah Joseph,
Paul Young:
A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.
J. Comput. Syst. Sci. 46(3): 349-362 (1993) |
| 1991 |
|---|
| 32 | | Judy Goldsmith,
Lane A. Hemachandra,
Deborah Joseph,
Paul Young:
Near-Testable Sets.
SIAM J. Comput. 20(3): 506-523 (1991) |
| 31 | | Lane A. Hemachandra,
Albrecht Hoene,
Dirk Siefkes,
Paul Young:
On Sets Polynomially Enumerable by Iteration.
Theor. Comput. Sci. 80(2): 203-225 (1991) |
| 1990 |
|---|
| 30 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
Strong Separations for the Boolean Hierarchy over RP.
Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) |
| 29 | | Luc Longpré,
Paul Young:
Cook Reducibility is Faster than Karp Reduciblity in NP.
J. Comput. Syst. Sci. 41(3): 389-401 (1990) |
| 1989 |
|---|
| 28 | | Alberto Bertoni,
Danilo Bruschi,
Deborah Joseph,
Meera Sitharam,
Paul Young:
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
FCT 1989: 35-46 |
| 27 | | Danilo Bruschi,
Deborah Joseph,
Paul Young:
A Structural Overview of NP Optimization Problems.
Optimal Algorithms 1989: 205-231 |
| 26 | | David Gries,
Terry Walker,
Paul Young:
The 1988 Snowbird Report: A Discipline Matures.
Commun. ACM 32(3): 294-297 (1989) |
| 25 | | David Gries,
Terry Walker,
Paul Young:
1988 Snowbird Report: A Discipline Matures.
IEEE Computer 22(2): 72-75 (1989) |
| 1988 |
|---|
| 24 | | Deborah Joseph,
Paul Young:
The Structural Complexity Column, guest authors.
Bulletin of the EATCS 36: 66-84 (1988) |
| 1986 |
|---|
| 23 | | David Gries,
Raymond E. Miller,
Robert W. Ritchie,
Paul Young:
Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding.
Commun. ACM 29(9): 870-878 (1986) |
| 22 | | David Gries,
Raymond E. Miller,
Robert W. Ritchie,
Paul Young:
Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding.
IEEE Computer 19(9): 70-76 (1986) |
| 1985 |
|---|
| 21 | | Stephen R. Mahaney,
Paul Young:
Reductions Among Polynomial Isomorphism Types.
Theor. Comput. Sci. 39: 207-224 (1985) |
| 20 | | Deborah Joseph,
Paul Young:
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.
Theor. Comput. Sci. 39: 225-237 (1985) |
| 1983 |
|---|
| 19 | | Paul Young:
Some Structural Properties of Polynomial Reducibilities and Sets in NP
STOC 1983: 392-401 |
| 18 | | William J. Collins,
Paul Young:
Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers.
J. Symb. Log. 48(4): 913-920 (1983) |
| 1982 |
|---|
| 17 | | Martin Davis,
Carl Smith,
Paul Young:
Introduction
Information and Control 52(1): 1 (1982) |
| 16 | | Martin Davis,
Carl Smith,
Paul Young:
Introduction
Information and Control 54(1/2): 1 (1982) |
| 15 | | Deborah Joseph,
Paul Young:
Corrigendum: Independence Results in Computer Science?
J. Comput. Syst. Sci. 24(3): 378 (1982) |
| 1981 |
|---|
| 14 | | Deborah Joseph,
Paul Young:
A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic.
MFCS 1981: 46-60 |
| 13 | | Deborah Joseph,
Paul Young:
Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)
STOC 1981: 55-61 |
| 12 | | Michael Machtey,
Paul Young:
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems.
J. Comput. Syst. Sci. 22(3): 442-453 (1981) |
| 11 | | Deborah Joseph,
Paul Young:
Independence Results in Computer Science?
J. Comput. Syst. Sci. 23(2): 205-222 (1981) |
| 1980 |
|---|
| 10 | | Deborah Joseph,
Paul Young:
Independence Results in Computer Science? (Preliminary Version)
STOC 1980: 58-69 |
| 1978 |
|---|
| 9 | | Michael Machtey,
Karl Winklmann,
Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties.
SIAM J. Comput. 7(1): 39-60 (1978) |
| 1977 |
|---|
| 8 | EE | Paul Young:
Optimization Among Provably Equivalent Programs.
J. ACM 24(4): 693-700 (1977) |
| 1976 |
|---|
| 7 | | Michael Machtey,
Paul Young:
Simple Gödel Numberings, Translations, and the P-Hierarchy
STOC 1976: 236-243 |
| 1974 |
|---|
| 6 | | Paul Young:
Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated.
Mathematical Systems Theory 7(4): 352 (1974) |
| 1973 |
|---|
| 5 | | Paul Young:
Optimization among Provably Equivalent Programs (Preliminary Abstract)
FOCS 1973: 197-199 |
| 4 | EE | Leonard J. Bass,
Paul Young:
Ordinal Hierarchies and Naming Complexity Classes.
J. ACM 20(4): 668-686 (1973) |
| 1971 |
|---|
| 3 | | John Helm,
Paul Young:
On Size vs. Efficiency for Programs Admitting Speed-Ups.
J. Symb. Log. 36(1): 21-27 (1971) |
| 2 | | Paul Young:
A Note on Dense and Nondense Families of Complexity Classes.
Mathematical Systems Theory 5(1): 66-70 (1971) |
| 1 | | Paul Young:
Speed-Ups by Changing the Order in which Sets are Enumerated.
Mathematical Systems Theory 5(2): 148-156 (1971) |
