Abraham D. Flaxman

Os Keyes

J. Priv. Confidentiality, 2025

2017

Microsimulation models for cost-effectiveness analysis: a review and introduction to CEAM.

[BibT_eX]

[DOI]

Proceedings of the Summer Simulation Multi-Conference, 2017

Untangling uncertainty with common random numbers: a simulation study.

[BibT_eX]

[DOI]

Proceedings of the Summer Simulation Multi-Conference, 2017

2016

Random Planted 3-SAT.

[BibT_eX]

[DOI]

Rafael Alfonso-Cristancho

Encyclopedia of Algorithms, 2016

Understanding clinical and non-clinical decisions under uncertainty: a scenario-based survey.

[BibT_eX]

[DOI]

David R. Flum

BMC Medical Informatics Decis. Mak., 2016

Canonical Correlation Analysis for Analyzing Sequences of Medical Billing Codes.

[BibT_eX]

[DOI]

CoRR, 2016

2013

A Statistical Model and Estimation of Disease Rates as Functions of Age and Time.

[BibT_eX]

[DOI]

Bradley M. Bell

SIAM J. Sci. Comput., 2013

Using behavioral data to identify interviewer fabrication in surveys.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGCHI Conference on Human Factors in Computing Systems, 2013

2012

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks.

[BibT_eX]

[DOI]

Omer Angel

David B. Wilson

Comb., 2012

Automated quality control for mobile data collection.

[BibT_eX]

[DOI]

Proceedings of the ACM Annual Symposium on Computing for Development, 2012

2011

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable <i>k</i>-CNF Formulas.

[BibT_eX]

[DOI]

Uriel Feige

Dan Vilenchik

SIAM J. Discret. Math., 2011

First-passage percolation on a ladder graph, and the path cost in a VCG auction.

[BibT_eX]

[DOI]

David Gamarnik

Random Struct. Algorithms, 2011

2010

Tracking the random surfer: empirically measured teleportation parameters in PageRank.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on World Wide Web, 2010

Machine Learning Methods for Verbal Autopsy in Developing Countries.

[BibT_eX]

[DOI]

Sean T. Green

Proceedings of the Artificial Intelligence for Development, 2010

2009

Clustering with shallow trees

[BibT_eX]

[DOI]

CoRR, 2009

2008

Random Planted 3-SAT.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Trust-based recommendation systems: an axiomatic approach.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

Auctions for structured procurement.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Maximum Matchings in Regular Graphs of High Girth.

[BibT_eX]

[DOI]

Shlomo Hoory

Electron. J. Comb., 2007

The Lower Tail of the Random Minimum Spanning Tree.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

A Geometric Preferential Attachment Model of Networks II.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

2006

Randomly coloring sparse random graphs with fewer colors than the maximum degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2006

First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction.

[BibT_eX]

[DOI]

David Gamarnik

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Expansion and Lack Thereof in Randomly Perturbed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

SybilGuard: defending against sybil attacks via social networks.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2006 Conference on Applications, 2006

2005

On the Competitive Ratio of the Random Sampling Auction.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem.

[BibT_eX]

[DOI]

Juan Carlos Vera

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Solving Medium-Density Subset Sum Problems in Expected Polynomial Time.

[BibT_eX]

[DOI]

Bartosz Przydatek

Proceedings of the STACS 2005, 2005

Online convex optimization in the bandit setting: gradient descent without a gradient.

[BibT_eX]

[DOI]

Adam Tauman Kalai

H. Brendan McMahan

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Adversarial deletion in a scale free random graph process.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

On the random 2-stage minimum spanning tree.

[BibT_eX]

[DOI]

Michael Krivelevich

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Efficient communication in an ad-hoc network.

[BibT_eX]

[DOI]

Eli Upfal

J. Algorithms, 2004

A sharp threshold for a random constraint satisfaction problem.

[BibT_eX]

[DOI]

Discret. Math., 2004

Strings with Maximally Many Distinct Subsequences and Substrings.

[BibT_eX]

[DOI]

Aram W. Harrow

Electron. J. Comb., 2004

A Geometric Preferential Attachment Model of Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Embracing the Giant Component.

[BibT_eX]

[DOI]

David Gamarnik

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The Diameter of Randomly Perturbed Digraphs and Some Applications..

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

A spectral technique for random satisfiable 3CNF formulas.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.

[BibT_eX]

[DOI]