David W. Juedes

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A generic framework for approximation analysis of greedy algorithms for star bicoloring Optimization Methods & Software	2022-06-27	Paper
Computational depth and reducibility Automata, Languages and Programming	2019-03-29	Paper
Completeness and weak completeness under polynomial-size circuits STACS 95	2017-12-04	Paper
Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring Optimization Methods & Software	2012-05-23	Paper
The complexity of polynomial-time approximation Theory of Computing Systems	2007-12-19	Paper
Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions Real-Time Systems	2006-11-17	Paper
Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science	2005-12-08	Paper
Tight lower bounds for certain parameterized NP-hard problems Information and Computation	2005-10-10	Paper
Mathematical Foundations of Computer Science 2004 Lecture Notes in Computer Science	2005-08-22	Paper
Baire category and nowhere differentiability for feasible real functions Mathematical Logic Quarterly	2005-02-16	Paper
On the existence of subexponential parameterized algorithms Journal of Computer and System Sciences	2004-08-19	Paper
scientific article; zbMATH DE number 2080993 (Why is no real title available?)	2004-08-04	Paper
The inapproximability of non-NP-hard optimization problems. Theoretical Computer Science	2003-01-21	Paper
scientific article; zbMATH DE number 1754598 (Why is no real title available?)	2002-06-12	Paper
Modeling time-bounded prefix Kolmogorov complexity Theory of Computing Systems	2000-05-07	Paper
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE International Journal of Algebra and Computation	2000-01-20	Paper
Algorithm 755: ADOL-C ACM Transactions on Mathematical Software	1998-03-12	Paper
scientific article; zbMATH DE number 992830 (Why is no real title available?)	1997-10-01	Paper
Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) Theoretical Computer Science	1997-02-28	Paper
Completeness and weak completeness under polynomial-size circuits Information and Computation	1997-01-02	Paper
Weakly complete problems are not rare Computational Complexity	1996-11-04	Paper
The Complexity and Distribution of Hard Problems SIAM Journal on Computing	1995-12-13	Paper
Computational depth and reducibility Theoretical Computer Science	1994-09-25	Paper
scientific article; zbMATH DE number 140039 (Why is no real title available?)	1993-03-28	Paper

Research outcomes over time

This page was built for person: David W. Juedes