David W. Juedes

Available identifiers

zbMath Open juedes.david-wMaRDI QIDQ673643

List of research outcomes

Publication	Date of Publication	Type
A generic framework for approximation analysis of greedy algorithms for star bicoloring	2022-06-27	Paper
Computational depth and reducibility	2019-03-29	Paper
Completeness and weak completeness under polynomial-size circuits	2017-12-04	Paper
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring	2012-05-23	Paper
The complexity of polynomial-time approximation	2007-12-19	Paper
Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions	2006-11-17	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
Tight lower bounds for certain parameterized NP-hard problems	2005-10-10	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Baire category and nowhere differentiability for feasible real functions	2005-02-16	Paper
On the existence of subexponential parameterized algorithms	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4474091	2004-08-04	Paper
The inapproximability of non-NP-hard optimization problems.	2003-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q4535023	2002-06-12	Paper
Modeling time-bounded prefix Kolmogorov complexity	2000-05-07	Paper
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE	2000-01-20	Paper
Algorithm 755: ADOL-C	1998-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q3125562	1997-10-01	Paper
Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)	1997-02-28	Paper
Completeness and weak completeness under polynomial-size circuits	1997-01-02	Paper
Weakly complete problems are not rare	1996-11-04	Paper
The Complexity and Distribution of Hard Problems	1995-12-13	Paper
Computational depth and reducibility	1994-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q4028413	1993-03-28	Paper

Research outcomes over time

This page was built for person: David W. Juedes