The SCEAS System
| |||||||

## Search the dblp DataBase
Abraham Flaxman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Abraham Flaxman, Alan M. Frieze
**The Diameter of Randomly Perturbed Digraphs and Some Applications..**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2004, pp:345-356 [Conf] - Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
**Embracing the Giant Component.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:69-79 [Conf] - Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner
**High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:264-274 [Conf] - Haifeng Yu, Michael Kaminsky, Phillip B. Gibbons, Abraham Flaxman
**SybilGuard: defending against sybil attacks via social networks.**[Citation Graph (0, 0)][DBLP] SIGCOMM, 2006, pp:267-278 [Conf] - Abraham Flaxman
**A spectral technique for random satisfiable 3CNF formulas.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:357-363 [Conf] - Abraham Flaxman, Alan M. Frieze, Juan Vera
**Adversarial deletion in a scale free random graph process.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:287-292 [Conf] - Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
**Online convex optimization in the bandit setting: gradient descent without a gradient.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:385-394 [Conf] - Abraham Flaxman, Bartosz Przydatek
**Solving Medium-Density Subset Sum Problems in Expected Polynomial Time.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:305-314 [Conf] - Abraham Flaxman, Alan M. Frieze, Juan C. Vera
**On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:441-449 [Conf] - Abraham Flaxman, Alan M. Frieze, Juan Vera
**A Geometric Preferential Attachment Model of Networks.**[Citation Graph (0, 0)][DBLP] WAW, 2004, pp:44-55 [Conf] - Uriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg
**On the Competitive Ratio of the Random Sampling Auction.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:878-886 [Conf] - Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
**First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction.**[Citation Graph (0, 0)][DBLP] WINE, 2006, pp:99-111 [Conf] - Abraham Flaxman, Aram Wettroth Harrow, Gregory B. Sorkin
**Strings with Maximally Many Distinct Subsequences and Substrings.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
**Online convex optimization in the bandit setting: gradient descent without a gradient**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Abraham Flaxman
**A sharp threshold for a random constraint satisfaction problem.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:285, n:1-3, pp:301-305 [Journal] - Abraham Flaxman, Alan M. Frieze, Eli Upfal
**Efficient communication in an ad-hoc network.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:52, n:1, pp:1-7 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |