Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Devdatt P. Dubhashi
Author information
- affiliation: Chalmers University of Technology, Department of Computer Science and Engineering
2010 – today
- 2012
[c13]Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt P. Dubhashi: "The Lovasz $\theta$ function, SVMs and finding large dense subgraphs". NIPS 2012: 1169-1177- 2011
- [j16]Vinay Jethava, Chiranjib Bhattacharyya, Devdatt P. Dubhashi, Goutham N. Vemuri: NETGEM: Network Embedded Temporal GEnerative Model for gene expression data. BMC Bioinformatics 12: 327 (2011)
- [c12]Vinay Jethava, Liliana Calderón-Benavides, Ricardo A. Baeza-Yates, Chiranjib Bhattacharyya, Devdatt P. Dubhashi: Scalable multi-dimensional user intent identification using tree structured distributions. SIGIR 2011: 395-404
- [e1]Srinivas Aluru, Sanghamitra Bandyopadhyay, Ümit V. Çatalyürek, Devdatt P. Dubhashi, Phillip H. Jones, Manish Parashar, Bertil Schmidt (Eds.): Contemporary Computing - 4th International Conference, IC3 2011, Noida, India, August 8-10, 2011. Proceedings. Communications in Computer and Information Science 168, Springer 2011, ISBN 978-3-642-22605-2
2000 – 2009
- 2009
- [b1]Devdatt P. Dubhashi, Alessandro Panconesi: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press 2009, ISBN 978-0-521-88427-3, pp. I-XIV, 1-196
- 2008
- [r1]
- [i1]Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Devdatt P. Dubhashi: Adaptive Dynamics of Realistic Small-World Networks. CoRR abs/0804.1115 (2008)
- 2007
- [j15]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)
- [j14]Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan: Positive Influence and Negative Dependence. Combinatorics, Probability & Computing 16(1): 29-41 (2007)
- [j13]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)
- [j12]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
- [j11]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)
- [c11]Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi: Randomization in Constraint Programming for Airline Planning. CP 2006: 406-420
- 2005
- [j10]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)
- [c10]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
- [c9]Devdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio: Irrigating ad hoc networks in constant time. SPAA 2005: 106-115
- [c8]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
- 2003
- [c7]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
- [c6]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
1990 – 1999
- 1998
- [j9]Devdatt P. Dubhashi, Desh Ranjan: Balls and bins: A study in negative dependence. Random Struct. Algorithms 13(2): 99-124 (1998)
- [j8]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)
- [c5]
- [c4]Devdatt P. Dubhashi: Talagrand's Inequality and Locality in Distributed Computing. RANDOM 1998: 60-70
- 1997
- [j7]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)
- [j6]Devdatt P. Dubhashi: Simple proofs of occupancy tail bounds. Random Struct. Algorithms 11(2): 119-123 (1997)
- [j5]Shiva Chaudhuri, Devdatt P. Dubhashi: Probabilistic Recurrence Relations Revisited. Theor. Comput. Sci. 181(1): 45-56 (1997)
- 1995
- [j4]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)
- [c3]Devdatt P. Dubhashi, Alessandro Panconesi: Near-Optimal Distributed Edge Coloring. ESA 1995: 448-459
- [c2]Shiva Chaudhuri, Devdatt P. Dubhashi: (Probabilistic) Recurrence Realtions Revisited. LATIN 1995: 207-219
- 1994
- [j3]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
- [j2]
- [c1]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
- 1992
- [j1]Devdatt P. Dubhashi: On Decidable Varieties of Heyting Algebras. J. Symb. Log. 57(3): 988-991 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team