abie's Flaxman:AD [14 articles] Export

Recent papers posted to abie's library by the author Flaxman:AD. You can also see everyone's Flaxman:AD.

	Randomly coloring sparse random graphs with fewer colors than the maximum degree [My Copy] Random Struct. Algorithms, Vol. 29, No. 4. (December 2006), pp. 450-465. by Martin Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda posted to no-tag by abie on 2007-06-05 20:01:06 as
	On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 441-449. by Abraham D. Flaxman, Alan M. Frieze, Juan C. Vera posted to analysis average case facility geometric graphs location np-hard optimization random by abie on 2007-06-05 02:27:33 as
	Solving Medium-Density Subset Sum Problems in Expected Polynomial Time [My Copy] STACS 2005 (2005), pp. 305-314. by Abraham D. Flaxman, Bartosz Przydatek posted to analysis average case instances random subset sum by abie on 2007-05-23 23:56:36 as
	A Geometric Preferential Attachment Model of Networks [My Copy] Algorithms and Models for the Web-Graph (2004), pp. 44-55. by Abraham D. Flaxman, Alan M. Frieze, Juan Vera posted to attachment diameter geometric law power preferential by abie on 2007-05-23 23:53:04 as
	Online convex optimization in the bandit setting: gradient descent without a gradient [My Copy] In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 385-394. by Abraham D. Flaxman, Adam T. Kalai, Brendan H. Mcmahan posted to and approximation convex descent exploit explore gradient online optimization perturbation simultaneous stochastic by abie on 2007-05-22 23:29:09 as along with 3 people idlebrain neddimitrov hrishi
	Adversarial deletion in a scale free random graph process [My Copy] In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (2005), pp. 287-292. by Abraham D. Flaxman, Alan M. Frieze, Juan Vera posted to adversarial attachment deletion free graph preferential random scale by abie on 2007-05-19 00:11:16 as
	The Diameter of Randomly Perturbed Digraphs and Some Applications [My Copy] Approximation, Randomization, and Combinatorial Optimization (2004), pp. 345-356. by Abraham D. Flaxman, Alan M. Frieze posted to algorithm analysis diameter digraphs graphs log perturbed randomly smoothed space by abie on 2007-05-17 15:37:16 as
	On the random 2-stage minimum spanning tree [My Copy] Random Structures and Algorithms, Vol. 28, No. 1. (2006), pp. 24-36. by Abraham D. Flaxman, Alan Frieze, Michael Krivelevich posted to minimum programming random spanning stage stochastic tree two by abie on 2007-05-17 15:30:11 as
	The Diameter of Randomly Perturbed Digraphs and Some Applications [My Copy] by Abraham D. Flaxman, Alan M. Frieze posted to algorithm analysis diameter digraphs graphs log perturbed randomly smoothed space by abie on 2007-05-16 19:52:22 as
	Embracing the giant component [My Copy] Random Structures and Algorithms, Vol. 27, No. 3. (2005), pp. 277-289. by Abraham D. Flaxman, David Gamarnik, Gregory B. Sorkin posted to achlioptas algorithms component giant graphs online process random threshold by abie on 2007-05-16 19:43:12 as
	A sharp threshold for a random constraint satisfaction problem [My Copy] Discrete Mathematics, Vol. 285, No. 1-3. (6 August 2004), pp. 301-305. by Abraham D. Flaxman posted to csp random structures by abie on 2007-05-11 23:15:25 as
	A sharp threshold for a random constraint satisfaction problem [My Copy] Discrete Math., Vol. 285, No. 1-3. (2004), pp. 301-305. by Abraham D. Flaxman posted to csp k-sat random satisfiability by abie on 2007-05-11 23:13:28 as
	Randomly coloring sparse random graphs with fewer colors than the maximum degree [My Copy] Random Structures Algorithms, Vol. 29, No. 4. (2006), pp. 450-465. by Martin Dyer, Abraham D. Flaxman, Alan M. Frieze, Eric Vigoda posted to coloring by abie on 2007-05-10 19:06:13 as
	Online convex optimization in the bandit setting: gradient descent without a gradient [My Copy] (2 Aug 2004) by Abraham D. Flaxman, Adam T. Kalai, Brendan H. Mcmahan posted to no-tag by abie on 2007-05-10 18:50:34 as along with 1 person gagliol

Note: You may cite this page as: http://www.citeulike.org/user/abie/author/Flaxman:AD

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

bibtex-import	20
random	10
algorithm	5
graph	5
graphs	5
analysis	4
diameter	4
attachment	3
geometric	3
preferential	3
randomly	3
streaming	3
ad-hoc	2
average	2
case	2
coloring	2
communication	2
csp	2
degree	2
digraphs	2
dust	2
free	2
law	2
log	2
online	2
optimization	2
percolation	2
perturbed	2
power	2
satisfiability	2
scale	2
smoothed	2
space	2
spectral	2
stochastic	2
threshold	2
3	1
achlioptas	1
adversarial	1
albert	1
algorithms	1
and	1
approximation	1
auction	1
barabasi	1
bound	1
component	1
convex	1
critical	1
decompositions	1
deletion	1
descent	1
distinct	1
distribution	1
drawing	1
eigenvalue	1
exploit	1
explore	1
facility	1
factors	1
first-passage	1
giant	1
gradient	1
instances	1
k-sat	1
location	1
lower	1
major-breakthrough	1
maximum	1
minimum	1
model	1
network	1
networks	1
np-hard	1
path	1
pertubed	1
perturbation	1
process	1
programming	1
sat	1
semi-streaming	1
sensor	1
sequences	1
simultaneous	1
smart	1
spanning	1
stage	1
string	1
structures	1
subsequence	1
subset	1
substring	1
substrings	1
sum	1
tree	1
two	1
vcg	1

abie's Flaxman:AD [14 articles] Export

abie's tags