Sciweavers

11016 search results - page 710 / 2204
» Cloud Computing for Science
Sort
View
TLCA
1993
Springer
15 years 11 months ago
A Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with recursion and arithmetic, our logic is a logic for Sys...
Gordon D. Plotkin, Martín Abadi
FOCS
1990
IEEE
15 years 11 months ago
Algebraic Methods for Interactive Proof Systems
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...
RTA
2010
Springer
15 years 11 months ago
Optimizing mkbTT
We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Mas...
CSR
2009
Springer
15 years 11 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
FOCS
2007
IEEE
15 years 11 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg