Sciweavers

745 search results - page 67 / 149
» The origins of combinatorics on words
Sort
View
PKC
1998
Springer
103views Cryptology» more  PKC 1998»
15 years 6 months ago
A Scheme for Obtaining a Message from the Digital Multisignature
A new digital multisignature scheme shall be proposed in this paper to allow some members of a group signing the same document and sending it to the receiver, who in turn shall ve...
Chin-Chen Chang, Jyh-Jong Leu, Pai-Cheng Huang, We...
FOCS
1990
IEEE
15 years 5 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
ECAI
2006
Springer
15 years 5 months ago
Last Conflict Based Reasoning
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
147
Voted
SI3D
1995
ACM
15 years 5 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater
110
Voted
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 5 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz