David W. Juedes - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2021

A generic framework for approximation analysis of greedy algorithms for star bicoloringDavid W. Juedes, Jeffrey Jones. oms, 36(4):869-890, 2021. [doi]

2018

Discovering Gene Regulatory Elements Using Coverage-Based HeuristicsRami Al-ouran, Robert Schmidt, Ashwini Naik, Jeffrey Jones, Frank Drews, David W. Juedes, Laura Elnitski, Lonnie R. Welch. tcbb, 15(4):1290-1300, 2018. [doi]

2012

Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to SemestersDavid W. Juedes, Frank Drews. ipps 2012: 1279-1282 [doi]

2007

The Complexity of Polynomial-Time ApproximationLiming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond. mst, 41(3):459-477, 2007. [doi]

2006

Approximation algorithm for periodic real-time tasks with workload-dependent running-time functionsDavid W. Juedes, Frank Drews, Dazhang Gu, Lonnie R. Welch, Klaus H. Ecker, Silke Schomann. rts, 34(3):173-194, 2006. [doi]

2005

2004

Baire category and nowhere differentiability for feasible real functionsJosef M. Breutzmann, David W. Juedes, Jack H. Lutz. mlq, 50(4-5):460-472, 2004. [doi]

Tight Lower Bounds for Certain Parameterized NP-Hard ProblemsJianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia. cocoon 2004: 150-160 [doi]

Linear Kernels in Linear Time, or How to Save k Colors in O(n:::2:::) StepsBenny Chor, Mike Fellows, David W. Juedes. criwg 2004: 257-269 [doi]

Utility-Function Based Resource Allocation for Adaptable Applications in Dynamic, Distributed Real-Time SystemsFrank Drews, David W. Juedes, David Fleeman, Andreas Brüning, Klaus H. Ecker, Martin Hoefer, Lonnie R. Welch. ipps 2004: [doi]

A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar GraphsHenning Fernau, David W. Juedes. mfcs 2004: 488-499 [doi]

Quality-Based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management ServiceDavid Fleeman, Matthew Gillen, Andrew Lenharth, M. Delaney, Lonnie R. Welch, David W. Juedes, Chang Liu. ipps 2004: [doi]

Heuristic Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time SystemsDavid W. Juedes, Frank Drews, Lonnie R. Welch, David Fleeman. ipps 2004: [doi]

2003

On the existence of subexponential parameterized algorithmsLiming Cai, David W. Juedes. jcss, 67(4):789-807, 2003. [doi]

An Optimization Framework for Dynamic, Distributed Real-Time SystemsKlaus H. Ecker, David W. Juedes, Lonnie R. Welch, David M. Chelberg, Carl Bruggeman, Frank Drews, David Fleeman, David Parrott, Barbara Pfarr. ipps 2003: 111 [doi]

2002

The inapproximability of non-NP-hard optimization problemsLiming Cai, David W. Juedes, Iyad A. Kanj. TCS, 289(1):553-571, 2002.

When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case StudiesJoan Krone, David W. Juedes, Meera Sitharam. csee 2002: 207-214 [doi]

2001

Baire Category and Nowhere Differentiability for Feasible Real FunctionsJosef M. Breutzmann, David W. Juedes, Jack H. Lutz. isaac 2001: 219-230 [doi]

Subexponential Parameterized Algorithms Collapse the W-HierarchyLiming Cai, David W. Juedes. icalp 2001: 273-284 [doi]

2000

Modeling Time-Bounded Prefix Kolmogorov ComplexityDavid W. Juedes, Jack H. Lutz. mst, 33(2):111-123, 2000. [doi]

1998

The Inapproximability of Non NP-hard Optimization ProblemsLiming Cai, David W. Juedes, Iyad A. Kanj. isaac 1998: 437-446 [doi]

1996

Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++Andreas Griewank, David W. Juedes, Jean Utke. TOMS, 22(2):131-167, 1996. [doi]

Completeness and Weak Completeness Under Polynomial-Size CircuitsDavid W. Juedes, Jack H. Lutz. iandc, 125(1):13-31, 1996.

1995

Weakly Complete Problems are not RareDavid W. Juedes. cc, 5(3/4):267-283, 1995.

Completeness and Weak Completeness Under Polynomial-Size CircuitsDavid W. Juedes, Jack H. Lutz. STACS 1995: 26-37

Weak Completeness in E and E_2David W. Juedes, Jack H. Lutz. TCS, 143(1):149-158, 1995. [doi]

The Complexity and Distribution of Hard ProblemsDavid W. Juedes, Jack H. Lutz. SICOMP, 24(2):279-295, 1995.

1994

Computational Depth and ReducibilityDavid W. Juedes, James I. Lathrop, Jack H. Lutz. TCS, 132(2):37-70, 1994.

1993

The Complexity and Distribution of Hard Problems (Extended Abstract)David W. Juedes, Jack H. Lutz. focs 1993: 177-185

Computational Depth and Reducibility (Extended Abstract)David W. Juedes, James I. Lathrop, Jack H. Lutz. icalp 1993: 277-288

1991

Exploiting parallelism in automatic differentiationChristian H. Bischof, Andreas Griewank, David W. Juedes. ics 1991: 146-153 [doi]

Sign in or sign up to see more results.

runs on WebDSL