Sciweavers

19 search results - page 2 / 4
» ipl 1998
Sort
View
IPL
1998
68views more  IPL 1998»
13 years 5 months ago
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
Burton Rosenberg
IPL
1998
73views more  IPL 1998»
13 years 5 months ago
Kleene's Three-Valued Logic and Process Algebra
We propose a combination of Kleene’s three-valued logic and ACP process algebra via the guarded command construct. We present an operational semantics in SOS-style, and a comple...
Jan A. Bergstra, Alban Ponse
IPL
1998
95views more  IPL 1998»
13 years 5 months ago
A Variation on the Zero-One Law
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
IPL
2000
119views more  IPL 2000»
13 years 5 months ago
Cyclic-cubes and wrap-around butterflies
Recently a new family of Cayley graphs of fixed even node degree called the Cyclic-cubes were proposed as interconnection networks by Fu and Chau (1998). We show that these networ...
Meghanad D. Wagh, Prakash Math, Osman Guzide
IPL
1998
177views more  IPL 1998»
13 years 5 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon