| 2008 |
|---|
| 20 | EE | Anish Muttreja,
Prateek Mishra,
Niraj K. Jha:
Threshold Voltage Control through Multiple Supply Voltages for Power-Efficient FinFET Interconnects.
VLSI Design 2008: 220-227 |
| 1998 |
|---|
| 19 | EE | Mauricio Cortes,
Prateek Mishra:
An Implementation Model for Collaborative Applications.
CLEI Electron. J. 1(1): (1998) |
| 1997 |
|---|
| 18 | EE | R. C. Sekar,
I. V. Ramakrishnan,
Prateek Mishra:
On the power and limitations of strictness analysis.
J. ACM 44(3): 505-525 (1997) |
| 1996 |
|---|
| 17 | EE | Mauricio Cortes,
Prateek Mishra:
DCWPL: A Programming Language for Describing Collaborative Work.
CSCW 1996: 21-29 |
| 1992 |
|---|
| 16 | EE | Marc Neuberger,
Prateek Mishra:
A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis.
LISP and Functional Programming 1992: 127-138 |
| 1991 |
|---|
| 15 | | Allen Leung,
Prateek Mishra:
Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages.
FPCA 1991: 328-351 |
| 14 | | R. C. Sekar,
Prateek Mishra,
I. V. Ramakrishnan:
On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation.
POPL 1991: 37-48 |
| 1990 |
|---|
| 13 | | Sanjiva Prasad,
Alessandro Giacalone,
Prateek Mishra:
Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming.
ICALP 1990: 765-778 |
| 12 | | You-Chin Fuh,
Prateek Mishra:
Type Inference with Subtypes.
Theor. Comput. Sci. 73(2): 155-175 (1990) |
| 1989 |
|---|
| 11 | EE | Tsung-Min Kuo,
Prateek Mishra:
Strictness Analysis: A New Perspective Based on Type Inference.
FPCA 1989: 260-272 |
| 10 | | You-Chin Fuh,
Prateek Mishra:
Polymorphic Subtype Inference: Closing the Theory-Practice Gap.
TAPSOFT, Vol.2 1989: 167-183 |
| 9 | | Alessandro Giacalone,
Prateek Mishra,
Sanjiva Prasad:
FACILE: A Symmetric Integration of Concurrent and Functional Programming.
TAPSOFT, Vol.2 1989: 184-209 |
| 1988 |
|---|
| 8 | | You-Chin Fuh,
Prateek Mishra:
Type Inference with Subtypes.
ESOP 1988: 94-114 |
| 7 | | Prateek Mishra:
Strictness Analysis of the Untyped lambda-Calculus.
Inf. Process. Lett. 28(3): 121-125 (1988) |
| 6 | | Saumya K. Debray,
Prateek Mishra:
Denotational and Operational Semantics for Prolog.
J. Log. Program. 5(1): 81-91 (1988) |
| 1987 |
|---|
| 5 | | Tsung-Min Kuo,
Prateek Mishra:
On Strictness and its Analysis.
POPL 1987: 144-155 |
| 1985 |
|---|
| 4 | | Prateek Mishra,
Uday S. Reddy:
Declaration-Free Type Checking.
POPL 1985: 7-21 |
| 1984 |
|---|
| 3 | | Prateek Mishra,
Robert M. Keller:
Static Inference of Properties of Applicative Programs.
POPL 1984: 235-244 |
| 2 | | Prateek Mishra:
Towards a Theory of Types in Prolog.
SLP 1984: 289-298 |
| 1981 |
|---|
| 1 | | George Logothetis,
Prateek Mishra:
Compiling Short-circuit Boolean Expressions in One Pass.
Softw., Pract. Exper. 11(11): 1197-1214 (1981) |
