Search the dblp DataBase
Jayram S. Thathachar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jayram S. Thathachar
On the Limitations of Ordered Representations of Functions. [Citation Graph (0, 0)][DBLP]
CAV, 1998, pp:232-243 [Conf] - Paul Beame, Michael E. Saks, Jayram S. Thathachar
Time-Space Tradeoffs for Branching Programs. [Citation Graph (0, 0)][DBLP]
FOCS, 1998, pp:254-263 [Conf] - Rakesh K. Sinha, Jayram S. Thathachar
Efficient Oblivious Branching Programs for Threshold Functions [Citation Graph (0, 0)][DBLP]
FOCS, 1994, pp:309-317 [Conf] - Jayram S. Thathachar
On Separating the Read-k-Times Branching Program Hierarchy. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:653-662 [Conf] - Jayram S. Thathachar
On Separating the Read-k-Times Branching Program Hierarchy [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:2, pp:- [Journal] - Paul Beame
Michael E. Saks , Jayram S. Thathachar
Time-Space Tradeoffs for Branching Programs [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:53, pp:- [Journal] - Rakesh K. Sinha, Jayram S. Thathachar
Efficient Oblivious Branching Programs for Threshold and Mod Functions. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1997, v:55, n:3, pp:373-384 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002