default search action
Paul Young
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j36]Paul Young, Nima Ebadi
, Arun Das
Can Hierarchical Transformers Learn Facial Geometry? Sensors 23(2): 929 (2023) - 2022
- [j35]Santhilata Kuppili Venkata
Alexa, Is This a Historical Record? ACM Journal on Computing and Cultural Heritage 15(1): 7:1-7:20 (2022) - 2021
- [c32]Santhilata Kuppili Venkata, Paul Young, Alex Green:
Text File Format Identification: An Application of AI for the Curation of Digital Records. iPRES 2021 - 2020
- [c31]William Simm, Gordon S. Blair
Models in the Cloud: Exploring Next Generation Environmental Software Systems. ISESS 2020: 216-227
2010 – 2019
- 2019
- [j34]Jonathan Ebner
Intelligent self-designing production control strategy: Dynamic allocation hybrid pull-type mechanism applicable to closed-loop supply chains. Comput. Ind. Eng. 135: 1127-1144 (2019) - 2018
- [c30]Anna Rotondo, John Geraghty
Generalization of EF-based Assignment Strategies for Cycle Time Optimization at Complex wet Stations. WSC 2018: 3660-3671 - [i1]Nikhil Kotecha, Paul Young:
Generating Music using an LSTM Network. CoRR abs/1804.07300 (2018) - 2017
- [c29]Paul Young, Probha Madhavan, Gong-Do Hwang:
Power and Performance Study of HPC Applications on QCT Developer Cloud. CSCloud 2017: 1-5 - [c28]Prabha Madhavan, Paul Young, Stephen Chang:
Performance of Scientific Simulations on QCT Developer Cloud: A Case Study of Molecular Dynamic and Quantum Chemistry Simulations. CSCloud 2017: 18-21 - 2016
- [j33]James P. Downey
An Eight-year Study of the Influence of IT Career Camps on Altering Perceptions of IT Majors and Careers. Commun. Assoc. Inf. Syst. 38: 1 (2016) - 2015
- [j32]Anna Rotondo, Paul Young
Sequencing optimisation for makespan improvement at wet-etch tools. Comput. Oper. Res. 53: 261-274 (2015) - [c27]Oladipupo Olaitan, Paul Young, John Geraghty:
Variable intensity RCPSP approach to a case study flow shop. SummerSim 2015: 47:1-47:9 - 2013
- [j31]Anna Rotondo, Paul Young
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. 209(1): 255-277 (2013) - [c26]Anna Rotondo, John Geraghty
Quality risk analysis at sampling stations crossed by one monitored product and an unmonitored flow. WSC 2013: 3672-3683 - 2012
- [c25]Paul Young, V. Yip, R. B. Lenin:
Evaluation of issue-tracker's effectiveness for measuring individual performance on group projects. ACM Southeast Regional Conference 2012: 89-94 - [c24]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 - [c23]Anna Rotondo, John Geraghty
Using simulation and hybrid sequencing optimization for makespan reduction at a wet tool. WSC 2012: 193:1-193:13 - 2011
- [c22]Ahmed Rubaai, Paul Young:
Hardware/software implementation of PI/PD-like fuzzy controller for high performance motor drives. IAS 2011: 1-7 - 2010
- [j30]Arijit Bhattacharya
Special issue on optimisation methods & applications in decision-making processes. Appl. Soft Comput. 10(4): 959-962 (2010) - [j29]Arijit Bhattacharya
Supplier selection paradigm: An integrated hierarchical QFD methodology under multiple-criteria environment. Appl. Soft Comput. 10(4): 1013-1027 (2010) - [c21]Ahmed Rubaai, Paul Young:
DSP-Based Fuzzy Neural Network PI/PD-Like Fuzzy Controller for Motion Controls and Drives. IAS 2010: 1-8
2000 – 2009
- 2009
- [c20]Arijit Bhattacharya
On the Analytical Framework of Resilient Supply-Chain Network Assessing Excursion Events. Asia International Conference on Modelling and Simulation 2009: 392-397 - [c19]Leonardo Gualano, Paul Young
A Modular Distributed Decision Support System with Data Mining Capabilities. HAIS 2009: 211-218 - 2008
- [c18]Stephen Murray, John Geraghty
Time-Limited Next Arrival heuristic for batch processing and setup reduction in a re-entrant environment. WSC 2008: 2109-2117 - 2006
- [c17]Candace Childers, Don Brutzman, Curtis L. Blais, Paul Young:
A Case Study in Applying Semantic Web Technologies to the XML-Based Tactical Assessment Markup Language (TAML). AAAI Fall Symposium: Semantic Web for Collaborative Knowledge Acquisition 2006: 9-16 - 2004
- [c16]Amr Arisha, Paul Young:
Intelligent Simulation-Based Lot Scheduling of Photolithography Toolsets in a Wafer Fabrication Facility. WSC 2004: 1935-1942 - 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
1990 – 1999
- 1994
- [c13]Deborah Joseph, Randall Pruim, Paul Young:
Collapsing Degrees in Subexponential Time. SCT 1994: 367-382 - 1993
- [j28]Judy Goldsmith
Using Self-Reducibilities to Characterize Polynomial Time. Inf. Comput. 104(2): 288-308 (1993) - [j27]Judy Goldsmith
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 - 1992
- [j26]Paul Young:
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions. SIGACT News 23(3): 107-117 (1992) - [j25]Paul Young:
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer: Part II restricted polynomial-time reductions. SIGACT News 23(4): 83-94 (1992) - 1991
- [j24]Judy Goldsmith, Lane A. Hemachandra
Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) - [j23]Lane A. Hemachandra
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)
1980 – 1989
- 1989
- [j20]David Gries
The 1988 Snowbird Report: A Discipline Matures. Commun. ACM 32(3): 294-297, 318 (1989) - [j19]David Gries
1988 Snowbird Report: A Discipline Matures. 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. Bull. EATCS 36: 66-84 (1988) - [c9]Paul Young:
Juris Hartmanis: fundamental contributions to isomorphism problems. SCT 1988: 138-154 - [c8]Luc Longpré, Paul Young:
Cook is faster than Karp: a study of reducibilities in NP. SCT 1988: 293-302 - 1987
- [c7]Judy Goldsmith, Deborah Joseph, Paul Young:
Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT 1987: 50-59 - 1986
- [j17]David Gries
Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding. Commun. ACM 29(9): 870-878 (1986) - [j16]David Gries
Imbalance Between Growth and Funding in Academic Computing Science: Two Trends Colliding. 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]Martin Davis, Carl Smith, Paul Young:
Introduction. Inf. Control. 52(1): 1 (1982) - [j11]Martin Davis, Carl Smith, Paul Young:
Introduction. Inf. Control. 54(1/2): 1 (1982) - [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
1970 – 1979
- 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]Paul Young:
Optimization Among Provably Equivalent Programs. J. ACM 24(4): 693-700 (1977) - 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. Math. Syst. 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 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. Math. Syst. Theory 5(1): 66-70 (1971) - [j1]Paul Young:
Speed-Ups by Changing the Order in which Sets are Enumerated. Math. Syst. Theory 5(2): 148-156 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-07 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: