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="Mahajan, Meena"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Homomorphism polynomials complete for VP
Arnaud Durand
,
Meena Mahajan
,
Guillaume Malod
,
Nicolas de Rugy-Altherre
,
Nitin Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 493-504
Building above read-once polynomials: Identity testing and hardness of representation
Meena Mahajan
,
B.V. Raghavendra Rao
,
Karteek Sreenivasaiah
Lecture Notes in Computer Science
8591
, 2014, pp. 1-12
Monomials, multilinearity and identity testing in simple read-restricted circuits
Meena Mahajan
,
B.V. Raghavendra Rao
,
Karteek Sreenivasaiah
Theoretical Computer Science
524
, 2014, pp. 90-102
Comments on arithmetic complexity, Kleene closure, and formal power series
Eric Allender
,
V. Arvind
,
Meena Mahajan
Theory of Computing Systems
53
(3), 2013, pp. 503-506
Small depth proof systems
Andreas Krebs
,
Nutan Limaye
,
Meena Mahajan
,
Karteek Sreenivasaiah
Lecture Notes in Computer Science
8087
, 2013, pp. 583-594
Counting classes and the fine structure between NC
^1
and L
Samir Datta
,
Meena Mahajan
,
B.V. Raghavendra Rao
,
Michael Thomas
,
Heribert Vollmer
Theoretical Computer Science
417
, 2012, pp. 36-49
Counting paths in VPA is complete for \#NC
^1
Andreas Krebs
,
Nutan Limaye
,
Meena Mahajan
Algorithmica
64
(2), 2012, pp. 279-294
The complexity of unary subset sum
Nutan Limaye
,
Meena Mahajan
,
Karteek Sreenivasaiah
Lecture Notes in Computer Science
7434
, 2012, pp. 458-469
The planar
k
-means problem is NP-hard
Meena Mahajan
,
Prajakta Nimbhorkar
,
Kasturi Varadarajan
Theoretical Computer Science
442
, 2012, pp. 13-21
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs
Meena Mahajan
,
B.V. Raghavendra Rao
,
Karteek Sreenivasaiah
Lecture Notes in Computer Science
7464
, 2012, pp. 655-667
Verifying proofs in constant depth
Olaf Beyersdorff
,
Samir Datta
,
Meena Mahajan
,
Gido Scharfenberger-Fabian
,
Karteek Sreenivasaiah
,
Michael Thomas
,
Heribert Vollmer
Lecture Notes in Computer Science
6907
, 2011, pp. 84-95
Model checking time-constrained scenario-based specifications
S. Akshay
,
Paul Gastin
,
Madhavan Mukund
,
K. Narayan Kumar
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 204-215
Expressiveness of streaming string transducers
Rajeev Alur
,
Pavol C̑erný
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 1-12
Colored hypergraph isomorphism is fixed parameter tractable
V. Arvind
,
Bireswar Das
,
Johannes Köbler
,
Seinosuke Toda
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 327-337
Two size measures for timed languages
Eugene Asarin
,
Aldric Degorre
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 376-387
Global model checking of ordered multi-pushdown systems
Mohamed Faouzi Atig
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 216-227
Computationally sound abstraction and verification of secure multi-party computations
Michael Backes
,
Matteo Maffei
,
Esfandiar Mohammadi
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 352-363
Finding sparser directed spanners
Piotr Berman
,
Sofya Raskhodnikova
,
Ge Ruan
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 424-435
Parityizing Rabin and Streett
Udi Boker
,
Orna Kupferman
,
Avital Steinitz
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 412-423
Place-boundedness for vector addition systems with one zero-test
Rémi Bonnet
,
Alain Finkel
,
Jérôme Leroux
,
Marc Zeitoun
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 192-203
One-counter stochastic games
Tomás̑ Brázdil
,
Václav Broz̑ek
,
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 108-119
Global escape in multiparty sessions
Sara Capecchi
,
Elena Giachino
,
Nobuko Yoshida
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 338-351
Model checking concurrent programs with nondeterminism and randomization
Rohit Chadha
,
A. Prasad Sistla
,
Mahesh Viswanathan
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 364-375
Lower bounds for Quantum Oblivious Transfer
André Chailloux
,
Iordanis Kerenidis
,
Jamie Sikora
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 157-168
A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
Venkatesan T. Chakaravarthy
,
Anamitra R. Choudhury
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 181-191
Seiten 1
2
3
4
5
6
>