Publications

Found 7 results
Author Title Type [ Year(Desc)]
Filters: Author is Paul Dagum  [Clear All Filters]
1989
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Cleve, R., & Dagum P. (1989).  A Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t).
Dagum, P. (1989).  A Linear-Time Algorithm for Enumerating Perfect Matchings in Skew Bipartite Graphs.
1990
Dagum, P. (1990).  On the Magnification of Exchange Graphs with Applications to Enumeration Problems (Thesis).
1995
Dagum, P., Karp R. M., Luby M., & Ross S. (1995).  An optimal algorithm for Monte Carlo estimation. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 142-149.
2000
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte Carlo Estimation. 29,
Dagum, P., Karp R. M., Luby M., & Ross S. (2000).  An Optimal Algorithm for Monte-Carlo Estimation. 29(5), 1484-1496.