Functional Adaptive Programming A dissertation presented by Bryan Chadwick

First Page		Document Content
Date: 2010-10-28 11:25:00 Recursion Subroutines Method Object-oriented programming Theoretical computer science Tree traversal Mutual recursion Inline expansion Visitor pattern Multiple dispatch Generic function Generic programming		Functional Adaptive Programming A dissertation presented by Bryan Chadwick Add to Reading List Source URL: www.ccs.neu.edu Download Document from Source Website File Size: 883,87 KB Share Document on Facebook

	Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o DocID: 1xTVd - View Document
	Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of DocID: 1rghj - View Document
	1 On the ﬁeld isomorphism problem of generic polynomials via formal Tschirnhausen transformation Akinari Hoshi and Katsuya Miyake Let k be a ﬁeld and G a ﬁnite group. A k-generic polynomial for G covers all G-Galo DocID: 1qQKB - View Document
	A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany DocID: 1qKpq - View Document
	SAS:SAS Graph Generic Driver DocID: 1qmmk - View Document