Sciweavers

360 search results - page 69 / 72
» Explanations and Proof Trees
Sort
View
SPAA
2010
ACM
13 years 11 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
RTCSA
1999
IEEE
13 years 10 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
13 years 9 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 6 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
JCT
2007
94views more  JCT 2007»
13 years 5 months ago
A bijection between 2-triangulations and pairs of non-crossing Dyck paths
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
Sergi Elizalde