Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Sandeep Sen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yogish Sabharwal

> Home > Persons > Sandeep Sen

Publications

2021
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/dcc/BanchhorGSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/BanchhorGSS21
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Efficient algorithms for decode efficient prefix codes. DCC 2021: 338
[c49]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/BanchhorGSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/BanchhorGSS21
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. FSTTCS 2021: 8:1-8:23
2020
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/dcc/BanchhorGSS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/BanchhorGSS20
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Decode-Efficient Prefix Codes for Hierarchical Memory Models. DCC 2020: 360
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2010-05005
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2010-05005
Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Decode efficient prefix codes. CoRR abs/2010.05005 (2020)
2016
[j43]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/GuptaSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GuptaSS16
Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The Update Complexity of Selection and Related Problems. Theory Comput. Syst. 59(1): 112-132 (2016)
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GoerigkSSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GoerigkSSS16
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Improvable Knapsack Problems. CoRR abs/1607.08338 (2016)
2014
[c44]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/GoerigkSSS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/GoerigkSSS14
Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Approximation Algorithms for the Weight-Reducible Knapsack Problem. TAMC 2014: 203-215
2011
[c39]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/GuptaSS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/GuptaSS11
Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. FSTTCS 2011: 325-338
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1108-5525
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1108-5525
Manoj Gupta, Yogish Sabharwal, Sandeep Sen:
The update complexity of selection and related problems. CoRR abs/1108.5525 (2011)
2010
[j37]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/KumarSS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KumarSS10
Amit Kumar, Yogish Sabharwal, Sandeep Sen:
Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2): 5:1-5:32 (2010)
2006
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/SabharwalSS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/SabharwalSS06
Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. J. Comput. Syst. Sci. 72(6): 955-977 (2006)
2005
[j27]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/comgeo/SabharwalS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/SabharwalS05
Yogish Sabharwal, Sandeep Sen:
A linear time algorithm for approximate 2-means clustering. Comput. Geom. 32(2): 159-172 (2005)
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/KumarSS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/KumarSS05
Amit Kumar, Yogish Sabharwal, Sandeep Sen:
Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP 2005: 1374-1385
2004
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/KumarSS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/KumarSS04
Amit Kumar, Yogish Sabharwal, Sandeep Sen:
A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS 2004: 454-462
2002
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/fsttcs/SabharwalSS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/SabharwalSS02
Yogish Sabharwal, Nishant Sharma, Sandeep Sen:
Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions. FSTTCS 2002: 311-323

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.