Sciweavers

3007 search results - page 30 / 602
» Linear Functional Fixed-points
Sort
View
CCS
2009
ACM
15 years 1 months ago
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom
Allison B. Lewko, Brent Waters
PPDP
2009
Springer
15 years 4 months ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
ICFP
2002
ACM
15 years 9 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
COMCOM
2008
82views more  COMCOM 2008»
14 years 9 months ago
Virtual password using random linear functions for on-line services, ATM machines, and pervasive computing
People enjoy the convenience of on-line services, Automated Teller Machines (ATMs), and pervasive computing, but online environments, ATMs, and pervasive computing may bring many r...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...
MP
2011
14 years 4 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi