David W. Juedes

33 papers A* 3A 9B 4Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2021 J jnl
A generic framework for approximation analysis of greedy algorithms for star bicoloring.
Optim. Methods Softw.
David W. Juedes, Jeffrey Jones
2018 J jnl
Discovering Gene Regulatory Elements Using Coverage-Based Heuristics.
IEEE ACM Trans. Comput. Biol. Bioinform.
Rami Al-ouran, Robert Schmidt, Ashwini Naik, Jeffrey Jones, Frank Drews, David W. Juedes, Laura Elnitski, Lonnie R. Welch
2012 — conf
Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to Semesters.
IPDPS Workshops
David W. Juedes, Frank Drews
2007 J jnl
The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst.
Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond
2006 J jnl
Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions.
Real Time Syst.
David W. Juedes, Frank Drews, Dazhang Gu, Lonnie R. Welch, Klaus H. Ecker, Silke Schomann
2005 A conf
Integrated CORBA Scheduling and Resource Management for Distributed Real-Time Embedded Systems.
IEEE Real-Time and Embedded Technology and Applications Symposium
Kevin Bryan, Lisa Cingiser DiPippo, Victor Fay Wolfe, Matthew Murphy, Jiangyin Zhang, Douglas Niehaus, David Fleeman, David W. Juedes, Chang Liu, Lonnie R. Welch, Christopher D. Gill
2005 A conf
Stable Allocations in Distributed Real-Time Systems with Multiple Environmental Parameters and Replicable Applications.
IPDPS
Hang Zhao, Dazhang Gu, Lonnie R. Welch, Frank Drews, David W. Juedes
2005 J jnl
Tight lower bounds for certain parameterized NP-hard problems.
Inf. Comput.
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2004 B conf
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.
MFCS
Henning Fernau, David W. Juedes
2004 J jnl
Baire category and nowhere differentiability for feasible real functions.
Math. Log. Q.
Josef M. Breutzmann, David W. Juedes, Jack H. Lutz
2004 A conf
Heuristic Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time Systems.
IPDPS
David W. Juedes, Frank Drews, Lonnie R. Welch, David Fleeman
2004 B conf
Linear Kernels in Linear Time, or How to Save k Colors in O(n
WG
Benny Chor, Mike Fellows, David W. Juedes
2004 A conf
Quality-Based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service.
IPDPS
David Fleeman, Matthew Gillen, Andrew Lenharth, M. Delaney, Lonnie R. Welch, David W. Juedes, Chang Liu
2004 A conf
Tight Lower Bounds for Certain Parameterized NP-Hard Problems.
CCC
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2004 A conf
Utility-Function Based Resource Allocation for Adaptable Applications in Dynamic, Distributed Real-Time Systems.
IPDPS
Frank Drews, David W. Juedes, David Fleeman, Andreas Brüning, Klaus H. Ecker, Martin Hoefer, Lonnie R. Welch
2003 A conf
An Optimization Framework for Dynamic, Distributed Real-Time Systems.
IPDPS
Klaus H. Ecker, David W. Juedes, Lonnie R. Welch, David M. Chelberg, Carl Bruggeman, Frank Drews, David Fleeman, David Parrott, Barbara Pfarr
2003 J jnl
On the existence of subexponential parameterized algorithms.
J. Comput. Syst. Sci.
Liming Cai, David W. Juedes
2002 J jnl
The inapproximability of non-NP-hard optimization problems.
Theor. Comput. Sci.
Liming Cai, David W. Juedes, Iyad A. Kanj
2002 — conf
When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies.
CSEE&T
Joan Krone, David W. Juedes, Meera Sitharam
2001 B conf
Baire Category and Nowhere Differentiability for Feasible Real Functions.
ISAAC
Josef M. Breutzmann, David W. Juedes, Jack H. Lutz
2001 A* conf
Subexponential Parameterized Algorithms Collapse the W-Hierarchy.
ICALP
Liming Cai, David W. Juedes
2000 J jnl
Modeling Time-Bounded Prefix Kolmogorov Complexity.
Theory Comput. Syst.
David W. Juedes, Jack H. Lutz
1998 B conf
The Inapproximability of Non NP-hard Optimization Problems.
ISAAC
Liming Cai, David W. Juedes, Iyad A. Kanj
1996 J jnl
Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++.
ACM Trans. Math. Softw.
Andreas Griewank, David W. Juedes, Jean Utke
1996 J jnl
Completeness and Weak Completeness Under Polynomial-Size Circuits.
Inf. Comput.
David W. Juedes, Jack H. Lutz
1995 A conf
Completeness and Weak Completeness Under Polynomial-Size Circuits.
STACS
David W. Juedes, Jack H. Lutz
1995 J jnl
The Complexity and Distribution of Hard Problems.
SIAM J. Comput.
David W. Juedes, Jack H. Lutz
1995 J jnl
Weak Completeness in E and E_2.
Theor. Comput. Sci.
David W. Juedes, Jack H. Lutz
1995 J jnl
Weakly Complete Problems are not Rare.
Comput. Complex.
David W. Juedes
1994 J jnl
Computational Depth and Reducibility.
Theor. Comput. Sci.
David W. Juedes, James I. Lathrop, Jack H. Lutz
1993 A* conf
Computational Depth and Reducibility (Extended Abstract).
ICALP
David W. Juedes, James I. Lathrop, Jack H. Lutz
1993 A* conf
The Complexity and Distribution of Hard Problems (Extended Abstract)
FOCS
David W. Juedes, Jack H. Lutz
1991 A conf
Exploiting parallelism in automatic differentiation.
ICS
Christian H. Bischof, Andreas Griewank, David W. Juedes