World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
63
Citations
20476
World Ranking
2705
National Ranking
1343

Research.com Recognitions

  • 2020 - Fellow of the Indian National Academy of Engineering (INAE)
  • 2018 - Member of Academia Europaea
  • 2013 - Fellow, National Academy of Inventors
  • 2008 - Edward J. McCluskey Technical Achievement Award, IEEE Computer Society For pioneering development of Scalable Information Systems
  • 2005 - ACM Fellow For contributions to search systems for distributed data.
  • 2003 - Fellow of the American Association for the Advancement of Science (AAAS)
  • Member of the European Academy of Sciences and Arts
  • Member of the European Academy of Sciences and Arts
  • Member of the European Academy of Sciences and Arts

Overview

Ophir Frieder is affiliated with Georgetown University in the United States and specializes in computer science with a focus on artificial intelligence, information systems, computer vision and pattern recognition, computer networks and communications, and health information management. The scholar's work spans multiple subfields and covers a range of topics including topic modeling, caching and content delivery, advanced image and video retrieval techniques, software engineering research, speech and dialogue systems, machine learning and algorithms, and recommender systems and techniques.

Their recent publications reflect a focus on conversational search, caching strategies, and representation learning in computational contexts. Key papers include:

  • Adaptive utterance rewriting for conversational search, 2021, published in Information Processing & Management
  • Caching Historical Embeddings in Conversational Search, 2022, published in ACM Transactions on the Web
  • Topical result caching in web search engines, 2020, published in Information Processing & Management
  • Goldilocks: Just-Right Tuning of BERT for Technology-Assisted Review, 2021, published in arXiv (Cornell University)
  • Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax, 2024, published in ACM Transactions on Computing for Healthcare

Their frequent coauthors include Raffaele Perego, Sean MacAvaney, Nicola Tonellotto, Ida Mele, and Cristina Ioana Muntean, highlighting collaborative work in their research outputs.

Ophir Frieder has published extensively in venues such as arXiv (Cornell University), Information Processing & Management, Journal of Nonlinear and Variational Analysis, ACM Transactions on the Web, and ACM Transactions on Computing for Healthcare. The distribution of publications indicates a consistent engagement with both journal and conference outlets in computer science and related areas.

Awards and recognitions received by the researcher include being a Fellow of the Indian National Academy of Engineering (2020), a Member of Academia Europaea (2018), a Fellow of the National Academy of Inventors (2013), recipient of the Edward J. McCluskey Technical Achievement Award by the IEEE Computer Society (2008) for work in scalable information systems, an ACM Fellow (2005) for contributions to search systems for distributed data, a Fellow of the American Association for the Advancement of Science (2003), and membership in the European Academy of Sciences and Arts.

Best Publications

  • Distributed construction of connected dominating set in wireless ad hoc networks

    Peng-Jun Wan;Khaled M. Alzoubi;Ophir Frieder

  • Information Retrieval: Algorithms and Heuristics

    David A. Grossman;Ophir Frieder

  • Coverage in wireless ad hoc sensor networks

    Xiang-Yang Li;Peng-Jun Wan;O. Frieder

  • Minimum-energy broadcasting in static ad hoc wireless networks

    P. J. Wan;G. Călinescu;X. Y. Li;O. Frieder

  • Minimum-energy broadcast routing in static ad hoc wireless networks

    P.-J. Wan;G. Calinescu;X.-Y. Li;O. Frieder

  • Message-optimal connected dominating sets in mobile ad hoc networks

    Khaled M. Alzoubi;Peng-Jun Wan;Ophir Frieder

  • Hate speech detection: Challenges and solutions.

    Sean MacAvaney;Hao Ren Yao;Eugene Yang;Katina Russell

  • Collection statistics for fast duplicate document detection

    Abdur Chowdhury;Ophir Frieder;David Grossman;Mary Catherine McCabe

  • Hourly analysis of a very large topically categorized web query log

    Steven M. Beitzel;Eric C. Jensen;Abdur Chowdhury;David Grossman

  • Multiple engine information retrieval and visualization system

    Kevin L. Fox;Ophir Frieder;Margaret M. Knepper;Robert A. Killam

  • Repeatable evaluation of search services in dynamic environments

    Eric C. Jensen;Steven M. Beitzel;Abdur Chowdhury;Ophir Frieder

  • New distributed algorithm for connected dominating set in wireless ad hoc networks

    K.M. Alzoubi;Peng-Jun Wan;O. Frieder

  • Localized algorithms for energy efficient topology in wireless ad hoc networks

    Wen-Zhan Song;Yu Wang;Xiang-Yang Li;Ophir Frieder

  • Efficient interference-aware TDMA link scheduling for static wireless networks

    Weizhao Wang;Yu Wang;Xiang-Yang Li;Wen-Zhan Song

  • Distributed heuristics for connected dominating sets in wireless ad hoc networks

    Khaled M. Alzoubi;Peng-Jun Wan;Ophir Frieder

  • Building a test collection for complex document information processing

    D. Lewis;G. Agam;S. Argamon;O. Frieder

  • Geometric spanners for wireless ad hoc networks

    K. Alzoubi;X.-Y. Li;Y. Wang;P.-J. Wan

  • On arabic search: improving the retrieval effectiveness via a light stemming approach

    Mohammed Aljlayl;Ophir Frieder

  • On-the-fly program modification: systems for dynamic updating

    M.E. Segal;O. Frieder

  • Information Retrieval

    Unknown

  • Parallel document clustering process

    Anthony S. Ruocco;Ophir Frieder

Frequent Co-Authors

Peng-Jun Wan
Peng-Jun Wan Illinois Institute of Technology
Xiang-Yang Li
Xiang-Yang Li University of Science and Technology of China
Yu Wang
Yu Wang Temple University
Raffaele Perego
Raffaele Perego Institute of Information Science and Technologies
Tarek El-Ghazawi
Tarek El-Ghazawi George Washington University
Wen-Zhan Song
Wen-Zhan Song University of Georgia
Hava T. Siegelmann
Hava T. Siegelmann University of Massachusetts Amherst
Howard J. Federoff
Howard J. Federoff University of California, Irvine
Xiaohua Jia
Xiaohua Jia City University of Hong Kong

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees is a great way to advance your career in computer science or pivot to related technology fields. Many students looking for flexibility and affordability opt for programs that fit their goals and budget. If you're just starting out, an easiest associate degree in a tech discipline can be a fast route to entry-level positions or a strong foundation for further study.

For those interested in pursuing education at the doctoral level, the most affordable edd programs deliver advanced expertise and can open doors to leadership roles in academia, administration, or research. Choosing a reputable school is crucial, so reviewing lists of good online colleges ensures you receive a recognized and quality education.

For creative minds intrigued by gaming technology, a game development online degree offers courses in programming, animation, and design, helping you prepare for a dynamic career in the growing industry of multimedia and interactive entertainment.

Best Scientists Citing Ophir Frieder

Trending Scientists