Charanjit S. Jutla
Loading Google Thumbnails...
| 2009 |
|---|
| 10 | Testing low-degree polynomials over prime fields. Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman. Random Struct. Algorithms (35): 163-193 (2009). Web SearchBibTeXDownload |
| 2007 |
|---|
| 9 | Utility Sampling for Trust Metrics in PKI. Dakshi Agrawal, Charanjit S. Jutla. IACR Cryptology ePrint Archive (2007): 178 (2007). Web SearchBibTeXDownload |
| 2004 |
|---|
| 8 | Testing Low-Degree Polynomials over Prime Fields. Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman. FOCS 2004, 423-432. Web SearchBibTeXDownload |
| 2001 |
|---|
| 7 | Efficient Rijndael Encryption Implementation with Composite Field Arithmetic. Atri Rudra, Pradeep K. Dubey, Charanjit S. Jutla, Vijay Kumar, Josyula R. Rao, Pankaj Rohatgi. CHES 2001, 171-184. Cited by 112Web SearchBibTeXDownload |
| 6 | On model checking for the µ-calculus and its fragments. E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla. Theor. Comput. Sci. (258): 491-522 (2001). Web SearchBibTeXDownload |
| 1999 |
|---|
| 5 | The Complexity of Tree Automata and Logics of Programs. E. Allen Emerson, Charanjit S. Jutla. SIAM J. Comput. (29): 132-158 (1999). Web SearchBibTeXDownload |
| 1993 |
|---|
| 4 | On Model-Checking for Fragments of µ-Calculus. E. Allen Emerson, Charanjit S. Jutla, A. Prasad Sistla. CAV 1993, 385-396. Web SearchBibTeXDownload |
| 1991 |
|---|
| 3 | Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). E. Allen Emerson, Charanjit S. Jutla. FOCS 1991, 368-377. Web SearchBibTeXDownload |
| 1989 |
|---|
| 2 | On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract). E. Allen Emerson, Charanjit S. Jutla. LICS 1989, 333-342. Web SearchBibTeXDownload |
| 1988 |
|---|
| 1 | The Complexity of Tree Automata and Logics of Programs (Extended Abstract). E. Allen Emerson, Charanjit S. Jutla. FOCS 1988, 328-337. Web SearchBibTeXDownload |
from DBLP and Google Scholar
