Abraham Flaxman
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 42 | Benjamin E. Birnbaum, Brian DeRenzi, Abraham D. Flaxman, Neal Lesh: Automated quality control for mobile data collection. ACM DEV 2012: 1 | |
| 2011 | ||
| 41 | 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) | |
| 40 | Uriel Feige, Abraham D. Flaxman, Dan Vilenchik: On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. SIAM J. Discrete Math. 25(2): 736-749 (2011) | |
| 2010 | ||
| 39 | Sean T. Green, Abraham D. Flaxman: Machine Learning Methods for Verbal Autopsy in Developing Countries. AAAI Spring Symposium: Artificial Intelligence for Development 2010 | |
| 38 | 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 | |
| 2008 | ||
| 37 | Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin: Auctions for structured procurement. SODA 2008: 304-313 | |
| 36 | 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 | |
| 35 | Abraham Flaxman: Random Planted 3-SAT. Encyclopedia of Algorithms 2008 | |
| 34 | 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) | |
| 33 | Abraham Flaxman: A spectral technique for random satisfiable 3CNF formulas. Random Struct. Algorithms 32(4): 519-534 (2008) | |
| 2007 | ||
| 32 | Abraham D. Flaxman, Juan Vera: Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet. WAW 2007: 1-15 | |
| 31 | Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks II. WAW 2007: 41-55 | |
| 30 | Abraham D. Flaxman, Alan M. Frieze, Juan Vera: Adversarial Deletion in a Scale-Free Random Graph Process. Combinatorics, Probability & Computing 16(2): 261-270 (2007) | |
| 29 | 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. Combinatorics, Probability & Computing 16(5): 713-732 (2007) | |
| 28 | Abraham D. Flaxman, Shlomo Hoory: Maximum Matchings in Regular Graphs of High Girth. Electr. J. Comb. 14(1): (2007) | |
| 27 | Abraham D. Flaxman: The Lower Tail of the Random Minimum Spanning Tree. Electr. J. Comb. 14(1): (2007) | |
| 26 | Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks. Internet Mathematics 3(2): 187-205 (2007) | |
| 25 | Abraham D. Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks II. Internet Mathematics 4(1): 87-111 (2007) | |
| 24 | Abraham D. Flaxman: Expansion and Lack Thereof in Randomly Perturbed Graphs. Internet Mathematics 4(2): 131-147 (2007) | |
| 23 | Abraham D. Flaxman, Alan M. Frieze: The diameter of randomly perturbed digraphs and some applications. Random Struct. Algorithms 30(4): 484-504 (2007) | |
| 2006 | ||
| 22 | Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman: SybilGuard: defending against sybil attacks via social networks. SIGCOMM 2006: 267-278 | |
| 21 | Abraham D. Flaxman: Expansion and Lack Thereof in Randomly Perturbed Graphs. WAW 2006: 24-35 | |
| 20 | 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 | |
| 19 | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich: On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006) | |
| 18 | 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) | |
| 2005 | ||
| 17 | Abraham Flaxman, Alan M. Frieze, Juan Vera: Adversarial deletion in a scale free random graph process. SODA 2005: 287-292 | |
| 16 | Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan: Online convex optimization in the bandit setting: gradient descent without a gradient. SODA 2005: 385-394 | |
| 15 | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich: On the random 2-stage minimum spanning tree. SODA 2005: 919-926 | |
| 14 | Abraham Flaxman, Bartosz Przydatek: Solving Medium-Density Subset Sum Problems in Expected Polynomial Time. STACS 2005: 305-314 | |
| 13 | 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 | |
| 12 | Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg: On the Competitive Ratio of the Random Sampling Auction. WINE 2005: 878-886 | |
| 11 | Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Internet Mathematics 2(1): 1-19 (2005) | |
| 10 | Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin: Embracing the giant component. Random Struct. Algorithms 27(3): 277-289 (2005) | |
| 2004 | ||
| 9 | Abraham Flaxman, Alan M. Frieze: The Diameter of Randomly Perturbed Digraphs and Some Applications.. APPROX-RANDOM 2004: 345-356 | |
| 8 | Abraham Flaxman, David Gamarnik, Gregory B. Sorkin: Embracing the Giant Component. LATIN 2004: 69-79 | |
| 7 | Abraham Flaxman, Alan M. Frieze, Juan Vera: A Geometric Preferential Attachment Model of Networks. WAW 2004: 44-55 | |
| 6 | 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) | |
| 5 | Abraham Flaxman: A sharp threshold for a random constraint satisfaction problem. Discrete Mathematics 285(1-3): 301-305 (2004) | |
| 4 | Abraham Flaxman, Aram Wettroth Harrow, Gregory B. Sorkin: Strings with Maximally Many Distinct Subsequences and Substrings. Electr. J. Comb. 11(1): (2004) | |
| 3 | Abraham Flaxman, Alan M. Frieze, Eli Upfal: Efficient communication in an ad-hoc network. J. Algorithms 52(1): 1-7 (2004) | |
| 2003 | ||
| 2 | Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. RANDOM-APPROX 2003: 264-274 | |
| 1 | Abraham Flaxman: A spectral technique for random satisfiable 3CNF formulas. SODA 2003: 357-363 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page