Sciweavers

2767 search results - page 14 / 554
» Universal Exponentiation Algorithm
Sort
View
FOCS
2006
IEEE
14 years 4 months ago
On the time complexity of 2-tag systems and small universal Turing machines
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
Damien Woods, Turlough Neary
CRYPTO
1991
Springer
105views Cryptology» more  CRYPTO 1991»
14 years 1 months ago
Universal Hashing and Authentication Codes
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
Douglas R. Stinson
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
14 years 3 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
14 years 2 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
FORTE
1998
13 years 11 months ago
Issues in conformance testing: multiple semicontrollable interfaces
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
Mariusz A. Fecko, M. Ümit Uyar, Adarshpal S. ...