The following pages link to Devdatt P. Dubhashi (Q287048):
Displaying 26 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- The fourth moment in Luby's distribution (Q672385) (← links)
- (Q1274332) (redirect page) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- A lower bound for area-universal graphs (Q1332765) (← links)
- Probabilistic recurrence relations revisited (Q1391296) (← links)
- Accelerated proximal incremental algorithm schemes for non-strongly convex functions (Q2297863) (← links)
- Localized techniques for broadcasting in wireless sensor networks (Q2471711) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- (Q2933958) (← links)
- Quantifier Elimination in p-adic Fields (Q3140552) (← links)
- Probabilistic analysis for a multiple depot vehicle routing problem (Q3419619) (← links)
- Positive Influence and Negative Dependence (Q3429739) (← links)
- A Note on Conditioning and Stochastic Domination for Order Statistics (Q3516429) (← links)
- On decidable varieties of Heyting algebras (Q4032876) (← links)
- (Q4268460) (← links)
- Simple proofs of occupancy tail bounds (Q4358431) (← links)
- (Q4471362) (← links)
- Balls and bins: A study in negative dependence (Q4705326) (← links)
- (Q4788598) (← links)
- (Probabilistic) recurrence relations revisited (Q5096333) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191515) (← links)
- A New Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity (Q5442982) (← links)
- Concentration of Measure for the Analysis of Randomized Algorithms (Q5891622) (← links)
- Concentration of Measure for the Analysis of Randomized Algorithms (Q5896979) (← links)
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897783) (← links)
