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
[2]
Hilfe
Suche: Author="Thathachar, Jayram S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-space tradeoffs for branching programs
Paul Beame
,
Michael Saks
,
Jayram S. Thathachar
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 254-263
Time-space tradeoffs for branching programs
Paul Beame
,
Michael Saks
,
Jayram S. Thathachar
Technical Report (TR98-053), 1998, September
On separating the read-
k
-times branching program hierarchy
Jayram S. Thathachar
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 653-662
Efficient oblivious branching programs for threshold and mod functions
Rakesh Kumar Sinha
,
Jayram S. Thathachar
Journal of Computer and System Sciences
55
(3), 1997, pp. 373-384
Efficient oblivious branching programs for threshold functions
Rakesh Kumar Sinha
,
Jayram S. Thathachar
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 309-317