Skip to: Main Content Search Navigation Secondary Navigation

David Juedes

Chair and Professor
Electrical Engineering and Computer Science, Center for Scientific Computing and Immersive Technologies
STKR 330
juedes@ohio.edu
Phone: 740.593.1566

http://oucsace.cs.ohiou.edu/~juedes/

Dr. David Juedes is a tenured associate professor and chair of the School of Electrical Engineering and Computer Science. Dr. Juedes teaches a range of computer science classes from introductory to advanced graduate-level courses. Dr. Juedes performs research in algorithms and complexity theory. He is a senior member of the Association for Computing Machinery.


Research Interests: Algorithms, Complexity Theory, Approximation Algorithms, Computational Biology, Numerical Algorithms and Software

All Degrees Earned: Ph.D., Computer Science, Iowa State University, 1996. M.S., Computer Science, Iowa State University, 1990. B.S., Computer Science and Mathematics, University of Wisconsin-La Crosse, 1988.

Publications:

See http://academic.research.microsoft.com/Author/1080231/david-w-juedes for and up to date list of Dr. Juedes' publications.

Awards:

Senior Member ACM 2010, Russ College Outstanding Research Paper Award 2004.

Journal Article, Academic Journal (16)

  • Juedes, D., Jones, J. Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring . 2. London: Optimization Methods and Software; 27: 295--309.
  • Juedes, D., Jones, J. Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring . London: Optimization Methods and Software.
  • Juedes, D., Cai, L., Fellows, M., Rosamond, F. The Complexity of Polynomial-Time Approximation . Theory of Computing Systems; 41: 459-477.
  • Juedes, D., Drews, F., Gu, D., Welch, L., Ecker, K., Schomann, S. Approximation Algorithm for Periodic Real-Time Tasks withWorkload -Dependant Running-. 3. Journal of Real-time Systems; 34: 173-194.
  • Juedes, D., Chen, J., Chor, B., Fellows, M., Huang, X., Kanj, I., Xia, G. Tight Lower Bounds for Certain Parameterized NP-hard Problems. Information and Computation; 201: 216-231.
  • Juedes, D., Breutzmann, J., Lutz, J. Baire category and nowhere differentiability for feasible real functions . 4/5. Mathematical Logic Quarterly; 50: 460-472.
  • Juedes, D., Cai, L. On the existence of subexponential parameterized algorithms . 4. Journal of Computer and System Sciences; 67: 789-807.
  • Juedes, D., Cai, L., Kanj, I. On the inapproximability of non NP-hard optimization problems. Theoretical Computer Science; 289: 553-571.
  • Juedes, D., Lutz, J. Modeling Time-bounded Prefix Kolmogorov Complexity. 33. Theory of Computing Systems ; 111-123.
  • Juedes, D., Bergman, C., Slutzki, G. Computational Complexity of Term-Equivalence. 1. International Journal of Algebra and Computation; 9: 113-128.
  • Juedes, D., Griewank, A., Utke, J. ADOL-C: A Package for the Automatic Differentiation of Algorithms Written in C/C++. 22. ACM Trans. Math. Software; 131-167.
  • Juedes, D., Lutz, J. Completeness and Weak Completeness under Polynomial-Size Circuits . 125. Information and Computation; 13-31.
  • Juedes, D., Lutz, J. The Complexity and Distribution of Hard Problems . 24. SIAM Journal on Computing; 279-295.
  • Juedes, D., Lutz, J. Weak Completeness in E and E2 . 143. Theoretical Computer Science; 149-158.
  • Juedes, D. Weakly Complete Problems are Not Rare. 5. Computational Complexity; 267-283.
  • Juedes, D., Lathrop, J., Lutz, J. Computational Depth and Reducibility . 132. Theoretical Computer Science; 37-70.

Magazine/Trade Publication (1)

  • Juedes, D. A Taxonomy of Automatic Differentiation Tools. Philadelphia, PA: Automatic Differentiation of Algorithms: Theory, Implementation, and Application, SIAM; 315-329.

Cited Research (1)

Conference Proceeding (34)

  • Juedes, D., Jones, J. An Extended Abstract: A Generic Framework for Approximation Analysis for Algorithms for Star Bicoloring. The 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization; 185--188.
  • Raffle, H., Smith, M., Young, V., Juedes, D. Developmental Evaluation of Multi-Level Mentoring Systems for Appalachian STEM Students. Albuquerque, NM: University of New Mexico; 7.
  • Young, V., Juedes, D., Raffle, H. The Appalachian Cohort for Engineering: An Evaluation of S-Stem Strategies for Success. Proceedings of the 2013 Frontiers in Education Conference; 233-236.
  • Juedes, D., Drews, F. Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to Semesters. 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW); 1279 - 1282.
  • Juedes, D. The Web-Based Grading Project: Further Experiences and Student Attitudes. Indianapolis, Indiana: Proceedings of the 35th ASEE/IEEE Frontiers in Education Conference, IEEE Press; F4E-18 - F4E-23.
  • Judd, R., Drews, F., Lawrence, D., Juedes, D., Leal, W., Deshpande, J., Welch, L. QoS-Based Resource Allocation in Dynamic Real-Time Systems. Portland, OR: Proceedings of the 2005 American Control Conference; 1745 – 1751.
  • Bryan, K., DiPippo, L., Fay-Wolfe, V., Murphy, M., Zhang, J., Fleeman, D., Juedes, D., Liu, C., Welch, L., Niehaus, D., Gill, C. Integrated CORBA Scheduling and Resource Management for Distributed Real-Time Embedded Systems. San Francisco, CA: Proceeding of 11th IEEE Real-Time and Embedded Technology and Applications Symosium (RTAS 2005), IEEE Computer Society Press; 374-384.
  • Juedes, D., Fernau, H. A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs . Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag; 3153: 488-499.
  • Juedes, D., Chor, B., Fellows, M. Linear Kernels in Linear Time, or How to Save k Colors in O(n2) steps . Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Springer-Verlag; 3353: 257-269.
  • Juedes, D., Chen, J., Chor, B., Fellows, M., Huang, X., Kanj, I., Xia, G. Tight Lower Bounds for Certain Parameterized NP-hard Problems. 19th Annual IEEE Conference on Computational Complexity, IEEE Computer Soceity Press; 150-160.
  • Welch, L., Fleeman, D., Juedes, D., Liu, C. Adaptive Resource Management Services in CORBA. The Object Management Group (OMG) Workshop on Distributed Object Computing for Real-time and Embedded Systems.
  • Bryan, K., DiPippo, L., Fay-Wolfe, V., Fleeman, D., Gill, C., Juedes, D., Liu, C., Murphy, M., Niehaus, D., Subramonian, V., Welch, L., Zhang, J. Towards Integrated CORBA Scheduling and Resource Management Services for Distributed Real-Time and Embedded Systems. Arlington, VA: 4th Annual Workshop on TAO and CIAO.
  • Aber, E., Drews, F., Gu, D., Juedes, D., Lenharth, A., Parrott, D., Welch, L., Zhao, H., Fleeman, D. Experimental Comparison of Heuristic and Optimal Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time Systems. WTR 2004 - 6th Brazilian Workshop on Real-Time Systems.
  • Juedes, D., Drews, F., Welch, L. Workload Functions: A New Paradigm for Real-Time Computing. In Proceedings of the RTAS Work-In-Progress Session.
  • Liu, C., Fleeman, D., Aber, E., Welch, L., Juedes, D. Model-Driven Resource Management for Distributed Real-Time and Embedded Systems. 2nd RTAS Workshop on Model-Driven Embedded Systems (MoDES '04.
  • Juedes, D., Drews, F., Welch, L., Fleeman, D. Heuristic Resource Allocation Algorithms for Maximizing Allowable Workload in Dynamic, Distributed Real-Time Systems. 12th International Workshop on Parallel and Distributed Real-time Systems, IEEE Computer Society Press.
  • Fleeman, D., Gillen, M., Lenharth, A., Delaney, M., Welch, L., Juedes, D., Liu, C. Quality-based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service, IEEE Press. 12th International Workshop on Parallel and Distributed Real-time Systems, IEEE Computer Society Press.
  • Drews, F., Welch, L., Juedes, D., Fleeman, D., Bruening, A., Ecker, K., Hoefer, M. Utility-Function based Resource Allocation for Adaptable Applications in Dynamic Distributed Real-Time Systems. 12th International Workshop on Parallel and Distributed Real-time Systems, IEEE Computer Society Press.
  • Fleeman, D., Gillen, M., Lenharth, A., Delaney, M., Welch, L., Juedes, D., Liu, C. Quality-based Adaptive Resource Management Architecture (QARMA): A CORBA Resource Management Service. Santa Fe, New Mexico: Workshop on Parallel and Distributed Real-Time Systems 2004 (WPDRTS04).
  • Juedes, D. Experiences in Web-based Grading. Boulder, Colorado: Proceedings of the 33rd ASEE/IEEE Frontiers in Education Conference, IEEE Press, 2003; S3F-27 - S37-32.
  • Liu, C., Welch, L., Juedes, D. The Resource Area Network Architectural Pattern. Urbana, IL: 10th Conference on Pattern Languages of Programs.
  • Ecker, K., Drews, F., Juedes, D., Welch, L., Chelberg, D., Fleeman, D., Parrott, D. An Optimization Framework for Dynamic, Distributed Real-Time Systems. Nice, France: 11th International Workshop on Parallel and Distributed Real-Time Systems.
  • Juedes, D., Krone, J., Sitharam, M. Theory meets practice: Enriching the CS curriculum through industrial case studies . Covington, Kentucky: Proceedings of the 15th Conference on Software Engineering Education and Training, (CSEE&T 2002), IEEE Computer Society Press ; 207-214.
  • Juedes, D., Breutzmann, J., Lutz, J. Baire category and nowhere differentiability for feasible real functions . Christchurch, New Zealand: Proceedings of the Twelveth International Symposium on Algorithms and Computation, Springer-Verlag; 219-230.
  • Juedes, D., Cai, L. Subexponential Parameterized Algorithms Collapse the W-hierarchy . Crete, Greece: Proceedings of the Twenty Eighth International Colloquium on Automata, Languages, and Programming, Springer-Verlag; 273-284.
  • Juedes, D., Cai, L., Liakhovitch, E. Evolutionary Computation Techniques for Multiple Sequence Alignment . San Diego, CA: Proceedings of the 2000 Congress on Evolutionary Computation, IEEE Press; 829-835.
  • Juedes, D., Krone, J., Sitharam, M. Bridging the gap between theory and practice by promoting a partnership between industry and academia . San Juan, Puerto Rico: Proceedings of the 29th ASEE/IEEE Frontiers in Education Conference, IEEE Press; 13c5-19.
  • Juedes, D., Cai, L., Kanj, I. On the inapproximability of non NP-hard optimization problems. 1533. Taejon, Korea: Proceeding of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC ’98), Spring-Verlag; 437-446.
  • Juedes, D., Lutz, J. Time-bounded Prefix Kolmogorov Complexity. Proceedings of the 36th Annual Allerton Conference on Communication, Control, and Computing, University of Illinois Press; 703-712.
  • Juedes, D., Balakrishnan, K. Generalized Neural Networks, Computational Differentiation, and Evolution . Proceedings of the Second International SIAM Workshop on Computational Differentiation, SIAM; 273-286.
  • Juedes, D., Lutz, J. Completeness and Weak Completeness Under Polynomial-Size Circuits . Munich, Germany: Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, Springer-Verlag ; 26-37.
  • Juedes, D., Lutz, J. The Complexity and Distribution of Hard Problems . Palo Alto, CA: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, IEEE Press ; 177-185.
  • Juedes, D., Lathrop, J., Lutz, J. Computational Depth and Reducibility . Lund, Sweden: Proceedings of the Twentieth International Colloquium on Automata, Languages, and Programming, Springer-Verlag; 277-288.
  • Juedes, D., Bischof, C., Griewank, A. Exploiting Parallelism in Automatic Differentiation . Baltimore, MD: Proceedings of the 1991 International, ACM Press; : 146-153.

Journal Article, Public or Trade Journal (1)

  • Juedes, D., Lutz, J. Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness . Kolmogorov Complexity and Computational Complexity, Springer-Verlag; 43-65.