The following pages link to Abraham D. Flaxman (Q452815):
Displaying 36 items.
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Maximum matchings in regular graphs of high girth (Q870087) (← links)
- The lower tail of the random minimum spanning tree (Q870089) (← links)
- (Q1422148) (redirect page) (← links)
- Strings with maximally many distinct subsequences and substrings (Q1422149) (← links)
- A sharp threshold for a random constraint satisfaction problem (Q1877674) (← links)
- (Q2921681) (← links)
- (Q2921693) (← links)
- (Q2921759) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas (Q3094942) (← links)
- On the random 2-stage minimum spanning tree (Q3376662) (← links)
- Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603) (← links)
- A spectral technique for random satisfiable 3CNF formulas (Q3514702) (← links)
- (Q3579478) (← links)
- On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (Q3581403) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q3622691) (← links)
- (Q4471318) (← links)
- Efficient communication in an ad-hoc network (Q4828561) (← links)
- Adversarial Deletion in a Scale-Free Random Graph Process (Q5295413) (← links)
- The diameter of randomly perturbed digraphs and some applications (Q5297137) (← links)
- A Statistical Model and Estimation of Disease Rates as Functions of Age and Time (Q5300148) (← links)
- Algorithms and Models for the Web-Graph (Q5311173) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313038) (← links)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem (Q5443801) (← links)
- Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet (Q5458296) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q5458299) (← links)
- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph (Q5700145) (← links)
- Embracing the giant component (Q5704836) (← links)
- STACS 2005 (Q5710684) (← links)
- A Geometric Preferential Attachment Model of Networks (Q5755204) (← links)
- Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5892544) (← links)
- Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5894137) (← links)
- Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5900217) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900939) (← links)
- LATIN 2004: Theoretical Informatics (Q5901627) (← links)
