The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul Young: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment. [Citation Graph (, )][DBLP]


  41. On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events. [Citation Graph (, )][DBLP]


  42. A Modular Distributed Decision Support System with Data Mining Capabilities. [Citation Graph (, )][DBLP]


  43. Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment. [Citation Graph (, )][DBLP]


  44. Special issue on optimisation methods & applications in decision-making processes. [Citation Graph (, )][DBLP]


Search in 0.051secs, Finished in 0.055secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002