Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid W. Juedes
Person information
- affiliation: Ohio University, Athens, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j18]David W. Juedes
, Jeffrey Jones:
A generic framework for approximation analysis of greedy algorithms for star bicoloring. Optim. Methods Softw. 36(4): 869-890 (2021)- 2020
- [j17]Yichao Li, Yating Liu, David Juedes, Frank Drews, Razvan C. Bunescu, Lonnie R. Welch:
Set cover-based methods for motif selection. Bioinform. 36(4): 1044-1051 (2020) - 2018
- [j16]Rami Al-ouran, Robert Schmidt, Ashwini Naik, Jeffrey Jones, Frank Drews, David W. Juedes, Laura Elnitski, Lonnie R. Welch:
Discovering Gene Regulatory Elements Using Coverage-Based Heuristics. IEEE ACM Trans. Comput. Biol. Bioinform. 15(4): 1290-1300 (2018) - 2012
- [j15]David Juedes, Jeffrey Jones:
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring. Optim. Methods Softw. 27(2): 295-309 (2012) - 2007
- [j14]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
- [j13]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 Syst. 34(3): 173-194 (2006) - 2005
- [j12]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
- [j11]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
- [j10]Liming Cai, David W. Juedes:
On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 67(4): 789-807 (2003) - 2002
- [j9]Liming Cai, David W. Juedes, Iyad A. Kanj:
The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002) - 2000
- [j8]David W. Juedes, Jack H. Lutz:
Modeling Time-Bounded Prefix Kolmogorov Complexity. Theory Comput. Syst. 33(2): 111-123 (2000) - 1999
- [j7]Clifford Bergman, David Juedes, Giora Slutzki:
Computational Complexity of Term-Equivalence. Int. J. Algebra Comput. 9(1): 113-128 (1999) - 1996
- [j6]David W. Juedes, Jack H. Lutz:
Completeness and Weak Completeness Under Polynomial-Size Circuits. Inf. Comput. 125(1): 13-31 (1996) - [j5]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) - 1995
- [j4]David W. Juedes:
Weakly Complete Problems are not Rare. Comput. Complex. 5(3/4): 267-283 (1995) - [j3]David W. Juedes, Jack H. Lutz:
The Complexity and Distribution of Hard Problems. SIAM J. Comput. 24(2): 279-295 (1995) - [j2]David W. Juedes, Jack H. Lutz:
Weak Completeness in E and E_2. Theor. Comput. Sci. 143(1): 149-158 (1995) - 1994
- [j1]David W. Juedes, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility. Theor. Comput. Sci. 132(2): 37-70 (1994)
Conference and Workshop Papers
- 2023
- [c25]Garret Cunningham, Harsha Chenji, David Juedes, Gordon Stewart, Avinash Karanth:
DAGGER: Exploiting Language Semantics for Program Security in Embedded Systems. ISQED 2023: 1-7 - [c24]Chad Mourning, Harsha Chenji, Allyson Hallman-Thrasher, Savas Kaya, Nasseef Abukamail, David Juedes, Avinash Karanth:
Reflections of Cybersecurity Workshop for K-12 Teachers. SIGCSE (1) 2023: 987-993 - 2022
- [c23]Chad Mourning, David Juedes, Allyson Hallman-Thrasher, Harsha Chenji, Savas Kaya, Avinash Karanth:
Reflections of Cybersecurity Workshop for K-12 Teachers and High School Students. SIGCSE (2) 2022: 1127 - 2016
- [c22]Cindy Marling, David Juedes:
CS0 for Computer Science Majors at Ohio University. SIGCSE 2016: 138-143 - 2013
- [c21]Valerie Young, David Juedes, Holly Raffle:
The Appalachian Cohort for Engineering: An evaluation of S-STEM strategies for success. FIE 2013: 233-235 - 2012
- [c20]David W. Juedes, Frank Drews:
Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to Semesters. IPDPS Workshops 2012: 1279-1282 - 2005
- [c19]Robert Judd, F. Drews, Douglas Lawrence, David Juedes, B. Leal, J. Deshpande, Lonnie R. Welch:
QoS-based resource allocation in dynamic real-time systems. ACC 2005: 1745-1751 - [c18]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 - [c17]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 - 2004
- [c16]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. CCC 2004: 150-160 - [c15]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 - [c14]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 - [c13]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 - [c12]Henning Fernau, David W. Juedes:
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs. MFCS 2004: 488-499 - [c11]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 - 2003
- [c10]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 - 2002
- [c9]Joan Krone, David W. Juedes, Meera Sitharam:
When Theory Meets Practice: Enriching the CS Curriculum through Industrial Case Studies. CSEE&T 2002: 207-214 - 2001
- [c8]Liming Cai, David W. Juedes:
Subexponential Parameterized Algorithms Collapse the W-Hierarchy. ICALP 2001: 273-284 - [c7]Josef M. Breutzmann, David W. Juedes, Jack H. Lutz:
Baire Category and Nowhere Differentiability for Feasible Real Functions. ISAAC 2001: 219-230 - 2000
- [c6]Liming Cai, David Juedes, Evgueni Liakhovitch:
Evolutionary computation techniques for multiple sequence alignment. CEC 2000: 829-835 - 1998
- [c5]Liming Cai, David W. Juedes, Iyad A. Kanj:
The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446 - 1995
- [c4]David W. Juedes, Jack H. Lutz:
Completeness and Weak Completeness Under Polynomial-Size Circuits. STACS 1995: 26-37 - 1993
- [c3]David W. Juedes, Jack H. Lutz:
The Complexity and Distribution of Hard Problems (Extended Abstract). FOCS 1993: 177-185 - [c2]David W. Juedes, James I. Lathrop, Jack H. Lutz:
Computational Depth and Reducibility (Extended Abstract). ICALP 1993: 277-288 - 1991
- [c1]Christian H. Bischof, Andreas Griewank, David W. Juedes:
Exploiting parallelism in automatic differentiation. ICS 1991: 146-153
Informal and Other Publications
- 2023
- [i2]Garett Cunningham, Razvan C. Bunescu, David Juedes:
Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs. CoRR abs/2301.02195 (2023) - 2015
- [i1]David Juedes, Jeffrey Jones:
A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring. CTW 2015: 185-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
