Ramyaa Ramyaa
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Implicit complexity for coinductive data: a characterization of corecurrence (available as arXiv preprint) | 2021-03-17 | Paper |
| Implicit complexity for coinductive data: a characterization of corecurrence | 2021-03-17 | Paper |
| Short refutations for an equivalence-chain principle for constant-depth formulas Mathematical Logic Quarterly | 2020-05-11 | Paper |
| Denotational cost semantics for functional languages with inductive types Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
| Computing with a fixed number of pointers (invited talk) | 2017-02-21 | Paper |
| Ramified Corecurrence and Logspace Electronic Notes in Theoretical Computer Science | 2016-07-15 | Paper |
| The computational contents of ramified corecurrence Lecture Notes in Computer Science | 2015-10-01 | Paper |
| Pure Pointer Programs and Tree Isomorphism Lecture Notes in Computer Science | 2013-03-18 | Paper |
| Feasible functions over co-inductive data Logic, Language, Information and Computation | 2010-09-29 | Paper |
Research outcomes over time
This page was built for person: Ramyaa Ramyaa
