Sciweavers

436 search results - page 15 / 88
» A Note on Negligible Functions
Sort
View
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
14 years 20 hour ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
JSYML
2010
71views more  JSYML 2010»
13 years 6 months ago
Limitwise monotonic functions, sets, and degrees on computable domains
We extend the notion of limitwise monotonic functions to include arbitrary computable domains. We then study which sets and degrees are support increasing (support strictly increas...
Asher M. Kach, Daniel Turetsky
ICISC
2009
138views Cryptology» more  ICISC 2009»
13 years 6 months ago
Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson
At CANS 2008, Mashatan and Stinson suggested a message recognition protocol for ad hoc pervasive networks. The protocol provides a procedure to resynchronize in case of a (possibly...
Madeline González Muñiz, Rainer Stei...

Lecture Notes
1973views
15 years 6 months ago
Advanced Microeconomics
These lecture notes cover several topics such as Optimization, Technology and profit maximization, Profit maximization and cost minimization, The cost function & duality, Consu...
Sten Nyberg
COGSR
2010
92views more  COGSR 2010»
13 years 3 months ago
On strong anticipation
We examine Dubois's [Dubois, D., 2003. Mathematical foundations of discrete and functional systems with strong and weak anticipations. Lecture Notes in Computer Science 2684,...
Nigel Stepp, Michael T. Turvey