Revitalizing computing education through free and open source software for humanity. R Morelli, AB Tucker, N Danner, TR De Lanerolle, HJC Ellis, Ö Izmirli, ... Commun. ACM 52 (8), 67-75, 2009 | 66 | 2009 |

Denotational cost semantics for functional languages with inductive types N Danner, DR Licata, R Ramyaa ACM International Conference on Functional Programming (ICFP '15), 140-151, 2015 | 50 | 2015 |

Towards a model theory of diagrams E Hammer, N Danner Journal of Philosophical Logic 25 (5), 463-482, 1996 | 41 | 1996 |

A static cost analysis for a higher-order language N Danner, J Paykin, JS Royer Proceedings of the 7th workshop on Programming languages meets program …, 2013 | 38 | 2013 |

On the foundations of corecursion LS Moss, N Danner Logic Journal of the IGPL 5 (2), 231-257, 1997 | 34* | 1997 |

Effectiveness and detection of denial-of-service attacks in Tor N Danner, S Defabbia-Kane, D Krizanc, M Liberatore ACM Transactions on Information and System Security (TISSEC) 15 (3), 11, 2012 | 21 | 2012 |

Adventures in time and space N Danner, JS Royer Logical Methods in Computer Science 3 (9), 1-53, 2007 | 18 | 2007 |

Adventures in time and space N Danner, JS Royer ACM Conference of Principles of Programming Languages (POPL '06), 168-179, 2006 | 18 | 2006 |

Detecting denial of service attacks in Tor N Danner, D Krizanc, M Liberatore International Conference on Financial Cryptography and Data Security, 273-284, 2009 | 15 | 2009 |

Stratified polymorphism and primitive recursion N Danner, D Leivant Mathematical Structures in Computer Science 9 (4), 507-522, 1999 | 10 | 1999 |

Ordinals and ordinal functions representable in the simply typed lambda calculus N Danner Annals of Pure and Applied Logic 97 (1-3), 179-201, 1999 | 9 | 1999 |

Creating an academic community to build humanitarian foss: A progress report T de Lanerolle, R Morelli, N Danner, D Krizanc, G Parker, O Izmirli Proceedings of the 5th International ISCRAM Conference, 337-341, 2008 | 8 | 2008 |

Two algorithms in search of a type-system N Danner, JS Royer Theory of Computing Systems 45 (4), 787-821, 2009 | 5 | 2009 |

Ordinal notations in typed lambda-calculi. N Danner | 5 | 2000 |

Minimization and NP multifunctions N Danner, C Pollett Theoretical computer science 318 (1-2), 105-119, 2004 | 3 | 2004 |

Simulation of circuit creation in tor: Preliminary results W Boyd, N Danner, D Krizanc Proceedings of the 4th Hot Topics in Privacy Enhancing Technologies, 41-48, 2011 | 1 | 2011 |

Circuit principles and weak pigeonhole variants C Pollett, N Danner Theoretical Computer Science 383 (2-3), 115-131, 2007 | 1 | 2007 |

Time-complexity semantics for feasible affine recursions N Danner, JS Royer Conference on Computability in Europe, 205-217, 2007 | | 2007 |

The weak pigeonhole principle for function classes in *S* ^{1}_{2}N Danner, C Pollett Mathematical Logic Quarterly 52 (6), 575-584, 2006 | | 2006 |

Ramied Recurrence with Dependent Types N Danner International Conference on Typed Lambda Calculi and Applications, 91-105, 2001 | | 2001 |