Norman Danner

	2012
20		Norman Danner, James S. Royer: Ramified Structural Recursion and Corecursion CoRR abs/1201.4567: (2012)
	2011
19		Norman Danner, Sam DeFabbia-Kane, Danny Krizanc, Marc Liberatore: Effectiveness and detection of denial of service attacks in Tor CoRR abs/1110.5395: (2011)
	2009
18		Norman Danner, Danny Krizanc, Marc Liberatore: Detecting Denial of Service Attacks in Tor. Financial Cryptography 2009: 273-284
17		Ralph Morelli, Allen B. Tucker, Norman Danner, Trishan R. de Lanerolle, Heidi J. C. Ellis, Ozgur Izmirli, Danny Krizanc, Gary Parker: Revitalizing computing education through free and open source software for humanity. Commun. ACM 52(8): 67-75 (2009)
16		Norman Danner, James S. Royer: Two Algorithms in Search of a Type-System. Theory Comput. Syst. 45(4): 787-821 (2009)
	2007
15		Norman Danner, James S. Royer: Time-Complexity Semantics for Feasible Affine Recursions. CiE 2007: 205-217
14		Norman Danner, James S. Royer: Two algorithms in search of a type system CoRR abs/0710.0824: (2007)
13		Norman Danner, James S. Royer: Time-complexity semantics for feasible affine recursions (extended abstract) CoRR abs/cs/0701076: (2007)
12		Norman Danner, James S. Royer: Adventures in time and space. Logical Methods in Computer Science 3(1): (2007)
11		Chris Pollett, Norman Danner: Circuit principles and weak pigeonhole variants. Theor. Comput. Sci. 383(2-3): 115-131 (2007)
	2006
10		Norman Danner, James S. Royer: Adventures in time and space. POPL 2006: 168-179
9		Norman Danner, Chris Pollett: The weak pigeonhole principle for function classes in S^1_2 CoRR abs/cs/0608039: (2006)
8		Norman Danner, James S. Royer: Adventures in time and space CoRR abs/cs/0612116: (2006)
7		Norman Danner, Chris Pollett: The weak pigeonhole principle for function classes in S12. Math. Log. Q. 52(6): 575-584 (2006)
	2005
6		Chris Pollett, Norman Danner: Circuit Principles and Weak Pigeonhole Variants. CATS 2005: 31-40
	2004
5		Norman Danner, Chris Pollett: Minimization and NP multifunctions. Theor. Comput. Sci. 318(1-2): 105-119 (2004)
	2001
4		Norman Danner: Ramified Recurrence with Dependent Types. TLCA 2001: 91-105
	1999
3		Norman Danner: Ordinals and Ordinal Functions Representable in the Simply Typed lambda Calculus. Ann. Pure Appl. Logic 97(1-3): 179-201 (1999)
2		Norman Danner, Daniel Leivant: Stratified polymorphism and primitive recursion. Mathematical Structures in Computer Science 9(4): 507-522 (1999)
	1997
1		Lawrence S. Moss, Norman Danner: On the Foundations of Corecursion. Logic Journal of the IGPL 5(2): 231-257 (1997)

Coauthor Index

1	Sam DeFabbia-Kane	[19]
2	Heidi J. C. Ellis	[17]
3	Ozgur Izmirli	[17]
4	Danny Krizanc	[17] [18] [19]
5	Trishan R. de Lanerolle	[17]
6	Daniel Leivant	[2]
7	Marc Liberatore	[18] [19]
8	Ralph Morelli (Ralph A. Morelli)	[17]
9	Lawrence S. Moss	[1]
10	Gary Parker	[17]
11	Chris Pollett (Christopher Pollett)	[5] [6] [7] [9] [11]
12	James S. Royer	[8] [10] [12] [13] [14] [15] [16] [20]
13	Allen B. Tucker	[17]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page