F. Ablayev, Lower bounds for probabilistic space comp-lexity: communicationautomata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Power of Randomized Branching Programs - Farid Ablayev (1996) (10 citations) Self-citation (Ablayev) (Correct)
....tradeoffs. We can think of read k time (k 1) restrictions as a restriction on time, say time kn (see survey [8] for more information) This approach draws time space tradeoff point of view to our results. Recent results on the general lower bounds on randomized space and time can be found in [1] and [10] 2 Function Consider the finite alphabet Sigma = f0; 1; 0; 1g. As usual Sigma and Sigma n denote the set of all words of finite length and the length n over Sigma respectively. For oe 1 ; oe 2 2 Sigma, x 2 Sigma define Proj oe 1 ;oe 2 (x) to be a subsequence x 0 of the ....
F. Ablayev, Lower bounds for probabilistic space comp-lexity: communicationautomata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7.
On the Power of Randomized Branching Programs - Ablayev, Karpinski (1996) (10 citations) Self-citation (Ablayev) (Correct)
....tradeoffs. We can think of read k time (k 1) restrictions as a restriction on time, say time kn (see survey [8] for more information) This approach draws time space tradeoff point of view to our results. Recent results on the general lower bounds on randomized space and time can be found in [1] and [11] 2 Function Consider the finite alphabet Sigma = f0; 1; 0; 1g. As usual Sigma and Sigma n denote the set of all words of finite length and the length n over Sigma respectively. For oe 1 ; oe 2 2 Sigma , x 2 Sigma define P roj oe 1 ;oe 2 (x) to be the longest subsequence ....
F. Ablayev, Lower bounds for probabilistic space complexity: communicationautomata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7.
Lower Bounds for One-way Probabilistic Communication Complexity.. - Ablayev (1996) (9 citations) Self-citation (Ablayev) (Correct)
....with fixed error of probability. Nisan and Wigderson [22] exebited an explicit function which exbitis exponential gap between its k and (k Gamma 1) round randomized complexity. Extended abstracts of the results presented in this paper have been published in the ICALP 93 [2] and the LFCS 94 [3] proceedings. Known simulation results of [9] 14] and [18] allow us to use fixed partition model instead of optimal partion model without loss of generality. In this paper we consider the worst case complexity for probabilistic communication. We prove three different lower bounds for ....
F. Ablayev, Lower bounds for probabilistic space complexity: communication-automata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, 813, (1994), 1-7.
On the Power of Randomized Branching Programs - Farid Ablayev (1996) (10 citations) Self-citation (Ablayev) (Correct)
....tradeoffs. We can think of read k time (k 1) restrictions as a restriction on time, say time kn (see survey [8] for more information) This approach draws timespace tradeoff point of view to our results. Recent results on the general lower bounds on randomized space and time can be found in [1] and [11] 2 Function Consider the finite alphabet Sigma = f0; 1; 0; 1g. As usual Sigma and Sigma n denote the set of all words of finite length and the length n over Sigma respectively. For oe 1 ; oe 2 2 Sigma, x 2 Sigma define Proj oe 1 ;oe 2 (x) to be the longest subsequence ....
F. Ablayev, Lower bounds for probabilistic space complexity: communicationautomata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7.
On the Power of Randomized Ordered Branching Programs - Ablayev, Karpinski (1997) (6 citations) Self-citation (Ablayev) (Correct)
....tradeoffs. We can think of read k time (k 1) restrictions as a restriction on time, say time kn (see survey [8] for more information) This approach draws time space tradeoff point of view to our results. Recent results on the general lower bounds on randomized space and time can be found in [1] and [11] 2 Function We specify a boolean function f n of n = 4l variables as follows. For a sequence oe 2 f0; 1g 4l call odd bits a type bits and even bits a value bits. Say that even bit oe i 2 oe, i 2 f2; 4; 4lg, has type 0 (1) if corresponding odd bit oe i Gamma1 is 0 (1) ....
F.Ablayev, Lower bounds for probabilistic space complexity: communication-automata approach, in Proceedings of the LFCS'94, Lecture Notes in Computer Science, Springer-Verlag, 813, (1994), 1-7.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC