Strings with Maximally Many Distinct Subsequences and Substrings. - Abraham Flaxman; Aram W. Harrow; Gregory B. Sorkin (Electron. J. Comb., 2004)

A sharp threshold for a random constraint satisfaction problem. - Abraham Flaxman (Discret. Math., 2004)

Efficient communication in an ad-hoc network. - Abraham Flaxman; Alan M. Frieze; Eli Upfal (J. Algorithms, 2004)

Online convex optimization in the bandit setting: gradient descent without a gradient. - Abraham Flaxman; Adam Tauman Kalai; H. Brendan McMahan (SODA, 2005)

Solving Medium-Density Subset Sum Problems in Expected Polynomial Time. - Abraham Flaxman; Bartosz Przydatek (STACS, 2005)

On the Competitive Ratio of the Random Sampling Auction. - Uriel Feige; Abraham Flaxman; Jason D. Hartline; Robert D. Kleinberg (WINE, 2005)

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. - Abraham Flaxman; Alan M. Frieze; Trevor I. Fenner (Internet Math., 2005)

Embracing the giant component. - Abraham D. Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2005)

First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (WINE, 2006)

Randomly coloring sparse random graphs with fewer colors than the maximum degree. - Martin E. Dyer; Abraham D. Flaxman; Alan M. Frieze; Eric Vigoda (Random Struct. Algorithms, 2006)

On the random 2-stage minimum spanning tree. - Abraham D. Flaxman; Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2006)

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet. - Abraham D. Flaxman; Juan Vera 001 (WAW, 2007)

The Lower Tail of the Random Minimum Spanning Tree. - Abraham D. Flaxman (Electron. J. Comb., 2007)

Maximum Matchings in Regular Graphs of High Girth. - Abraham D. Flaxman; Shlomo Hoory (Electron. J. Comb., 2007)

Adversarial Deletion in a Scale-Free Random Graph Process. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Comb. Probab. Comput., 2007)

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. - Abraham D. Flaxman; Alan M. Frieze; Juan Carlos Vera 001 (Comb. Probab. Comput., 2007)

Expansion and Lack Thereof in Randomly Perturbed Graphs. - Abraham D. Flaxman (Internet Math., 2007)

A Geometric Preferential Attachment Model of Networks. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

A Geometric Preferential Attachment Model of Networks II. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

The diameter of randomly perturbed digraphs and some applications. - Abraham D. Flaxman; Alan M. Frieze (Random Struct. Algorithms, 2007)

Auctions for structured procurement. - Matthew Cary; Abraham D. Flaxman; Jason D. Hartline; Anna R. Karlin (SODA, 2008)

Trust-based recommendation systems: an axiomatic approach. - Reid Andersen; Christian Borgs; Jennifer T. Chayes; Uriel Feige; Abraham D. Flaxman; Adam Kalai; Vahab S. Mirrokni; Moshe Tennenholtz (WWW, 2008)

A spectral technique for random satisfiable 3CNF formulas. - Abraham Flaxman (Random Struct. Algorithms, 2008)

SybilGuard: defending against sybil attacks via social networks. - Haifeng Yu; Michael Kaminsky; Phillip B. Gibbons; Abraham D. Flaxman (IEEE/ACM Trans. Netw., 2008)

Random Planted 3-SAT. - Abraham Flaxman (Encyclopedia of Algorithms, 2008)

Clustering with shallow trees - Marc Bailly-Bechet; S. Bradde; Alfredo Braunstein; Abraham D. Flaxman; L. Foini; Riccardo Zecchina (CoRR, 2009)

Machine Learning Methods for Verbal Autopsy in Developing Countries. - Sean T. Green; Abraham D. Flaxman (AAAI Spring Symposium: Artificial Intelligence for Development, 2010)

Tracking the random surfer: empirically measured teleportation parameters in PageRank. - David F. Gleich; Paul G. Constantine; Abraham D. Flaxman; Asela Gunawardana (WWW, 2010)

First-passage percolation on a ladder graph, and the path cost in a VCG auction. - Abraham Flaxman; David Gamarnik; Gregory B. Sorkin (Random Struct. Algorithms, 2011)

On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. - Uriel Feige; Abraham D. Flaxman; Dan Vilenchik (SIAM J. Discret. Math., 2011)

Automated quality control for mobile data collection. - Benjamin E. Birnbaum; Brian DeRenzi; Abraham D. Flaxman; Neal Lesh (ACM DEV, 2012)

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. - Omer Angel; Abraham D. Flaxman; David B. Wilson 002 (Comb., 2012)

Using behavioral data to identify interviewer fabrication in surveys. - Benjamin E. Birnbaum; Gaetano Borriello; Abraham D. Flaxman; Brian DeRenzi; Anna R. Karlin (CHI, 2013)

A Statistical Model and Estimation of Disease Rates as Functions of Age and Time. - Bradley M. Bell; Abraham D. Flaxman (SIAM J. Sci. Comput., 2013)

Canonical Correlation Analysis for Analyzing Sequences of Medical Billing Codes. - Corinne L. Jones; Sham M. Kakade; Lucas W. Thornblade; David R. Flum; Abraham D. Flaxman (CoRR, 2016)

Understanding clinical and non-clinical decisions under uncertainty: a scenario-based survey. - Vlad V. Simianu; Margaret A. Grounds; Susan L. Joslyn; Jared E. LeClerc; Anne P. Ehlers; Nidhi Agrawal; Rafael Alfonso-Cristancho; Abraham D. Flaxman; David R. Flum (BMC Medical Informatics Decis. Mak., 2016)

Random Planted 3-SAT. - Abraham Flaxman (Encyclopedia of Algorithms, 2016)

Untangling uncertainty with common random numbers: a simulation study. - Abraham D. Flaxman; Alec W. Deason; Andrew J. Dolgert; John Everett Mumford; Reed J. D. Sorensen; Erika Eldrenkamp; Theo Vos; Kyle Foreman; Ali H. Mokdad; Marcia R. Weaver (SummerSim, 2017)

Microsimulation models for cost-effectiveness analysis: a review and introduction to CEAM. - Reed J. D. Sorensen; Abraham D. Flaxman; Alec W. Deason; John Everett Mumford; Erika Eldrenkamp; Mark Moses; Marcia R. Weaver (SummerSim, 2017)

Risk of Linked Census Data to Transgender Youth: A Simulation Study. - Abraham Flaxman; Os Keyes (J. Priv. Confidentiality, 2025)