Sciweavers

386 search results - page 28 / 78
» Fundamental Questions
Sort
View
FOSSACS
2009
Springer
14 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
14 years 3 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
DAC
2005
ACM
13 years 11 months ago
Differentiate and deliver: leveraging your partners
For the past 25 years, the EDA industry has played a major role in the growth of the semiconductor industry, providing tools and services that have helped companies develop electr...
Jay Vleeschhouwer, Warren East, Michael J. Fister,...
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 10 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
BIRTHDAY
2005
Springer
14 years 3 months ago
Splitting Logics
This paper addresses the question of factoring a logic into families of (generally simpler) components, estimating the top– down perspective, splitting, versus the bottom–up, s...
Walter Alexandre Carnielli, Marcelo E. Coniglio