最新萝莉社

Denison professor and students author award-winning paper

Computer Science
January 12, 2026

If Oghap Kim 鈥26 didn鈥檛 fully appreciate having a research paper accepted at a prestigious international conference, she certainly did when it came time to present it last summer.

Kim represented Professor Ashwin Lall, chair of the computer science department, and two fellow Denison students, Lam Do 鈥26 and Chloe Chai 鈥25, on stage at the 37th International Conference on Scalable Scientific Data Management at Ohio State University.

The Denison entry was one of just 12 accepted by the committee in the Long Research Paper category and the only one presented by an undergraduate. While Kim admitted to feeling a bit intimidated by the surroundings, she delivered a flawless 13-minute presentation.

鈥淎ll the other presenters were either faculty members or PhD students,鈥 Lall said. 鈥淥ghap presented our paper in front of an audience of PhDs and did an awesome job.鈥

Don鈥檛 take the professor鈥檚 word for it. The judges honored Denison鈥檚 work with the Best Paper award at a conference that brings together domain experts, data management researchers, practitioners, and developers from around the world.

鈥淚 couldn鈥檛 believe it,鈥 said Kim, a computer science major who plans to attend graduate school. 鈥淚 was almost crying on the way home.鈥

Being the paper鈥檚 only author present for the June 25, 2025, award ceremony, she shared the remarkable news with Lall, Do, and Chai through a group email. Back home in Vietnam, Do received the message in the wee hours of the morning.

鈥淲e did this research as part of the Summer Scholars program in 2024,鈥 said Do, a computer science major who plans to become a software engineer. 鈥淚t was a great experience, and I have become a more confident person because of it. Professor Lall makes us feel like we are the experts in the field of our research. I never thought it was possible our work would be compared to PhD students and faculty members.鈥

The 10-week summer research was an extension of Lall鈥檚 work in the field of the indistinguishability query 鈥 a concept in databases where a system returns results that are so similar to the optimal results that a user can’t tell the difference. It helps solve the 鈥渇ear of missing out鈥 factor by offering near-optimal choices without needing a perfect utility function.

The group鈥檚 paper is titled, 鈥淭he Power of Two: Simplified User Interaction for the Indistinguishability Query.鈥

The research could lead to more efficient online shopping. It鈥檚 designed to help consumers save time and make the best decisions when searching the internet for important purchases.

Key highlights of the paper are:

  • Introducing a simplified user interaction framework for multi-criteria decision-making.
  • Providing a 鈥渢olerably truthful鈥 algorithm for executing the indistinguishability query.
  • Illustrating performance evaluations for algorithms on real and artificial data sets, and including results from a small user study of 30 Denison students administered by Kim in the fall of 2024.

Most people are familiar with the time-consuming process of clicking through endless website pages, looking for the right product. Denison researchers propose asking consumers a series of questions to determine what factors are most important in their purchasing decisions. The program weeds through databases to offer head-to-head comparisons.

The judges rewarded the Denison researchers for an approach that was 鈥渘ovel and interesting.鈥

Kim is the second member of her family to attend Denison. Her older sister, Hyangyoo Kim 鈥25, is a data analyst in New York.

She鈥檚 happy with her choice of schools, and for the opportunity to work closely with members of the computer science faculty.

鈥淚 am grateful for Denison,鈥 she said. 鈥淚 have friends who went to larger schools, and I hear about their experiences. I don鈥檛 think many undergraduates at those schools get these kinds of chances. I鈥檓 working on something that helps people solve problems and meet their needs. This experience has been very rewarding.鈥

Back to top
Back to top