According to our database1, Prateek Mishra authored at least 25 papers between 1981 and 2014.
Legend:Book In proceedings Article PhD thesis Other
Accurate Leakage/Delay Estimation for FinFET Standard Cells under PVT Variations using the Response Surface Methodology.
Accurate Leakage Estimation for FinFET Standard Cells Using the Response Surface Methodology.
Proceedings of the 25th International Conference on VLSI Design, 2012
Die-level leakage power analysis of FinFET circuits considering process variations.
Proceedings of the 11th International Symposium on Quality of Electronic Design (ISQED 2010), 2010
Low-power FinFET circuit synthesis using surface orientation optimization.
Proceedings of the Design, Automation and Test in Europe, 2010
Low-power FinFET circuit synthesis using multiple supply and threshold voltages.
Threshold Voltage Control through Multiple Supply Voltages for Power-Efficient FinFET Interconnects.
Proceedings of the 21st International Conference on VLSI Design (VLSI Design 2008), 2008
Evaluation of multiple supply and threshold voltages for low-power FinFET circuit synthesis.
Proceedings of the 2008 IEEE International Symposium on Nanoscale Architectures, 2008
An Implementation Model for Collaborative Applications.
CLEI Electron. J., 1998
On the power and limitations of strictness analysis.
J. ACM, 1997
DCWPL: A Programming Language for Describing Collaborative Work.
Proceedings of the CSCW '96, 1996
A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis.
Proceedings of the Conference on Lisp and Functional Programming, 1992
On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991
Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages.
Proceedings of the Functional Programming Languages and Computer Architecture, 1991
Type Inference with Subtypes.
Theor. Comput. Sci., 1990
Operational and Algebraic Semantics for Facile: A Symmetric Integration of Concurrent and Functional Programming.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
Facile: A symmetric integration of concurrent and functional programming.
International Journal of Parallel Programming, 1989
Polymorphic Subtype Inference: Closing the Theory-Practice Gap.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989
Strictness Analysis: A New Perspective Based on Type Inference.
Proceedings of the fourth international conference on Functional programming languages and computer architecture, 1989
Denotational and Operational Semantics for Prolog.
J. Log. Program., 1988
Strictness Analysis of the Untyped lambda-Calculus.
Inf. Process. Lett., 1988
On Strictness and its Analysis.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987
Declaration-Free Type Checking.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985
Towards a Theory of Types in Prolog.
Proceedings of the 1984 International Symposium on Logic Programming, 1984
Static Inference of Properties of Applicative Programs.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984
Compiling Short-circuit Boolean Expressions in One Pass.
Softw., Pract. Exper., 1981