Abraham D. Flaxman

Available identifiers

zbMath Open flaxman.abraham-dWikidataQ61089796 ScholiaQ61089796MaRDI QIDQ452815

List of research outcomes

Publication	Date of Publication	Type
Online convex optimization in the bandit setting: gradient descent without a gradient	2014-10-13	Paper
Adversarial deletion in a scale free random graph process	2014-10-13	Paper
On the random 2-stage minimum spanning tree	2014-10-13	Paper
A Statistical Model and Estimation of Disease Rates as Functions of Age and Time	2013-06-26	Paper
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks	2012-09-17	Paper
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas	2011-10-27	Paper
Expansion and Lack Thereof in Randomly Perturbed Graphs	2011-06-21	Paper
First-passage percolation on a ladder graph, and the path cost in a VCG auction	2011-05-11	Paper
Expansion and Lack Thereof in Randomly Perturbed Graphs	2011-02-28	Paper
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3579478	2010-08-06	Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques	2010-05-26	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
A Geometric Preferential Attachment Model of Networks II	2009-04-28	Paper
Expansion and Lack Thereof in Randomly Perturbed Graphs	2008-08-19	Paper
A spectral technique for random satisfiable 3CNF formulas	2008-07-21	Paper
A Geometric Preferential Attachment Model of Networks II	2008-04-11	Paper
Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet	2008-04-11	Paper
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem	2008-02-22	Paper
A Geometric Preferential Attachment Model of Networks	2007-08-20	Paper
Adversarial Deletion in a Scale-Free Random Graph Process	2007-07-30	Paper
The diameter of randomly perturbed digraphs and some applications	2007-07-18	Paper
Maximum matchings in regular graphs of high girth	2007-03-12	Paper
The lower tail of the random minimum spanning tree	2007-03-12	Paper
Randomly coloring sparse random graphs with fewer colors than the maximum degree	2007-02-07	Paper
On the random 2-stage minimum spanning tree	2006-03-24	Paper
STACS 2005	2005-12-02	Paper
Embracing the giant component	2005-11-15	Paper
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph	2005-10-27	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper
Algorithms and Models for the Web-Graph	2005-08-22	Paper
Efficient communication in an ad-hoc network	2004-11-23	Paper
A sharp threshold for a random constraint satisfaction problem	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4471318	2004-07-28	Paper
Strings with maximally many distinct subsequences and substrings	2004-02-05	Paper

Research outcomes over time

This page was built for person: Abraham D. Flaxman