2008 |
35 | EE | Matthew Cary,
Abraham D. Flaxman,
Jason D. Hartline,
Anna R. Karlin:
Auctions for structured procurement.
SODA 2008: 304-313 |
34 | EE | 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 |
33 | EE | Abraham Flaxman:
Random Planted 3-SAT.
Encyclopedia of Algorithms 2008 |
32 | EE | 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) |
31 | EE | Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas.
Random Struct. Algorithms 32(4): 519-534 (2008) |
2007 |
30 | EE | Abraham D. Flaxman,
Juan Vera:
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet.
WAW 2007: 1-15 |
29 | EE | Abraham D. Flaxman,
Alan M. Frieze,
Juan Vera:
A Geometric Preferential Attachment Model of Networks II.
WAW 2007: 41-55 |
28 | EE | 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) |
27 | EE | 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) |
26 | EE | Abraham D. Flaxman,
Shlomo Hoory:
Maximum Matchings in Regular Graphs of High Girth.
Electr. J. Comb. 14(1): (2007) |
25 | EE | Abraham D. Flaxman:
The Lower Tail of the Random Minimum Spanning Tree.
Electr. J. Comb. 14(1): (2007) |
24 | | Abraham D. Flaxman,
Alan M. Frieze,
Juan Vera:
A Geometric Preferential Attachment Model of Networks.
Internet Mathematics 3(2): (2007) |
23 | EE | 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 | EE | Haifeng Yu,
Michael Kaminsky,
Phillip B. Gibbons,
Abraham Flaxman:
SybilGuard: defending against sybil attacks via social networks.
SIGCOMM 2006: 267-278 |
21 | EE | Abraham D. Flaxman:
Expansion and Lack Thereof in Randomly Perturbed Graphs.
WAW 2006: 24-35 |
20 | EE | 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 | EE | 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 | EE | 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 | EE | Abraham Flaxman,
Alan M. Frieze,
Juan Vera:
Adversarial deletion in a scale free random graph process.
SODA 2005: 287-292 |
16 | EE | 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 | EE | Abraham D. Flaxman,
Alan M. Frieze,
Michael Krivelevich:
On the random 2-stage minimum spanning tree.
SODA 2005: 919-926 |
14 | EE | Abraham Flaxman,
Bartosz Przydatek:
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time.
STACS 2005: 305-314 |
13 | EE | 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 | EE | 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): (2005) |
10 | EE | Abraham D. Flaxman,
David Gamarnik,
Gregory B. Sorkin:
Embracing the giant component.
Random Struct. Algorithms 27(3): 277-289 (2005) |
2004 |
9 | EE | Abraham Flaxman,
Alan M. Frieze:
The Diameter of Randomly Perturbed Digraphs and Some Applications..
APPROX-RANDOM 2004: 345-356 |
8 | EE | Abraham Flaxman,
David Gamarnik,
Gregory B. Sorkin:
Embracing the Giant Component.
LATIN 2004: 69-79 |
7 | EE | Abraham Flaxman,
Alan M. Frieze,
Juan Vera:
A Geometric Preferential Attachment Model of Networks.
WAW 2004: 44-55 |
6 | EE | 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 | EE | Abraham Flaxman:
A sharp threshold for a random constraint satisfaction problem.
Discrete Mathematics 285(1-3): 301-305 (2004) |
4 | EE | Abraham Flaxman,
Aram Wettroth Harrow,
Gregory B. Sorkin:
Strings with Maximally Many Distinct Subsequences and Substrings.
Electr. J. Comb. 11(1): (2004) |
3 | EE | Abraham Flaxman,
Alan M. Frieze,
Eli Upfal:
Efficient communication in an ad-hoc network.
J. Algorithms 52(1): 1-7 (2004) |
2003 |
2 | EE | Abraham Flaxman,
Alan M. Frieze,
Trevor I. Fenner:
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.
RANDOM-APPROX 2003: 264-274 |
1 | EE | Abraham Flaxman:
A spectral technique for random satisfiable 3CNF formulas.
SODA 2003: 357-363 |