World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
37
Citations
5151
World Ranking
10855
National Ranking
4518

Mathematics

D-Index
37
Citations
4991
World Ranking
2532
National Ranking
1050

Overview

Richard Beigel is affiliated with Temple University in the United States and focuses their research primarily in the fields of medicine and computer science.

The main areas of study associated with their work include:

  • Medicine
  • Computer Science

Their subfields of specialization are equally interdisciplinary, covering:

  • Infectious Diseases
  • Artificial Intelligence
  • Epidemiology
  • Modeling and Simulation

Their research topics provide a detailed glimpse into their contributions, notably in relation to pandemic-related challenges and computational methods for disease surveillance. These topics are:

  • SARS-CoV-2 detection and testing
  • Machine Learning and Algorithms
  • Data-Driven Disease Surveillance
  • COVID-19 epidemiological studies
  • SARS-CoV-2 and COVID-19 Research

Richard Beigel has published research primarily in two venues:

  • bioRxiv (Cold Spring Harbor Laboratory)
  • medRxiv

Their recent notable papers include:

  • "Rate Estimation and Identification of COVID-19 Infections: Towards Rational Policy Making During Early and Late Stages of Epidemics" (2020) published in bioRxiv (Cold Spring Harbor Laboratory)
  • "A Partition-Based Group Testing Algorithm for Estimating the Number of Infected Individuals" (2021) published in medRxiv
  • "A Partition-Based Group Testing Algorithm for Estimating the Number of Infected Individuals" (2021) published in bioRxiv (Cold Spring Harbor Laboratory)

Frequent collaborators include:

  • Max J. Webber
  • Simon Kasif

Best Publications

  • PP is closed under intersection

    Richard Beigel;Nick Reingold;Daniel Spielman

  • On ACC

    Richard Beigel;Jun Tarui

  • Representing Boolean functions as polynomials modulo composite numbers

    David A. Mix Barrington;Richard Beigel;Steven Rudich

  • The expressive power of voting polynomials

    James Aspnes;Richard Beigel;Merrick L. Furst;Steven Rudich

  • OC1: randomized induction of oblique decision trees

    Sreerama Murthy;Simon Kasif;Steven Salzberg;Richard Beigel

  • The polynomial method in circuit complexity

    R. Beigel

  • Bounded queries to SAT and the Boolean hierarchy

    Richard Beigel

  • 3-coloring in time O (1.3289 n )

    Richard Beigel;David Eppstein

  • Counting classes: thresholds, parity, mods, and fewness

    Richard Beigel;John Gill;Ulrich Hertrampf

  • Approximable Sets

    R. Beigel;M. Kummer;F. Stephan

  • Finding maximum independent sets in sparse and general graphs

    Richard Beigel

  • Some connections between bounded query classes and nonuniform complexity

    A. Amir;R. Beigel;W.I. Gasarch

  • Perceptrons, PP, and the polynomial hierarchy

    R. Beigel

  • Query-limited reducibilities

    Richard Beigel

  • Terse, superterse, and verbose sets

    Richard Beigel;William I. Gasarch;John Gill;James C. Owings

  • Learning a Hidden Matching

    Noga Alon;Richard Beigel;Simon Kasif;Steven Rudich

  • A computational framework for optimal masking in the synthesis of oligonucleotide microarrays

    Simon Kasif;Zhiping Weng;Adnan Derti;Richard Beigel

  • The perceptron strikes back

    R. Beigel;N. Reingold;D. Spielman

  • The expressive power of voting polynomials

    James Aspnes;Richard Beigel;Merrick Furst;Steven Rudich

  • A Relationship between Difference Hierarchies and Relativized Polynomial Hierarchies.

    Richard Beigel;Richard Chang;Mitsunori Ogiwara

  • Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract)

    David A. Mix Barrington;Richard Beigel;Steven Rudich

Frequent Co-Authors

Lance Fortnow
Lance Fortnow Illinois Institute of Technology
Simon Kasif
Simon Kasif Boston University
David Eppstein
David Eppstein University of California, Irvine
Noga Alon
Noga Alon Tel Aviv University
Harry Buhrman
Harry Buhrman University of Amsterdam
Daniel A. Spielman
Daniel A. Spielman Yale University
Amihood Amir
Amihood Amir Bar-Ilan University
Ben Shneiderman
Ben Shneiderman University of Maryland, College Park
Benny Sudakov
Benny Sudakov ETH Zurich
Eric Allender
Eric Allender Rutgers, The State University of New Jersey

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

Pursuing a Mathematics degree in the USA opens doors to various advanced study options and career paths. For those interested in leveraging quantitative skills, a data analytics master's degree offers a practical route into the booming field of data science and business intelligence. This degree combines mathematical expertise with cutting-edge technology to solve complex problems.

For students considering leadership roles or broader business knowledge, exploring the easiest MBA program to get into can be a strategic choice. These programs provide flexibility and accessibility, helping students gain essential management skills without intense admission pressures.

Many working professionals benefit from an easiest online MBA, which combines convenience with quality education. Online MBAs support balancing career growth with study, making it feasible for a wider range of students.

For those seeking senior-level advancement, pursuing a 1 year DBA program online is an efficient path. These Doctorate in Business Administration programs are designed for timely completion while deepening expertise in data-driven decision-making and leadership.

Best Scientists Citing Richard Beigel

Trending Scientists