Sciweavers

21 search results - page 1 / 5
» New Parallel Domain Extenders for UOWHF
Sort
View
ASIACRYPT
2004
Springer
14 years 4 months ago
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compr...
Palash Sarkar
ASIACRYPT
2003
Springer
14 years 4 months ago
New Parallel Domain Extenders for UOWHF
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Su...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
14 years 2 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
BIRTHDAY
2010
Springer
13 years 12 months ago
Three Paths to Effectiveness
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
Udi Boker, Nachum Dershowitz
IANDC
2006
78views more  IANDC 2006»
13 years 10 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini