David W. Juedes

Orcid: 0000-0002-1656-5781

Affiliations:
  • Ohio University, Athens, OH, USA


According to our database1, David W. Juedes authored at least 41 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs.
CoRR, 2023

Reflections of Cybersecurity Workshop for K-12 Teachers.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

DAGGER: Exploiting Language Semantics for Program Security in Embedded Systems.
Proceedings of the 24th International Symposium on Quality Electronic Design, 2023

2022
Reflections of Cybersecurity Workshop for K-12 Teachers and High School Students.
Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

2021
A generic framework for approximation analysis of greedy algorithms for star bicoloring.
Optim. Methods Softw., 2021

2020
Set cover-based methods for motif selection.
Bioinform., 2020

2018
Discovering Gene Regulatory Elements Using Coverage-Based Heuristics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

2016
CS0 for Computer Science Majors at Ohio University.
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

2015
A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013
The Appalachian Cohort for Engineering: An evaluation of S-STEM strategies for success.
Proceedings of the IEEE Frontiers in Education Conference, 2013

2012
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring.
Optim. Methods Softw., 2012

Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to Semesters.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2007
The Complexity of Polynomial-Time Approximation.
Theory Comput. Syst., 2007

2006
Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions.
Real Time Syst., 2006

2005
Tight lower bounds for certain parameterized NP-hard problems.
Inf. Comput., 2005

Integrated CORBA Scheduling and Resource Management for Distributed Real-Time Embedded Systems.
Proceedings of the 11th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2005), 2005

Stable Allocations in Distributed Real-Time Systems with Multiple Environmental Parameters and Replicable Applications.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

QoS-based resource allocation in dynamic real-time systems.
Proceedings of the American Control Conference, 2005

2004
Baire category and nowhere differentiability for feasible real functions.
Math. Log. Q., 2004

Linear Kernels in Linear Time, or How to Save k Colors in O(n<sup>2</sup>) Steps.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Heuristic Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time Systems.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Quality-Based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Utility-Function Based Resource Allocation for Adaptable Applications in Dynamic, Distributed Real-Time Systems.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
On the existence of subexponential parameterized algorithms.
J. Comput. Syst. Sci., 2003

An Optimization Framework for Dynamic, Distributed Real-Time Systems.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
The inapproximability of non-NP-hard optimization problems.
Theor. Comput. Sci., 2002

When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies.
Proceedings of the 15th Conference on Software Engineering Education and Training (CSEET'02), 2002

2001
Subexponential Parameterized Algorithms Collapse the W-Hierarchy.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Modeling Time-Bounded Prefix Kolmogorov Complexity.
Theory Comput. Syst., 2000

Evolutionary computation techniques for multiple sequence alignment.
Proceedings of the 2000 Congress on Evolutionary Computation, 2000

1999
Computational Complexity of Term-Equivalence.
Int. J. Algebra Comput., 1999

1996
Algorithm 755: ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++.
ACM Trans. Math. Softw., 1996

Completeness and Weak Completeness Under Polynomial-Size Circuits.
Inf. Comput., 1996

1995
Weak Completeness in E and E_2.
Theor. Comput. Sci., 1995

The Complexity and Distribution of Hard Problems.
SIAM J. Comput., 1995

Weakly Complete Problems are not Rare.
Comput. Complex., 1995

1994
Computational Depth and Reducibility.
Theor. Comput. Sci., 1994

1993
Computational Depth and Reducibility (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

The Complexity and Distribution of Hard Problems (Extended Abstract)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991
Exploiting parallelism in automatic differentiation.
Proceedings of the 5th international conference on Supercomputing, 1991


  Loading...