Sciweavers

3134 search results - page 29 / 627
» Computing full disjunctions
Sort
View
ICICS
2007
Springer
14 years 4 months ago
Extending FORK-256 Attack to the Full Hash Function
Abstract. In a paper published in FSE 2007, a way of obtaining nearcollisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained ex...
Scott Contini, Krystian Matusiewicz, Josef Pieprzy...
LICS
1993
IEEE
14 years 2 months ago
Full Abstraction for a Shared Variable Parallel Language
traction for a Shared Variable Parallel Language Stephen Brookes∗ School of Computer Science Carnegie Mellon University Pittsburgh, Pa 15213 We give a new denotational semantics...
Stephen D. Brookes
MOBISYS
2003
ACM
14 years 9 months ago
Full TCP/IP for 8-Bit Architectures
We describe two small and portable TCP/IP implementations fulfilling the subset of RFC1122 requirements needed for full host-to-host interoperability. Our TCP/IP implementations d...
Adam Dunkels
DIS
2007
Springer
14 years 4 months ago
A Consequence Finding Approach for Full Clausal Abduction
Abductive inference has long been associated with the logic of scientific discovery and automated abduction is now being used in real scientific tasks. But few methods can exploi...
Oliver Ray, Katsumi Inoue
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...