Paul Young

According to our database, Paul Young authored at least 66 papers between 1971 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Can Hierarchical Transformers Learn Facial Geometry?

Paul Young, Nima Ebadi, Arun Das, Mazal Bethany, Kevin Desai, Peyman Najafirad

Sensors, January, 2023

2022

Alexa, Is This a Historical Record?

Santhilata Kuppili Venkata, Paul Young, Mark Bell, Alex Green

ACM Journal on Computing and Cultural Heritage, 2022

2021

Text File Format Identification: An Application of AI for the Curation of Digital Records.

Santhilata Kuppili Venkata, Paul Young, Alex Green

Proceedings of the 17th International Conference on Digital Preservation, 2021

2020

Models in the Cloud: Exploring Next Generation Environmental Software Systems.

William Simm, Gordon S. Blair, Richard Bassett, Faiza Samreen, Paul Young

Proceedings of the Environmental Software Systems. Data Science in Action, 2020

2019

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

Jonathan Ebner, Paul Young, John Geraghty

Comput. Ind. Eng., 2019

2018

Generating Music using an LSTM Network.

Nikhil Kotecha, Paul Young

CoRR, 2018

Generalization of EF-based Assignment Strategies for Cycle Time Optimization at Complex wet Stations.

Anna Rotondo, John Geraghty, Paul Young

Proceedings of the 2018 Winter Simulation Conference, 2018

2017

Power and Performance Study of HPC Applications on QCT Developer Cloud.

Paul Young, Probha Madhavan, Gong-Do Hwang

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.

Prabha Madhavan, Paul Young, Stephen Chang

Proceedings of the 4th IEEE International Conference on Cyber Security and Cloud Computing, 2017

2016

An Eight-year Study of the Influence of IT Career Camps on Altering Perceptions of IT Majors and Careers.

James P. Downey, Summer E. Bartczak, Paul Young, Ellen England

Commun. Assoc. Inf. Syst., 2016

2015

Sequencing optimisation for makespan improvement at wet-etch tools.

Anna Rotondo, Paul Young, John Geraghty

Comput. Oper. Res., 2015

Variable intensity RCPSP approach to a case study flow shop.

Oladipupo Olaitan, Paul Young, John Geraghty

Proceedings of the Conference on Summer Computer Simulation, 2015

2013

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.

Anna Rotondo, Paul Young, John Geraghty

Ann. Oper. Res., 2013

Quality risk analysis at sampling stations crossed by one monitored product and an unmonitored flow.

Anna Rotondo, John Geraghty, Paul Young

Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013

2012

Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool.

Anna Rotondo, John Geraghty, Paul Young

Proceedings of the Winter Simulation Conference, 2012

The Demand Response Spinning Reserve Demonstration-Measuring the Speed and Magnitude of Aggregated Demand Response.

Joseph H. Eto, Janine Nelson-Hoffman, Eric Parker, Clark Bernier, Paul Young, Dave Sheehan, John Kueck, Brendan J. Kirby

Proceedings of the 45th Hawaii International International Conference on Systems Science (HICSS-45 2012), 2012

Evaluation of issue-tracker's effectiveness for measuring individual performance on group projects.

Paul Young, V. Yip, R. B. Lenin

Proceedings of the 50th Annual Southeast Regional Conference, 2012

2011

Hardware/software implementation of PI/PD-like fuzzy controller for high performance motor drives.

Ahmed Rubaai, Paul Young

Proceedings of the 2011 IEEE Industry Applications Society Annual Meeting, 2011

2010

Special issue on optimisation methods & applications in decision-making processes.

Arijit Bhattacharya, Sani Susanto, John Geraghty, Paul Young

Appl. Soft Comput., 2010

Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment.

Arijit Bhattacharya, John Geraghty, Paul Young

Appl. Soft Comput., 2010

DSP-Based Fuzzy Neural Network PI/PD-Like Fuzzy Controller for Motion Controls and Drives.

Ahmed Rubaai, Paul Young

Proceedings of the Annual Meeting of the IEEE Industry Applications Society, 2010

2009

A Modular Distributed Decision Support System with Data Mining Capabilities.

Leonardo Gualano, Paul Young

Proceedings of the Hybrid Artificial Intelligence Systems, 4th International Conference, 2009

On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events.

Arijit Bhattacharya, John Geraghty, Paul Young

Proceedings of the Third Asia International Conference on Modelling & Simulation, 2009

2008

Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment.

Stephen Murray, John Geraghty, Paul Young, Steve Sievwright

Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008

2006

A Case Study in Applying Semantic Web Technologies to the XML-Based Tactical Assessment Markup Language (TAML).

Candace Childers, Don Brutzman, Curtis L. Blais, Paul Young

Proceedings of the Semantic Web for Collaborative Knowledge Acquisition, 2006

2004

Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility.

Amr Arisha, Paul Young

Proceedings of the 36th conference on Winter simulation, 2004

2003

Evaluation of Middleware Architectures in Achieving System Interoperability.

Paul Young, Nabendu Chaki, Valdis Berzins, Luqi

Proceedings of the 14th IEEE International Workshop on Rapid System Prototyping (RSP 2003), 2003

2002

Using an object oriented model for resolving representational differences between heterogeneous systems.

Paul Young, Valdis Berzins, Jun Ge, Luqi

Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

1994

Collapsing Degrees in Subexponential Time.

Deborah Joseph, Randall Pruim, Paul Young

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Using Self-Reducibilities to Characterize Polynomial Time

Judy Goldsmith, Deborah Joseph, Paul Young

Inf. Comput., June, 1993

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.

Judy Goldsmith, Deborah Joseph, Paul Young

J. Comput. Syst. Sci., 1993

In The Meaning Of Essentially Unprovable Theorems In The Presburger Theory Of Addition.

Giovanni Faglia, Paul Young

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992

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

Paul Young

SIGACT News, 1992

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

Paul Young

SIGACT News, 1992

1991

On Sets Polynomially Enumerable by Iteration.

Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes, Paul Young

Theor. Comput. Sci., 1991

Near-Testable Sets.

Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young

SIAM J. Comput., 1991

1990

Cook Reducibility is Faster than Karp Reduciblity in NP.

Luc Longpré, Paul Young

J. Comput. Syst. Sci., 1990

Strong Separations for the Boolean Hierarchy over RP.

Danilo Bruschi, Deborah Joseph, Paul Young

Int. J. Found. Comput. Sci., 1990

1989

The 1988 Snowbird Report: A Discipline Matures.

David Gries, Terry Walker, Paul Young

Commun. ACM, 1989

A Structural Overview of NP Optimization Problems.

Danilo Bruschi, Deborah Joseph, Paul Young

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract).

Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young

Proceedings of the Fundamentals of Computation Theory, 1989

1988

The Structural Complexity Column, guest authors.

Deborah Joseph, Paul Young

Bull. EATCS, 1988

Juris Hartmanis: fundamental contributions to isomorphism problems.

Paul Young

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

Cook is faster than Karp: a study of reducibilities in NP.

Luc Longpré, Paul Young

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1987

Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set.

Judy Goldsmith, Deborah Joseph, Paul Young

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

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

David Gries, Raymond E. Miller, Robert W. Ritchie, Paul Young

Commun. ACM, 1986

1985

Reductions Among Polynomial Isomorphism Types.

Stephen R. Mahaney, Paul Young

Theor. Comput. Sci., 1985

Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP.

Deborah Joseph, Paul Young

Theor. Comput. Sci., 1985

1983

Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers.

William J. Collins, Paul Young

J. Symb. Log., 1983

Some Structural Properties of Polynomial Reducibilities and Sets in NP

Paul Young

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

Introduction

Martin Davis, Carl Smith, Paul Young

Inf. Control., January, 1982

Corrigendum: Independence Results in Computer Science?

Deborah Joseph, Paul Young

J. Comput. Syst. Sci., 1982

1981

Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems.

Michael Machtey, Paul Young

J. Comput. Syst. Sci., 1981

Independence Results in Computer Science?

Deborah Joseph, Paul Young

J. Comput. Syst. Sci., 1981

Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (Preliminary Abstract)

Deborah Joseph, Paul Young

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.

Deborah Joseph, Paul Young

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Independence Results in Computer Science? (Preliminary Version)

Deborah Joseph, Paul Young

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978

Simple Gödel Numberings, Isomorphisms, and Programming Properties.

Michael Machtey, Karl Winklmann, Paul Young

SIAM J. Comput., 1978

1977

Optimization Among Provably Equivalent Programs.

Paul Young

J. ACM, 1977

1976

Simple Gödel Numberings, Translations, and the P-Hierarchy

Michael Machtey, Paul Young

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1974

Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated.

Paul Young

Math. Syst. Theory, 1974

1973

Ordinal Hierarchies and Naming Complexity Classes.

Leonard J. Bass, Paul Young

J. ACM, 1973

Optimization among Provably Equivalent Programs (Preliminary Abstract)

Paul Young

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1971

Speed-Ups by Changing the Order in which Sets are Enumerated.

Paul Young

Math. Syst. Theory, 1971

A Note on Dense and Nondense Families of Complexity Classes.

Paul Young

Math. Syst. Theory, 1971

On Size vs. Efficiency for Programs Admitting Speed-Ups.

John Helm, Paul Young

J. Symb. Log., 1971