Abraham D. Flaxman

According to our database1, Abraham D. Flaxman authored at least 38 papers between 2004 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Microsimulation models for cost-effectiveness analysis: a review and introduction to CEAM.
Proceedings of the Summer Simulation Multi-Conference, 2017

Untangling uncertainty with common random numbers: a simulation study.
Proceedings of the Summer Simulation Multi-Conference, 2017

Random Planted 3-SAT.
Encyclopedia of Algorithms, 2016

Understanding clinical and non-clinical decisions under uncertainty: a scenario-based survey.
BMC Med. Inf. & Decision Making, 2016

Canonical Correlation Analysis for Analyzing Sequences of Medical Billing Codes.
CoRR, 2016

A Statistical Model and Estimation of Disease Rates as Functions of Age and Time.
SIAM J. Scientific Computing, 2013

Using behavioral data to identify interviewer fabrication in surveys.
Proceedings of the 2013 ACM SIGCHI Conference on Human Factors in Computing Systems, 2013

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

Automated quality control for mobile data collection.
Proceedings of the ACM Annual Symposium on Computing for Development, 2012

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas.
SIAM J. Discrete Math., 2011

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

Tracking the random surfer: empirically measured teleportation parameters in PageRank.
Proceedings of the 19th International Conference on World Wide Web, 2010

Machine Learning Methods for Verbal Autopsy in Developing Countries.
Proceedings of the Artificial Intelligence for Development, 2010

Random Planted 3-SAT.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

SybilGuard: defending against sybil attacks via social networks.
IEEE/ACM Trans. Netw., 2008

A spectral technique for random satisfiable 3CNF formulas.
Random Struct. Algorithms, 2008

Trust-based recommendation systems: an axiomatic approach.
Proceedings of the 17th International Conference on World Wide Web, 2008

Auctions for structured procurement.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

The diameter of randomly perturbed digraphs and some applications.
Random Struct. Algorithms, 2007

A Geometric Preferential Attachment Model of Networks II.
Internet Mathematics, 2007

A Geometric Preferential Attachment Model of Networks.
Internet Mathematics, 2007

Expansion and Lack Thereof in Randomly Perturbed Graphs.
Internet Mathematics, 2007

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.
Combinatorics, Probability & Computing, 2007

Adversarial Deletion in a Scale-Free Random Graph Process.
Combinatorics, Probability & Computing, 2007

Maximum Matchings in Regular Graphs of High Girth.
Electr. J. Comb., 2007

The Lower Tail of the Random Minimum Spanning Tree.
Electr. J. Comb., 2007

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

On the random 2-stage minimum spanning tree.
Random Struct. Algorithms, 2006

Randomly coloring sparse random graphs with fewer colors than the maximum degree.
Random Struct. Algorithms, 2006

First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Embracing the giant component.
Random Struct. Algorithms, 2005

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.
Internet Mathematics, 2005

On the Competitive Ratio of the Random Sampling Auction.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Solving Medium-Density Subset Sum Problems in Expected Polynomial Time.
Proceedings of the STACS 2005, 2005

Online convex optimization in the bandit setting: gradient descent without a gradient.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Efficient communication in an ad-hoc network.
J. Algorithms, 2004

A sharp threshold for a random constraint satisfaction problem.
Discret. Math., 2004

Strings with Maximally Many Distinct Subsequences and Substrings.
Electr. J. Comb., 2004