Homin K. Lee

1.4k total citations · 1 hit paper
16 papers, 950 citations indexed

About

Homin K. Lee is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Homin K. Lee has authored 16 papers receiving a total of 950 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Homin K. Lee's work include Machine Learning and Algorithms (10 papers), Complexity and Algorithms in Graphs (6 papers) and Cryptography and Data Security (4 papers). Homin K. Lee is often cited by papers focused on Machine Learning and Algorithms (10 papers), Complexity and Algorithms in Graphs (6 papers) and Cryptography and Data Security (4 papers). Homin K. Lee collaborates with scholars based in United States, United Kingdom and China. Homin K. Lee's co-authors include Paul Pavlidis, Amy K Hsu, Jie Qin, Tal Malkin, Erich Nahum, Andrew Wan, Rocco A. Servedio, Moti Yung, Angelos D. Keromytis and Ilias Diakonikolas and has published in prestigious journals such as Genome Research, BMC Bioinformatics and Machine Learning.

In The Last Decade

Homin K. Lee

15 papers receiving 920 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Coexpression Analysis of Human Genes Across Many Microarray Data Sets

2004 583 citations Homin K. Lee, Amy K Hsu et al. Genome Research profile →

Peers

Countries citing papers authored by Homin K. Lee

Since Specialization

Citations

This map shows the geographic impact of Homin K. Lee'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 Homin K. Lee with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Homin K. Lee more than expected).

Fields of papers citing papers by Homin K. Lee

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Homin K. Lee. 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 Homin K. Lee. The network helps show where Homin K. Lee may publish in the future.

Co-authorship network of co-authors of Homin K. Lee

This figure shows the co-authorship network connecting the top 25 collaborators of Homin K. Lee. A scholar is included among the top collaborators of Homin K. Lee 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 Homin K. Lee. Homin K. Lee 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:

16 of 16 papers shown

#	Work	Indexed citations
1	The Efficient Dual Receiver Cryptosystem and Its Applications 2011 ·International journal of network security ·(unknown), Homin K. Lee, Angelos D. Keromytis, Moti Yung	3
2	Learning Talagrand DNF Formulas. 2010 ·Conference on Learning Theory ·Homin K. Lee	1
3	Mansour's Conjecture is True for Random DNF Formulas 2010 ·Conference on Learning Theory ·Adam R. Klivans, Homin K. Lee, Andrew Wan	10
4	2010 ·Theory of Computing ·Homin K. Lee	3
5	Efficiently Testing Sparse GF(2) Polynomials 2010 ·Algorithmica ·Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan	1
6	Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. 2010 ·Vitaly Feldman, Homin K. Lee, Rocco A. Servedio	2
7	2009 ·Theory of Computing ·Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee	4
8	Learning Random Monotone DNF 2008 ·Lecture notes in computer science ·Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan	1
9	Testing for Concise Representations 2007 ·Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan	2
10	DNF are teachable in the average case 2007 ·Machine Learning ·Homin K. Lee, Rocco A. Servedio, Andrew Wan	2
11	Cryptographic strength of ssl/tls servers 2007 ·Homin K. Lee, Tal Malkin, Erich Nahum	39
12	Testing for Concise Representations 2007 ·Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan	44
13	48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings 2007 ·Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, (unknown)	6
14	ErmineJ: Tool for functional analysis of gene expression data sets 2005 ·BMC Bioinformatics ·Homin K. Lee, (unknown), (unknown), Paul Pavlidis	218
15	Coexpression Analysis of Human Genes Across Many Microarray Data Sets breakdown → 2004 ·Genome Research ·Homin K. Lee, Amy K Hsu, (unknown), Jie Qin, Paul Pavlidis	583
16	The dual receiver cryptosystem and its applications 2004 ·(unknown), Homin K. Lee, Angelos D. Keromytis, Moti Yung	31

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