Richard Beigel

Temple University — United States

Computer Science · Physical Sciences

33h-index3.4kcitations142works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(61), Computability, Logic, AI Algorithms(38), semigroups and automata theory(29), Algorithms and Data Compression(21), Machine Learning and Algorithms(21)

Publications142 total

A Partition-Based Group Testing Algorithm for Estimating the Number of Infected Individuals
medRxiv·2021Open Access
A Partition-Based Group Testing Algorithm for Estimating the Number of Infected Individuals
2021Open Access
Rate Estimation and Identification of COVID-19 Infections: Towards Rational Policy Making During Early and Late Stages of Epidemics
2020· 2 citedOpen Access
On the sizes of DPDAs, PDAs, LBAs
Theoretical Computer Science·2015· 1 cited
On the Sizes of DPDAs, PDAs, LBAs
arXiv (Cornell University)·2015Open Access
On optimal scheduling of multiple mobile chargers in wireless sensor networks
2014· 20 cited
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
Lecture notes in computer science·2012· 5 cited
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
arXiv (Cornell University)·2010Open Access
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
arXiv (Cornell University)·2010Open Access
Square-Difference-Free Sets of Size Omega(n^{0.7334...})
arXiv (Cornell University)·2008· 3 citedOpen Access
Enumerations of the Kolmogorov function
Journal of Symbolic Logic·2006· 25 cited
A tight lower bound for restricted pir protocols
Computational Complexity·2006· 25 cited
The multiparty communication complexity of Exact-T: Improved bounds and new problems
2006· 6 cited
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Lecture notes in computer science·2006· 8 cited
Infinitely‐Often Autoreducible Sets
SIAM Journal on Computing·2006· 4 cited
Quantifying the amount of verboseness (extended abstract)
Lecture notes in computer science·2005· 7 cited
3-coloring in time
Journal of Algorithms·2004· 155 citedOpen Access
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science·2004· 31 cited
Are Cook and Karp ever the same?
2004· 2 cited
Learning a Hidden Matching
SIAM Journal on Computing·2004· 79 cited
page 1 of 8Next →

Frequent Co-authors

Daniel A. Spielman(4), Steven Rudich(4), John Gill(4), Lance Fortnow(4), Nick Reingold(3), Jun Tarui(3), David Eppstein(3), Simon Kasif(3), Noga Alon(3), Frank Stephan(3), William Gasarch(3), Egemen Tanin(3), James Aspnes(2), Merrick L. Furst(2), Martin Kummer(2), Joan Feigenbaum(2), Ben Shneiderman(2), Harry Buhrman(2), Sreerama K. Murthy(1), Steven L. Salzberg(1)