2007 | ||
---|---|---|
30 | EE | Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond: The Complexity of Polynomial-Time Approximation. Theory Comput. Syst. 41(3): 459-477 (2007) |
2006 | ||
29 | EE | David W. Juedes, Frank Drews, Dazhang Gu, Lonnie R. Welch, Klaus H. Ecker, Silke Schomann: Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions. Real-Time Systems 34(3): 173-194 (2006) |
2005 | ||
28 | EE | 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: Integrated CORBA Scheduling and Resource Management for Distributed Real-Time Embedded Systems. IEEE Real-Time and Embedded Technology and Applications Symposium 2005: 375-384 |
27 | EE | Hang Zhao, Dazhang Gu, Lonnie R. Welch, Frank Drews, David W. Juedes: Stable Allocations in Distributed Real-Time Systems with Multiple Environmental Parameters and Replicable Applications. IPDPS 2005 |
26 | EE | Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight lower bounds for certain parameterized NP-hard problems. Inf. Comput. 201(2): 216-231 (2005) |
2004 | ||
25 | EE | Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia: Tight Lower Bounds for Certain Parameterized NP-Hard Problems. IEEE Conference on Computational Complexity 2004: 150-160 |
24 | EE | David W. Juedes, Frank Drews, Lonnie R. Welch, David Fleeman: Heuristic Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time Systems. IPDPS 2004 |
23 | EE | David Fleeman, Matthew Gillen, Andrew Lenharth, M. Delaney, Lonnie R. Welch, David W. Juedes, Chang Liu: Quality-Based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service. IPDPS 2004 |
22 | EE | Frank Drews, David W. Juedes, David Fleeman, Andreas Brüning, Klaus H. Ecker, Martin Hoefer, Lonnie R. Welch: Utility-Function Based Resource Allocation for Adaptable Applications in Dynamic, Distributed Real-Time Systems. IPDPS 2004 |
21 | EE | Henning Fernau, David W. Juedes: A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS 2004: 488-499 |
20 | EE | Benny Chor, Mike Fellows, David W. Juedes: Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. WG 2004: 257-269 |
19 | EE | Josef M. Breutzmann, David W. Juedes, Jack H. Lutz: Baire category and nowhere differentiability for feasible real functions. Math. Log. Q. 50(4-5): 460-472 (2004) |
2003 | ||
18 | EE | Klaus H. Ecker, David W. Juedes, Lonnie R. Welch, David M. Chelberg, Carl Bruggeman, Frank Drews, David Fleeman, David Parrott, Barbara Pfarr: An Optimization Framework for Dynamic, Distributed Real-Time Systems. IPDPS 2003: 111 |
17 | EE | Liming Cai, David W. Juedes: On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 67(4): 789-807 (2003) |
2002 | ||
16 | EE | Joan Krone, David W. Juedes, Meera Sitharam: When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies. CSEE&T 2002: 207-214 |
15 | Liming Cai, David W. Juedes, Iyad A. Kanj: The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002) | |
2001 | ||
14 | EE | Liming Cai, David W. Juedes: Subexponential Parameterized Algorithms Collapse the W-Hierarchy. ICALP 2001: 273-284 |
13 | EE | Josef M. Breutzmann, David W. Juedes, Jack H. Lutz: Baire Category and Nowhere Differentiability for Feasible Real Functions. ISAAC 2001: 219-230 |
2000 | ||
12 | EE | David W. Juedes, Jack H. Lutz: Modeling Time-Bounded Prefix Kolmogorov Complexity. Theory Comput. Syst. 33(2): 111-123 (2000) |
1998 | ||
11 | EE | Liming Cai, David W. Juedes, Iyad A. Kanj: The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446 |
1996 | ||
10 | EE | Andreas Griewank, David W. Juedes, Jean Utke: Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++. ACM Trans. Math. Softw. 22(2): 131-167 (1996) |
9 | David W. Juedes, Jack H. Lutz: Completeness and Weak Completeness Under Polynomial-Size Circuits. Inf. Comput. 125(1): 13-31 (1996) | |
1995 | ||
8 | David W. Juedes, Jack H. Lutz: Completeness and Weak Completeness Under Polynomial-Size Circuits. STACS 1995: 26-37 | |
7 | David W. Juedes: Weakly Complete Problems are not Rare. Computational Complexity 5(3/4): 267-283 (1995) | |
6 | David W. Juedes, Jack H. Lutz: The Complexity and Distribution of Hard Problems. SIAM J. Comput. 24(2): 279-295 (1995) | |
5 | EE | David W. Juedes, Jack H. Lutz: Weak Completeness in E and E_2. Theor. Comput. Sci. 143(1): 149-158 (1995) |
1994 | ||
4 | David W. Juedes, James I. Lathrop, Jack H. Lutz: Computational Depth and Reducibility. Theor. Comput. Sci. 132(2): 37-70 (1994) | |
1993 | ||
3 | David W. Juedes, Jack H. Lutz: The Complexity and Distribution of Hard Problems (Extended Abstract) FOCS 1993: 177-185 | |
2 | David W. Juedes, James I. Lathrop, Jack H. Lutz: Computational Depth and Reducibility (Extended Abstract). ICALP 1993: 277-288 | |
1991 | ||
1 | EE | Christian H. Bischof, Andreas Griewank, David W. Juedes: Exploiting parallelism in automatic differentiation. ICS 1991: 146-153 |