![]() | ![]() |
| 2011 | ||
|---|---|---|
| 30 | Srinivas Aluru, Sanghamitra Bandyopadhyay, Ümit V. Çatalyürek, Devdatt P. Dubhashi, Phillip H. Jones, Manish Parashar, Bertil Schmidt: Contemporary Computing - 4th International Conference, IC3 2011, Noida, India, August 8-10, 2011. Proceedings Springer 2011 | |
| 2009 | ||
| 29 | Devdatt P. Dubhashi, Alessandro Panconesi: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press 2009: I-XIV, 1-196 | |
| 2008 | ||
| 28 | Devdatt P. Dubhashi: Distributed Vertex Coloring. Encyclopedia of Algorithms 2008 | |
| 27 | Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Devdatt P. Dubhashi: Adaptive Dynamics of Realistic Small-World Networks CoRR abs/0804.1115: (2008) | |
| 2007 | ||
| 26 | Devdatt P. Dubhashi, Olle Häggström, Lorenzo Orecchia, Alessandro Panconesi, Chiara Petrioli, Andrea Vitaletti: Localized Techniques for Broadcasting in Wireless Sensor Networks. Algorithmica 49(4): 412-446 (2007) | |
| 25 | Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan: Positive Influence and Negative Dependence. Combinatorics, Probability & Computing 16(1): 29-41 (2007) | |
| 24 | Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth: Probabilistic analysis for a multiple depot vehicle routing problem. Random Struct. Algorithms 30(1-2): 206-225 (2007) | |
| 23 | Devdatt P. Dubhashi, Olle Häggström, Gabriele Mambrini, Alessandro Panconesi, Chiara Petrioli: Blue pleiades, a new solution for device discovery and scatternet formation in multi-hop Bluetooth networks. Wireless Networks 13(1): 107-125 (2007) | |
| 2006 | ||
| 22 | Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi: Randomization in Constraint Programming for Airline Planning. CP 2006: 406-420 | |
| 21 | Daniel Dalevi, Devdatt P. Dubhashi, Malte Hermansson: Bayesian classifiers for detecting HGT using fixed and variable order markov models of genomic signatures. Bioinformatics 22(5): 517-522 (2006) | |
| 2005 | ||
| 20 | Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS 2005: 360-371 | |
| 19 | Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio: Irrigating ad hoc networks in constant time. SPAA 2005: 106-115 | |
| 18 | Daniel Dalevi, Devdatt P. Dubhashi: The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity. WABI 2005: 291-302 | |
| 17 | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J. Comput. Syst. Sci. 71(4): 467-479 (2005) | |
| 2003 | ||
| 16 | Devdatt P. Dubhashi, Luigi Laura, Alessandro Panconesi: Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract. FSTTCS 2003: 168-182 | |
| 15 | Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. SODA 2003: 717-724 | |
| 1998 | ||
| 14 | Devdatt P. Dubhashi: Martingales and Locality in Distributed Computing. FSTTCS 1998: 174-185 | |
| 13 | Devdatt P. Dubhashi: Talagrand's Inequality and Locality in Distributed Computing. RANDOM 1998: 60-70 | |
| 12 | Devdatt P. Dubhashi, Desh Ranjan: Balls and bins: A study in negative dependence. Random Struct. Algorithms 13(2): 99-124 (1998) | |
| 11 | Devdatt P. Dubhashi, David A. Grable, Alessandro Panconesi: Near-Optimal, Distributed Edge Colouring via the Nibble Method. Theor. Comput. Sci. 203(2): 225-251 (1998) | |
| 1997 | ||
| 10 | Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997) | |
| 9 | Devdatt P. Dubhashi: Simple proofs of occupancy tail bounds. Random Struct. Algorithms 11(2): 119-123 (1997) | |
| 8 | Shiva Chaudhuri, Devdatt P. Dubhashi: Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181(1): 45-56 (1997) | |
| 1995 | ||
| 7 | Devdatt P. Dubhashi, Alessandro Panconesi: Near-Optimal Distributed Edge Coloring. ESA 1995: 448-459 | |
| 6 | Shiva Chaudhuri, Devdatt P. Dubhashi: (Probabilistic) Recurrence Realtions Revisited. LATIN 1995: 207-219 | |
| 5 | Devdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis: The Fourth Moment in Luby's Distribution. Theor. Comput. Sci. 148(1): 133-140 (1995) | |
| 1994 | ||
| 4 | Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn: A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) | |
| 1993 | ||
| 3 | Devdatt P. Dubhashi, Kurt Mehlhorn, Desh Ranjan, Christian Thiel: Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets. FSTTCS 1993: 436-443 | |
| 2 | Devdatt P. Dubhashi: Quantifier Elimination in p-adic Fields. Comput. J. 36(5): 419-426 (1993) | |
| 1992 | ||
| 1 | Devdatt P. Dubhashi: On Decidable Varieties of Heyting Algebras. J. Symb. Log. 57(3): 988-991 (1992) | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page