- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c22 |      | Joseph H. Eto, Janine Nelson-Hoffman, Eric Parker, Clark Bernier, Paul Young, Dave Sheehan, John Kueck, Brendan J. Kirby: The Demand Response Spinning Reserve Demonstration-Measuring the Speed and Magnitude of Aggregated Demand Response. HICSS 2012: 2012-2019 |
| c21 | | Anna Rotondo, John Geraghty, Paul Young: Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool. Winter Simulation Conference 2012: 193 |
| 2010 | ||
| j28 | | Arijit Bhattacharya, Sani Susanto, John Geraghty, Paul Young: Special issue on optimisation methods & applications in decision-making processes. Appl. Soft Comput. 10(4): 959-962 (2010) |
| j27 | | Arijit Bhattacharya, John Geraghty, Paul Young: Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment. Appl. Soft Comput. 10(4): 1013-1027 (2010) |
| c20 | | Ahmed Rubaai, Paul Young: DSP-Based Fuzzy Neural Network PI/PD-Like Fuzzy Controller for Motion Controls and Drives. IAS 2010: 1-8 |
| 2009 | ||
| c19 | | Arijit Bhattacharya, John Geraghty, Paul Young: On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events. Asia International Conference on Modelling and Simulation 2009: 392-397 |
| c18 | | Leonardo Gualano, Paul Young: A Modular Distributed Decision Support System with Data Mining Capabilities. HAIS 2009: 211-218 |
| 2008 | ||
| c17 | | 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 | ||
| c16 | | Amr Arisha, Paul Young: Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility. Winter Simulation Conference 2004: 1935- |
| 2003 | ||
| c15 | | 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 | ||
| c14 | | Paul Young, Valdis Berzins, Jun Ge, Luqi: Using an object oriented model for resolving representational differences between heterogeneous systems. SAC 2002: 976-983 |
| 1994 | ||
| c13 | | Deborah Joseph, Randall Pruim, Paul Young: Collapsing Degrees in Subexponential Time. Structure in Complexity Theory Conference 1994: 367-382 |
| 1993 | ||
| j26 | | Judy Goldsmith, Deborah Joseph, Paul Young: Using Self-Reducibilities to Characterize Polynomial Time. Inf. Comput. 104(2): 288-308 (1993) |
| j25 | | 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) |
| c12 | | Giovanni Faglia, Paul Young: In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition. Kurt Gödel Colloquium 1993: 187-189 |
| 1991 | ||
| j24 | | Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young: Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) |
| j23 | | Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young: On Sets Polynomially Enumerable by Iteration. Theor. Comput. Sci. 80(2): 203-225 (1991) |
| 1990 | ||
| j22 | | Danilo Bruschi, Deborah Joseph, Paul Young: Strong Separations for the Boolean Hierarchy over RP. Int. J. Found. Comput. Sci. 1(3): 201-218 (1990) |
| j21 | | Luc Longpré, Paul Young: Cook Reducibility is Faster than Karp Reduciblity in NP. J. Comput. Syst. Sci. 41(3): 389-401 (1990) |
| 1989 | ||
| j20 | | David Gries, Terry Walker, Paul Young: The 1988 Snowbird Report: A Discipline Matures. Commun. ACM 32(3): 294-297, 318 (1989) |
| j19 | | David Gries, Terry Walker, Paul Young: 1988 Snowbird Report: A Discipline Matures. IEEE Computer 22(2): 72-75 (1989) |
| c11 |  | Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young: Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). FCT 1989: 35-46 |
| c10 | | Danilo Bruschi, Deborah Joseph, Paul Young: A Structural Overview of NP Optimization Problems. Optimal Algorithms 1989: 205-231 |
| 1988 | ||
| j18 | | Deborah Joseph, Paul Young: The Structural Complexity Column, guest authors. Bulletin of the EATCS 36: 66-84 (1988) |
| c9 | | Paul Young: Juris Hartmanis: fundamental contributions to isomorphism problems. Structure in Complexity Theory Conference 1988: 138-154 |
| c8 | | Luc Longpré, Paul Young: Cook is faster than Karp: a study of reducibilities in NP. Structure in Complexity Theory Conference 1988: 293-302 |
| 1987 | ||
| c7 | | Judy Goldsmith, Deborah Joseph, Paul Young: Near-testable, P-cheatable, and P-terse sets. Structure in Complexity Theory Conference 1987 |
| 1986 | ||
| j17 | | 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) |
| j16 | | 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 | ||
| j15 | | Stephen R. Mahaney, Paul Young: Reductions Among Polynomial Isomorphism Types. Theor. Comput. Sci. 39: 207-224 (1985) |
| j14 | | Deborah Joseph, Paul Young: Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. Theor. Comput. Sci. 39: 225-237 (1985) |
| 1983 | ||
| j13 | | William J. Collins, Paul Young: Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. J. Symb. Log. 48(4): 913-920 (1983) |
| c6 | | Paul Young: Some Structural Properties of Polynomial Reducibilities and Sets in NP. STOC 1983: 392-401 |
| 1982 | ||
| j12 | | |
| j11 | | |
| j10 | | Deborah Joseph, Paul Young: Corrigendum: Independence Results in Computer Science? J. Comput. Syst. Sci. 24(3): 378 (1982) |
| 1981 | ||
| j9 | | Michael Machtey, Paul Young: Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. J. Comput. Syst. Sci. 22(3): 442-453 (1981) |
| j8 | | Deborah Joseph, Paul Young: Independence Results in Computer Science? J. Comput. Syst. Sci. 23(2): 205-222 (1981) |
| c5 | | Deborah Joseph, Paul Young: A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic. MFCS 1981: 46-60 |
| c4 | | Deborah Joseph, Paul Young: Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract). STOC 1981: 55-61 |
| 1980 | ||
| c3 | | Deborah Joseph, Paul Young: Independence Results in Computer Science? (Preliminary Version). STOC 1980: 58-69 |
| 1978 | ||
| j7 | | Michael Machtey, Karl Winklmann, Paul Young: Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. 7(1): 39-60 (1978) |
| 1977 | ||
| j6 | | |
| 1976 | ||
| c2 | | Michael Machtey, Paul Young: Simple Gödel Numberings, Translations, and the P-Hierarchy. STOC 1976: 236-243 |
| 1974 | ||
| j5 | | Paul Young: Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated. Mathematical Systems Theory 7(4): 352 (1974) |
| 1973 | ||
| j4 | | Leonard J. Bass, Paul Young: Ordinal Hierarchies and Naming Complexity Classes. J. ACM 20(4): 668-686 (1973) |
| c1 | | Paul Young: Optimization among Provably Equivalent Programs (Preliminary Abstract). SWAT (FOCS) 1973: 197-199 |
| 1971 | ||
| j3 | | John Helm, Paul Young: On Size vs. Efficiency for Programs Admitting Speed-Ups. J. Symb. Log. 36(1): 21-27 (1971) |
| j2 | | Paul Young: A Note on Dense and Nondense Families of Complexity Classes. Mathematical Systems Theory 5(1): 66-70 (1971) |
| j1 | | Paul Young: Speed-Ups by Changing the Order in which Sets are Enumerated. Mathematical Systems Theory 5(2): 148-156 (1971) |
Colors in the list of coauthors
Last update Sat May 25 12:44:17 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page