1888 search results - page 177 / 378 » Proof theory and computational analysis |
183
Voted
FOSSACS
2005
Springer
16 years 19 days ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
184
Voted
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
188
click to vote
ICTAC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
184
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
202
Voted
VISUALIZATION
2005
IEEE
16 years 20 days ago
2005
IEEE
Simulations often generate large amounts of data that require use of SciVis techniques for effective exploration of simulation results. In some cases, like 1D theory of fluid dyn...