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
Hilfe
Suche: Author="Seshadhri, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Self-improving algorithms for coordinatewise maxima and convex hulls
Kenneth L. Clarkson
,
Wolfgang Mulzer
,
C. Seshadhri
SIAM Journal on Computing
43
(2), 2014, pp. 617-653
Is submodularity testable?
C. Seshadhri
,
Jan Vondrák
Algorithmica
69
(1), 2014, pp. 1-25
A
o(n)
monotonicity tester for Boolean functions over the hypercube
Deeparnab Chakrabarty
,
C. Seshadhri
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 411-418
Optimal bounds for monotonicity and Lipschitz testing over hypercubes and hypergrids
Deeparnab Chakrabarty
,
C. Seshadhri
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 419-428
Noise tolerance of expanders and sublinear expansion reconstruction
Satyen Kale
,
Yuval Peres
,
C. Seshadhri
SIAM Journal on Computing
42
(1), 2013, pp. 305-323
From Sylvester-Gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits
Nitin Saxena
,
C. Seshadhri
Journal of the ACM
60
(5), 2013, pp. 33: 1-33
An in-depth analysis of stochastic Kronecker graphs
C. Seshadhri
,
Ali Pinar
,
Tamara G. Kolda
Journal of the ACM
60
(2), 2013, pp. 13: 1-32
Self-improving algorithms for coordinate-wise maxima
Kenneth L. Clarkson
,
Wolfgang Mulzer
,
C. Seshadhri
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 277-286
Blackbox identity testing for bounded top-fanin depth-3 circuits: The field doesn't matter
Nitin Saxena
,
C. Seshadhri
SIAM Journal on Computing
41
(5), 2012, pp. 1285-1298
Self-improving algorithms
Nir Ailon
,
Bernard Chazelle
,
Kenneth L. Clarkson
,
Ding Liu
,
Wolfgang Mulzer
,
C. Seshadhri
SIAM Journal on Computing
40
(2), 2011, pp. 350-375
Online geometric reconstruction
Bernard Chazelle
,
C. Seshadhri
Journal of the ACM
58
(4), 2011, pp. 14: 1-32
An expansion tester for bounded degree graphs
Satyen Kale
,
C. Seshadhri
SIAM Journal on Computing
40
(3), 2011, pp. 709-720
An almost optimal rank bound for depth-3 identities
Nitin Saxena
,
C. Seshadhri
SIAM Journal on Computing
40
(1), 2011, pp. 200-224
Blackbox identity testing for bounded top fanin depth-3 circuits: The field doesn't matter
Nitin Saxena
,
C. Seshadhri
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 431-439
Local monotonicity reconstruction
Michael Saks
,
C. Seshadhri
SIAM Journal on Computing
39
(7), 2010, pp. 2897-2926
An expansion tester for bounded degree graphs
Satyen Kale
,
C. Seshadhri
Lecture Notes in Computer Science
5125
, 2008, pp. 527-538