Paul Young

Orcid: 0000-0002-0580-4345

According to our database1, Paul Young authored at least 65 papers between 1971 and 2023.

Collaborative distances:


ACM Fellow

ACM Fellow 1995, "For fundamental contributions to the theory of the complexity of algorithms and for a career of exceptional service to the computing research and education community.".



In proceedings 
PhD thesis 




Can Hierarchical Transformers Learn Facial Geometry?
Sensors, January, 2023

Alexa, Is This a Historical Record?
ACM Journal on Computing and Cultural Heritage, 2022

Text File Format Identification: An Application of AI for the Curation of Digital Records.
Proceedings of the 17th International Conference on Digital Preservation, 2021

Models in the Cloud: Exploring Next Generation Environmental Software Systems.
Proceedings of the Environmental Software Systems. Data Science in Action, 2020

Intelligent self-designing production control strategy: Dynamic allocation hybrid pull-type mechanism applicable to closed-loop supply chains.
Comput. Ind. Eng., 2019

Generating Music using an LSTM Network.
CoRR, 2018

Generalization of EF-based Assignment Strategies for Cycle Time Optimization at Complex wet Stations.
Proceedings of the 2018 Winter Simulation Conference, 2018

Power and Performance Study of HPC Applications on QCT Developer Cloud.
Proceedings of the 4th IEEE International Conference on Cyber Security and Cloud Computing, 2017

Performance of Scientific Simulations on QCT Developer Cloud: A Case Study of Molecular Dynamic and Quantum Chemistry Simulations.
Proceedings of the 4th IEEE International Conference on Cyber Security and Cloud Computing, 2017

An Eight-year Study of the Influence of IT Career Camps on Altering Perceptions of IT Majors and Careers.
Commun. Assoc. Inf. Syst., 2016

Sequencing optimisation for makespan improvement at wet-etch tools.
Comput. Oper. Res., 2015

Variable intensity RCPSP approach to a case study flow shop.
Proceedings of the Conference on Summer Computer Simulation, 2015

Quality risk prediction at a non-sampling station machine in a multi-product, multi-stage, parallel processing manufacturing system subjected to sequence disorder and multiple stream effects.
Ann. Oper. Res., 2013

Quality risk analysis at sampling stations crossed by one monitored product and an unmonitored flow.
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool.
Proceedings of the Winter Simulation Conference, 2012

The Demand Response Spinning Reserve Demonstration-Measuring the Speed and Magnitude of Aggregated Demand Response.
Proceedings of the 45th Hawaii International International Conference on Systems Science (HICSS-45 2012), 2012

Hardware/software implementation of PI/PD-like fuzzy controller for high performance motor drives.
Proceedings of the 2011 IEEE Industry Applications Society Annual Meeting, 2011

Special issue on optimisation methods & applications in decision-making processes.
Appl. Soft Comput., 2010

Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment.
Appl. Soft Comput., 2010

DSP-Based Fuzzy Neural Network PI/PD-Like Fuzzy Controller for Motion Controls and Drives.
Proceedings of the Annual Meeting of the IEEE Industry Applications Society, 2010

A Modular Distributed Decision Support System with Data Mining Capabilities.
Proceedings of the Hybrid Artificial Intelligence Systems, 4th International Conference, 2009

On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events.
Proceedings of the Third Asia International Conference on Modelling & Simulation, 2009

Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment.
Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

A Case Study in Applying Semantic Web Technologies to the XML-Based Tactical Assessment Markup Language (TAML).
Proceedings of the Semantic Web for Collaborative Knowledge Acquisition, 2006

Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility.
Proceedings of the 36th conference on Winter simulation, 2004

Evaluation of Middleware Architectures in Achieving System Interoperability.
Proceedings of the 14th IEEE International Workshop on Rapid System Prototyping (RSP 2003), 2003

Using an object oriented model for resolving representational differences between heterogeneous systems.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

Collapsing Degrees in Subexponential Time.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

Using Self-Reducibilities to Characterize Polynomial Time
Inf. Comput., June, 1993

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.
J. Comput. Syst. Sci., 1993

In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions.
SIGACT News, 1992

How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions.
SIGACT News, 1992

On Sets Polynomially Enumerable by Iteration.
Theor. Comput. Sci., 1991

Near-Testable Sets.
SIAM J. Comput., 1991

Cook Reducibility is Faster than Karp Reduciblity in NP.
J. Comput. Syst. Sci., 1990

Strong Separations for the Boolean Hierarchy over RP.
Int. J. Found. Comput. Sci., 1990

1988 Snowbird Report: A Discipline Matures.
Computer, 1989

A Structural Overview of NP Optimization Problems.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989

The Structural Complexity Column, guest authors.
Bull. EATCS, 1988

Juris Hartmanis: fundamental contributions to isomorphism problems.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

Cook is faster than Karp: a study of reducibilities in NP.
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding.
Computer, 1986

Reductions Among Polynomial Isomorphism Types.
Theor. Comput. Sci., 1985

Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.
Theor. Comput. Sci., 1985

Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers.
J. Symb. Log., 1983

Some Structural Properties of Polynomial Reducibilities and Sets in NP
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Corrigendum: Independence Results in Computer Science?
J. Comput. Syst. Sci., 1982

Inf. Control., 1982

Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems.
J. Comput. Syst. Sci., 1981

Independence Results in Computer Science?
J. Comput. Syst. Sci., 1981

Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

A Survey of Some Recent Results on Computational Complexity in Weak Theories of Arithmetic.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Independence Results in Computer Science? (Preliminary Version)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Simple Gödel Numberings, Isomorphisms, and Programming Properties.
SIAM J. Comput., 1978

Optimization Among Provably Equivalent Programs.
J. ACM, 1977

Simple Gödel Numberings, Translations, and the P-Hierarchy
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated.
Math. Syst. Theory, 1974

Ordinal Hierarchies and Naming Complexity Classes.
J. ACM, 1973

Optimization among Provably Equivalent Programs (Preliminary Abstract)
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

Speed-Ups by Changing the Order in which Sets are Enumerated.
Math. Syst. Theory, 1971

A Note on Dense and Nondense Families of Complexity Classes.
Math. Syst. Theory, 1971

On Size vs. Efficiency for Programs Admitting Speed-Ups.
J. Symb. Log., 1971