Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Sandeep
    Last name: Sen
    DBLP: s/SandeepSen
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 84  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Ragesh Jaiswal, Amit Kumar, Sandeep Sen.
    A simple D^2-sampling based PTAS for k-means and other Clustering Problems
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Sandeep Sen, V. N. Muralidhara.
    The covert set-cover problem with application to Network Discovery
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Neeraj Sharma, Sandeep Sen.
    Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Surender Baswana, Manoj Gupta, Sandeep Sen.
    Fully dynamic maximal matching in O(log n) update time
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Manoj Gupta, Yogish Sabharwal, Sandeep Sen.
    The update complexity of selection and related problems
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Manoj Gupta, Yogish Sabharwal, Sandeep Sen.
    The update complexity of selection and related problems.
    IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India 2011 (0) 2011
    Conference paper
    Surender Baswana, Manoj Gupta, Sandeep Sen.
    Fully Dynamic Maximal Matching in O (log n) Update Time.
    IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011 (0) 2011
    Conference paper
    Amit Kumar, Yogish Sabharwal, Sandeep Sen.
    Linear-time approximation schemes for clustering problems in any dimensions.
    J. ACM 2009, Volume 57 (0) 2010
    Conference paper
    Sandeep Sen, V. N. Muralidhara.
    The Covert Set-Cover Problem with Application to Network Discovery.
    WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Sandeep Sen.
    Approximating Shortest Paths in Graphs.
    WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings 2009 (0) 2009
    Show item 1 to 10 of 84  

    Your query returned 84 matches in the database.