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="Kannan, Ravi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing a nonnegative matrix factorization - provably
Sanjeev Arora
,
Rong Ge
,
Ravindran Kannan
,
Ankur Moitra
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 145-162
Zero-one rounding of singular vectors
Amit Deshpande
,
Ravindran Kannan
,
Nikhil Srivastava
Lecture Notes in Computer Science
7391
, 2012, pp. 278-289
Spectral methods for matrices and tensors
Ravindran Kannan
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 1-12
Mediating for reduction (on minimizing alternating Büchi automata)
Parosh A. Abdulla
,
Yu-Fang Chen
,
Lukas̑ Holík
,
Tomás̑ Vojnar
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 1-12
Algorithms for message ferrying on mobile ad hoc networks
Mostafa Ammar
,
Deeparnab Chakrabarty
,
Atish Das Sarma
,
Subrahmanyam Kalyanasundaram
,
Richard J. Lipton
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 13-24
Arithmetic circuits and the Hadamard product of polynomials
Vikraman Arvind
,
Pushkar S. Joglekar
,
Srikanth Srinivasan
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 25-36
Kernels for feedback arc set in tournaments
Stéphane Bessy
,
Fedor V. Fomin
,
Serge Gaspers
,
Christophe Paul
,
Anthony Perez
,
Saket Saurabh
,
Stéphan Thomassé
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 37-47
Deterministic automata and extensions of weak MSO
Mikoƚaj Bojańczyk
,
Szymon Toruńczyk
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 73-84
On timed alternating simulation for concurrent timed games
Laura Bozzelli
,
Axel Legay
,
Sophie Pinchinat
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 85-96
Covering of ordinals
Laurent Braud
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 97-108
Fractional pebbling and thrifty branching programs
Mark Braverman
,
Cook Stephen
,
Pierre McKenzie
,
Rahul Santhanam
,
Dustin Wehr
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 109-120
On the memory consumption of probabilistic pushdown automata
Tomás̑ Brázdil
,
Javier Esparza
,
Stefan Kiefer
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 49-60
Continuous-time stochastic games with time-bounded reachability
Tomás̑ Brázdil
,
Vojtech Forejt
,
Jan Krc̑ál
,
Jan Kȓetínský
,
Kuc̑era Antonin
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 61-72
The Wadge hierarchy of max-regular languages
Jérémie Cabessa
,
Jacques Duparc
,
Alessandro Facchini
,
Filip Murlak
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 121-132
Pass-efficient algorithms for learning mixtures of uniform distributions
Kevin L. Chang
,
Ravi Kannan
SIAM Journal on Computing
39
(3), 2009, pp. 783-812
Automata and temporal logic over arbitrary linear time
Julien Cristau
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 133-144
Graph isomorphism for
K_{3,3}
-free and
K_5
-free graphs is in log-space
Samir Datta
,
Prajakta Nimbhorkar
,
Thomas Thierauf
,
Fabian Wagner
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 145-156
Domination problems in nowhere-dense classes
Anuj Dawar
,
Stephan Kreutzer
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 157-168
Structure and specification as sources of complexity
Anuj Dawar
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 407-416
Simulation based security in the applied pi calculus
Stéphanie Delaune
,
Steve Kremer
,
Olivier Pereira
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 169-180
The covering and boundedness problems for branching vector addition systems
Stéphane Demri
,
Marcin Jurdziński
,
Oded Lachish
,
Ranko Lazić
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 181-192
Subexponential algorithms for partial cover problems
Fedor V. Fomin
,
Daniel Lokshtanov
,
Venkatesh Raman
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 193-201
On the tightening of the standard SDP for vertex cover with
l_1
inequalities
Konstantinos Georgiou
,
Avner Magen
,
Iannis Tourlakis
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 203-214
Kolmogorov complexity in randomness extraction
John M. Hitchcock
,
Aduri Pavan
,
N.V. Vinodchandran
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 215-226
Donation center location problem
Chien-Chung Huang
,
Zoya Svitkina
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 227-238
Seiten 1
2
3
4
5
>