| 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
SIAM Journal on Scientific Computing | 2013-06-26 | Paper |
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
Combinatorica | 2012-09-17 | Paper |
On the diameter of the set of satisfying assignments in random satisfiable \(k\)-CNF formulas
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Expansion and Lack Thereof in Randomly Perturbed Graphs
Internet Mathematics | 2011-06-21 | Paper |
First-passage percolation on a ladder graph, and the path cost in a VCG auction
Random Structures & Algorithms | 2011-05-11 | Paper |
Expansion and Lack Thereof in Randomly Perturbed Graphs
Internet Mathematics | 2011-02-28 | Paper |
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764885 (Why is no real title available?)
| 2010-08-06 | Paper |
High degree vertices and eigenvalues in the preferential attachment graph
Lecture Notes in Computer Science | 2010-05-26 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
A Geometric Preferential Attachment Model of Networks II
Internet Mathematics | 2009-04-28 | Paper |
Expansion and Lack Thereof in Randomly Perturbed Graphs
Algorithms and Models for the Web-Graph | 2008-08-19 | Paper |
A spectral technique for random satisfiable 3CNF formulas
Random Structures & Algorithms | 2008-07-21 | Paper |
A Geometric Preferential Attachment Model of Networks II
Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
Combinatorics, Probability and Computing | 2008-02-22 | Paper |
A Geometric Preferential Attachment Model of Networks
Internet Mathematics | 2007-08-20 | Paper |
Adversarial Deletion in a Scale-Free Random Graph Process
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms | 2007-07-18 | Paper |
Maximum matchings in regular graphs of high girth
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
The lower tail of the random minimum spanning tree
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Randomly coloring sparse random graphs with fewer colors than the maximum degree
Random Structures & Algorithms | 2007-02-07 | Paper |
On the random 2-stage minimum spanning tree
Random Structures & Algorithms | 2006-03-24 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Embracing the giant component
Random Structures & Algorithms | 2005-11-15 | Paper |
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
Internet Mathematics | 2005-10-27 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Efficient communication in an ad-hoc network
Journal of Algorithms | 2004-11-23 | Paper |
A sharp threshold for a random constraint satisfaction problem
Discrete Mathematics | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2079359 (Why is no real title available?)
| 2004-07-28 | Paper |
Strings with maximally many distinct subsequences and substrings
The Electronic Journal of Combinatorics | 2004-02-05 | Paper |
