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="Sarma, Jayalal"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial min/max-weighted reachability is in unambiguous log-space
Anant Dhayal
,
Jayalal Sarma
,
Saurabh Sawlani
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 597-609
Balancing bounded treewidth circuits
Maurice Jansen
,
Jayalal Sarma
Theory of Computing Systems
54
(2), 2014, pp. 318-336
Depth lower bounds against circuits with sparse orientation
Sajin Koroth
,
Jayalal Sarma
Lecture Notes in Computer Science
8591
, 2014, pp. 596-607
Pebbling, entropy and branching program size lower bounds
Balagopal Komarath
,
Jayalal M.N. Sarma
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 622-633
Isomorphism testing of read-once functions and polynomials
B.V. Raghavendra Rao
,
Jayalal M.N. Sarma
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 115-126
Limiting negations in bounded treewidth and upward planar circuits
Jing He
,
Hongyu Liang
,
Jayalal M.N. Sarma
Lecture Notes in Computer Science
6281
, 2010, pp. 417-428
On the complexity of matrix rank and rigidity
Meena Mahajan
,
Jayalal M.N. Sarma
Theory of Computing Systems
46
(1), 2010, pp. 9-26