Sciweavers

1274 search results - page 81 / 255
» New Proofs for
Sort
View
95
Voted
JCT
2007
79views more  JCT 2007»
15 years 17 days ago
Generalization of Stanley's monster reciprocity theorem
By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley’s...
Guoce Xin
ESORICS
2007
Springer
15 years 4 months ago
Efficient Proving for Practical Distributed Access-Control Systems
We present a new technique for generating a formal proof that an access request satisfies accesscontrol policy, for use in logic-based access-control frameworks. Our approach is t...
Lujo Bauer, Scott Garriss, Michael K. Reiter
139
Voted
ENDM
2007
106views more  ENDM 2007»
15 years 19 days ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
91
Voted
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 7 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
93
Voted
CORR
2009
Springer
114views Education» more  CORR 2009»
14 years 10 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol