default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbraham D. Flaxman
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c24]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:
Untangling uncertainty with common random numbers: a simulation study. SummerSim 2017: 31:1-31:12- [c23]Reed J. D. Sorensen, Abraham D. Flaxman, Alec W. Deason, John Everett Mumford, Erika Eldrenkamp, Mark Moses, Marcia R. Weaver:
Microsimulation models for cost-effectiveness analysis: a review and introduction to CEAM. SummerSim 2017: 32:1-32:11 - 2016
- [j22]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:
Understanding clinical and non-clinical decisions under uncertainty: a scenario-based survey. BMC Medical Informatics Decis. Mak. 16: 153:1-153:9 (2016) - [r2]Abraham Flaxman:
Random Planted 3-SAT. Encyclopedia of Algorithms 2016: 1728-1732 - [i2]Corinne L. Jones, Sham M. Kakade, Lucas W. Thornblade, David R. Flum, Abraham D. Flaxman:
Canonical Correlation Analysis for Analyzing Sequences of Medical Billing Codes. CoRR abs/1612.00516 (2016) - 2013
- [j21]Bradley M. Bell, Abraham D. Flaxman:
A Statistical Model and Estimation of Disease Rates as Functions of Age and Time. SIAM J. Sci. Comput. 35(2) (2013) - [c22]Benjamin E. Birnbaum, Gaetano Borriello, Abraham D. Flaxman, Brian DeRenzi, Anna R. Karlin:
Using behavioral data to identify interviewer fabrication in surveys. CHI 2013: 2911-2920 - 2012
- [j20]Omer Angel, Abraham D. Flaxman, David B. Wilson:
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. Comb. 32(1): 1-33 (2012) - [c21]Benjamin E. Birnbaum, Brian DeRenzi, Abraham D. Flaxman, Neal Lesh:
Automated quality control for mobile data collection. ACM DEV 2012: 1:1-1:10 - 2011
- [j19]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
:
First-passage percolation on a ladder graph, and the path cost in a VCG auction. Random Struct. Algorithms 38(3): 350-364 (2011) - [j18]Uriel Feige, Abraham D. Flaxman, Dan Vilenchik:
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. SIAM J. Discret. Math. 25(2): 736-749 (2011) - 2010
- [c20]Sean T. Green, Abraham D. Flaxman:
Machine Learning Methods for Verbal Autopsy in Developing Countries. AAAI Spring Symposium: Artificial Intelligence for Development 2010 - [c19]David F. Gleich, Paul G. Constantine, Abraham D. Flaxman, Asela Gunawardana:
Tracking the random surfer: empirically measured teleportation parameters in PageRank. WWW 2010: 381-390
2000 – 2009
- 2008
- [j17]Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas. Random Struct. Algorithms 32(4): 519-534 (2008) - [j16]Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham D. Flaxman:
SybilGuard: defending against sybil attacks via social networks. IEEE/ACM Trans. Netw. 16(3): 576-589 (2008) - [c18]Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin:
Auctions for structured procurement. SODA 2008: 304-313 - [c17]Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz:
Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208 - [r1]Abraham Flaxman:
Random Planted 3-SAT. Encyclopedia of Algorithms 2008 - 2007
- [j15]Abraham D. Flaxman:
The Lower Tail of the Random Minimum Spanning Tree. Electron. J. Comb. 14(1) (2007) - [j14]Abraham D. Flaxman, Shlomo Hoory:
Maximum Matchings in Regular Graphs of High Girth. Electron. J. Comb. 14(1) (2007) - [j13]Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
Adversarial Deletion in a Scale-Free Random Graph Process. Comb. Probab. Comput. 16(2): 261-270 (2007) - [j12]Abraham D. Flaxman, Alan M. Frieze, Juan Carlos Vera:
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Comb. Probab. Comput. 16(5): 713-732 (2007) - [j11]Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks. Internet Math. 3(2): 187-205 (2007) - [j10]Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks II. Internet Math. 4(1): 87-111 (2007) - [j9]Abraham D. Flaxman:
Expansion and Lack Thereof in Randomly Perturbed Graphs. Internet Math. 4(2): 131-147 (2007) - [j8]Abraham D. Flaxman, Alan M. Frieze:
The diameter of randomly perturbed digraphs and some applications. Random Struct. Algorithms 30(4): 484-504 (2007) - [c16]Abraham D. Flaxman, Juan Vera:
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet. WAW 2007: 1-15 - [c15]Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks II. WAW 2007: 41-55 - 2006
- [j7]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich:
On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006) - [j6]Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda:
Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4): 450-465 (2006) - [c14]Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman:
SybilGuard: defending against sybil attacks via social networks. SIGCOMM 2006: 267-278 - [c13]Abraham D. Flaxman:
Expansion and Lack Thereof in Randomly Perturbed Graphs. WAW 2006: 24-35 - [c12]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction. WINE 2006: 99-111 - 2005
- [j5]Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Math. 2(1): 1-19 (2005) - [j4]Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the giant component. Random Struct. Algorithms 27(3): 277-289 (2005) - [c11]Abraham Flaxman, Alan M. Frieze, Juan Vera:
Adversarial deletion in a scale free random graph process. SODA 2005: 287-292 - [c10]Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan:
Online convex optimization in the bandit setting: gradient descent without a gradient. SODA 2005: 385-394 - [c9]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich:
On the random 2-stage minimum spanning tree. SODA 2005: 919-926 - [c8]Abraham Flaxman, Bartosz Przydatek:
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time. STACS 2005: 305-314 - [c7]Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera:
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. STOC 2005: 441-449 - [c6]Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg:
On the Competitive Ratio of the Random Sampling Auction. WINE 2005: 878-886 - 2004
- [j3]Abraham Flaxman, Aram W. Harrow, Gregory B. Sorkin:
Strings with Maximally Many Distinct Subsequences and Substrings. Electron. J. Comb. 11(1) (2004) - [j2]Abraham Flaxman:
A sharp threshold for a random constraint satisfaction problem. Discret. Math. 285(1-3): 301-305 (2004) - [j1]Abraham Flaxman, Alan M. Frieze, Eli Upfal:
Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004) - [c5]Abraham Flaxman, Alan M. Frieze:
The Diameter of Randomly Perturbed Digraphs and Some Applications.. APPROX-RANDOM 2004: 345-356 - [c4]Abraham Flaxman, David Gamarnik, Gregory B. Sorkin:
Embracing the Giant Component. LATIN 2004: 69-79 - [c3]Abraham Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks. WAW 2004: 44-55 - [i1]Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan:
Online convex optimization in the bandit setting: gradient descent without a gradient. CoRR cs.LG/0408007 (2004) - 2003
- [c2]Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. RANDOM-APPROX 2003: 264-274 - [c1]Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas. SODA 2003: 357-363
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
