David Juedes

1.9k total citations
40 papers, 988 citations indexed

About

David Juedes is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, David Juedes has authored 40 papers receiving a total of 988 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 11 papers in Computer Networks and Communications. Recurrent topics in David Juedes's work include semigroups and automata theory (10 papers), Complexity and Algorithms in Graphs (10 papers) and Computability, Logic, AI Algorithms (8 papers). David Juedes is often cited by papers focused on semigroups and automata theory (10 papers), Complexity and Algorithms in Graphs (10 papers) and Computability, Logic, AI Algorithms (8 papers). David Juedes collaborates with scholars based in United States, Australia and Germany. David Juedes's co-authors include Andreas Griewank, Jean Utke, Jack H. Lutz, Liming Cai, Michael R. Fellows, Iyad Kanj, Xiuzhen Huang, Benny Chor, Ge Xia and Cindy Marling and has published in prestigious journals such as Bioinformatics, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

David Juedes

38 papers receiving 877 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
David Juedes United States	12	464	155	151	147	126	40	988
Zlatko Drmač Croatia	16	515 1.1×	247 1.6×	251 1.7×	144 1.0×	38 0.3×	41	1.1k
Jacques M. Bahi France	18	251 0.5×	133 0.9×	109 0.7×	369 2.5×	43 0.3×	97	897
Alan Carle United States	11	236 0.5×	86 0.6×	194 1.3×	75 0.5×	124 1.0×	19	831
Alexander Graham United Kingdom	7	253 0.5×	154 1.0×	134 0.9×	301 2.0×	295 2.3×	8	1.4k
John M. Danskin United States	12	223 0.5×	129 0.8×	163 1.1×	283 1.9×	113 0.9×	31	1.1k
G. T. Timmer Netherlands	9	370 0.8×	367 2.4×	322 2.1×	84 0.6×	102 0.8×	16	1.1k
Daniel Tabak United States	11	252 0.5×	98 0.6×	153 1.0×	88 0.6×	398 3.2×	48	1.0k
Decision Systems.	14	155 0.3×	97 0.6×	85 0.6×	144 1.0×	182 1.4×	105	739
Andrew H. Sherman United States	13	361 0.8×	114 0.7×	187 1.2×	194 1.3×	19 0.2×	32	934
M. C. Bartholomew‐Biggs United Kingdom	15	219 0.5×	110 0.7×	228 1.5×	32 0.2×	140 1.1×	41	815

Countries citing papers authored by David Juedes

Since Specialization

Citations

This map shows the geographic impact of David Juedes's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by David Juedes with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Juedes more than expected).

Fields of papers citing papers by David Juedes

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David Juedes. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by David Juedes. The network helps show where David Juedes may publish in the future.

Co-authorship network of co-authors of David Juedes

This figure shows the co-authorship network connecting the top 25 collaborators of David Juedes. A scholar is included among the top collaborators of David Juedes based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David Juedes. David Juedes is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kaya, Savaş, et al.. (2023). Reflections of Cybersecurity Workshop for K-12 Teachers. 987–993. 1 indexed citations

Bunescu, Răzvan, et al.. (2022). Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs. 25–32. 2 indexed citations

Juedes, David, et al.. (2022). Reflections of Cybersecurity Workshop for K-12 Teachers and High School Students. 1127–1127. 1 indexed citations

Li, Yichao, Yating Liu, David Juedes, et al.. (2019). Set cover-based methods for motif selection. Bioinformatics. 36(4). 1044–1051. 3 indexed citations

Al‐Ouran, Rami, Robert J. Schmidt, Jeffrey B. Jones, et al.. (2015). Discovering Gene Regulatory Elements Using Coverage-Based Heuristics. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15(4). 1290–1300. 2 indexed citations

Juedes, David & Frank A. Drews. (2012). Engineering a New Curriculum: Experiences at Ohio University in Incorporating the IEEE-TCPP Curriculum Initiative During a Transition to Semesters. 1279–1282. 3 indexed citations

Cai, Liming, Michael R. Fellows, David Juedes, & Frances Rosamond. (2009). On efficient polynomial-time approximation schemes for problems on planar structures. 1 indexed citations

Chen, Jianer, Benny Chor, Michael R. Fellows, et al.. (2005). Tight lower bounds for certain parameterized NP-hard problems. Information and Computation. 201(2). 216–231. 73 indexed citations

Chen, Jeson, Benny Chor, Michael R. Fellows, et al.. (2004). Tight lower bounds for certain parameterized NP-hard problems. 150–160. 24 indexed citations

10.

Lenharth, Andrew, et al.. (2004). Quality-based adaptive resource management architecture (QARMA): a CORBA resource management service. 116–123. 11 indexed citations

11.

Cai, Liming & David Juedes. (2003). On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences. 67(4). 789–807. 57 indexed citations

12.

Juedes, David & Jack H. Lutz. (2002). The complexity and distribution of hard problems. 9. 177–185. 8 indexed citations

13.

Cai, Liming, David Juedes, & Iyad Kanj. (2002). The inapproximability of non-NP-hard optimization problems. Theoretical Computer Science. 289(1). 553–571. 7 indexed citations

14.

Juedes, David & Jack H. Lutz. (2000). Modeling Time-Bounded Prefix Kolmogorov Complexity. Theory of Computing Systems. 33(2). 111–123. 1 indexed citations

15.

Bergman, Clifford, David Juedes, & Giora Slutzki. (1999). COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE. International Journal of Algebra and Computation. 9(1). 113–128. 9 indexed citations

16.

Juedes, David & Jack H. Lutz. (1996). Completeness and Weak Completeness under Polynomial-Size Circuits. Information and Computation. 125(1). 13–31. 4 indexed citations

17.

Juedes, David & Jack H. Lutz. (1995). Weak completeness in E and E2. Theoretical Computer Science. 143(1). 149–158. 23 indexed citations

18.

Juedes, David. (1995). Weak completeness in E and E2. Theoretical Computer Science. 143(1). 149–158. 30 indexed citations

19.

Juedes, David. (1995). Weakly complete problems are not rare. Computational Complexity. 5(3-4). 267–283. 7 indexed citations

20.

Juedes, David, James I. Lathrop, & Jack H. Lutz. (1994). Computational depth and reducibility. Theoretical Computer Science. 132(1-2). 37–70. 22 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact