Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Sen, Sandeep"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple
D^2
-sampling based PTAS for
k
-means and other clustering problems
Ragesh Jaiswal
,
Amit Kumar
,
Sandeep Sen
Algorithmica
70
(1), 2014, pp. 22-46
Maintaining approximate maximum weighted matching in fully dynamic graphs
Abhash Anand
,
Surender Baswana
,
Manoj Gupta
,
Sandeep Sen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 257-266
A simple
D^2
-sampling based PTAS for
k
-means and other clustering problems
Ragesh Jaiswal
,
Amit Kumar
,
Sandeep Sen
Lecture Notes in Computer Science
7434
, 2012, pp. 13-24
Efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model
Neeraj Sharma
,
Sandeep Sen
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 74-76
The update complexity of selection and related problems
Manoj Gupta
,
Yogish Sabharwal
,
Sandeep Sen
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 325-338
Linear-time approximation schemes for clustering problems in any dimensions
Amit Kumar
,
Yogish Sabharwal
,
Sandeep Sen
Journal of the ACM
57
(2), 2010, pp. 5: 1-32
All-pairs nearly 2-approximate shortest paths in
O(n^2
polylog
n)
time
Surender Baswana
,
Vishrut Goyal
,
Sandeep Sen
Theoretical Computer Science
410
(1), 2009, pp. 84-93
Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error
Surender Baswana
,
Akshay Gaur
,
Sandeep Sen
,
Jayant Upadhyay
Lecture Notes in Computer Science
5125
, 2008, pp. 609-621
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
Surender Baswana
,
Ramesh Hariharan
,
Sandeep Sen
J. Algorithms: Cognition, Informatics and Logic
62
(2), 2007, pp. 74-92
A linear time deterministic algorithm to find a small subset that approximates the centroid
Pratik Worah
,
Sandeep Sen
Information Processing Letters
105
(1), 2007, pp. 17-19
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
Yogish Sabharwal
,
Nishant Sharma
,
Sandeep Sen
Journal of Computer and System Sciences
72
(6), 2006, pp. 955-977
Causal closure for MSC languages
Bharat Adsul
,
Madhavan Mukund
,
K. Narayan Kumar
,
Vasumathi Narayanan
Lecture Notes in Computer Science
3821
, 2005, pp. 335-347
Proving lower bounds via pseudo-random generators
Manindra Agrawal
Lecture Notes in Computer Science
3821
, 2005, pp. 92-105
The directed planar reachability problem
Eric Allender
,
Samir Datta
,
Sambuddha Roy
Lecture Notes in Computer Science
3821
, 2005, pp. 238-249
Proofs of termination of rewrite systems for polytime functions
Toshiyasu Arai
,
Georg Moser
Lecture Notes in Computer Science
3821
, 2005, pp. 529-540
Probabilistic analysis for a multiple depot vehicle routing problem
Andreas Baltz
,
Devdatt Dubhashi
,
Libertad Tansini
,
Anand Srivastav
,
Sören Werth
Lecture Notes in Computer Science
3821
, 2005, pp. 360-371
All-pairs nearly 2-approximate shortest-paths in
O(n^2 polylog n)
time
Surender Baswana
,
Vishrut Goyal
,
Sandeep Sen
Lecture Notes in Computer Science
3404
, 2005, pp. 666-679
When are timed automata weakly timed bisimilar to time Petri nets?
Beatrice Bérard
,
Franck Cassez
,
Serge Haddad
,
Didier Lime
,
Olivier Roux
Lecture Notes in Computer Science
3821
, 2005, pp. 273-284
Reachability analysis of multithreaded software with asynchronous communication
Ahmed Bouajjani
,
Javier Esparza
,
Stefan Schwoon
,
Jan Strejc̑ek
Lecture Notes in Computer Science
3821
, 2005, pp. 348-359
On the expressiveness of TPTL and MTL
Patricia Bouyer
,
Fabrice Chevalier
,
Nicolas Markey
Lecture Notes in Computer Science
3821
, 2005, pp. 432-443
Computing the expected accumulated reward and gain for a subclass of infinite Markov chains
Tomás̑ Brázdil
,
Antonín Kuc̑era
Lecture Notes in Computer Science
3821
, 2005, pp. 372-383
Semiperfect-information games
Krishnendu Chatterjee
,
Thomas Henzinger
Lecture Notes in Computer Science
3821
, 2005, pp. 1-18
On the bisimulation congruence in
\chi
-calculus
Taolue Chen
,
Tingting Han
,
Jian Lu
Lecture Notes in Computer Science
3821
, 2005, pp. 128-139
Market equilibrium for CES exchange economies: Existence, multiplicity, and computation
Bruno Codenotti
,
Benton McCune
,
Sriram Penumatcha
,
Kasturi Varadarajan
Lecture Notes in Computer Science
3821
, 2005, pp. 505-516
Reasoning about quantum knowledge
Ellie D'Hondt
,
Prakash Panangaden
Lecture Notes in Computer Science
3821
, 2005, pp. 553-564
Seiten 1
2
3
4
>