Sciweavers

769 search results - page 42 / 154
» Where Is the Proof
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
DCG
2008
88views more  DCG 2008»
13 years 8 months ago
On the Number of Birch Partitions
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
Stephan Hell
JAR
2006
99views more  JAR 2006»
13 years 8 months ago
An Integrated Approach to High Integrity Software Verification
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. Such a property is particularly valuable in high inte...
Andrew Ireland, Bill J. Ellis, Andrew Cook, Roderi...
RTA
1997
Springer
14 years 28 days ago
Proving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Thomas Arts, Jürgen Giesl
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 2 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi