Sciweavers

CADE
2012
Springer
12 years 1 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
AAAI
2007
14 years 1 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
14 years 3 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
14 years 5 months ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
ICALP
2007
Springer
14 years 5 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao