-
2
-
-
0002967460
-
On the unique satisfiability problem
-
A. Blass and Y. Gurevich. On the unique satisfiability problem. Inform. and Control, 55:80-88, 1982.
-
(1982)
Inform. and Control
, vol.55
, pp. 80-88
-
-
Blass, A.1
Gurevich, Y.2
-
3
-
-
0040940672
-
Unambiguity and fewness for logarithmic space
-
G. Buntrock, B. Jenner, K.-J. Lange, and P. Rossmanith. Unambiguity and fewness for logarithmic space. In Proc. of the 8th Conference on Fundamentals of Computation Theory~ number 529 in LNCS, pages 168-179, 1991.
-
(1991)
Proc. of the 8Th Conference on Fundamentals of Computation Theory~ Number 529 in LNCS
, pp. 168-179
-
-
Buntrock, G.1
Jenner, B.2
Lange, K.-J.3
Rossmanith, P.4
-
4
-
-
0023952675
-
Approximate parallel scheduling, part i: The basic technique with applications to optimal parallel list ranking in logarithmic time
-
R. Cole and U. Vishkin. Approximate parallel scheduling, part i: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comp. 17:128-142, 1988.
-
(1988)
SIAM J. Comp
, vol.17
, pp. 128-142
-
-
Cole, R.1
Vishkin, U.2
-
5
-
-
84880698085
-
Deterministic CFL’s are accepted simultaneously in polynomial time and log squared space
-
S. Cook. Deterministic CFL’s are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Syrup. on Theory of Computing, pages 338-345, 1979.
-
(1979)
Proc. of the 11Th Annual ACM Syrup. on Theory of Computing
, pp. 338-345
-
-
Cook, S.1
-
11
-
-
0024091298
-
Nondeterministic Space is closed under complementation
-
N. Immerman. Nondeterministic Space is closed under complementation. SIAM J. Comp., 17:935-938, 1988.
-
(1988)
SIAM J. Comp
, vol.17
, pp. 935-938
-
-
Immerman, N.1
-
13
-
-
0002065879
-
A Survey of Parallel Algorithms for Shared- Memory Machines
-
J. van Leeuwen, editor, Elsevier, Amsterdam
-
R.M. Karp and V. Ramachandran. A Survey of Parallel Algorithms for Shared- Memory Machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 869-941. Elsevier, Amsterdam, 1990.
-
(1990)
Handbook of Theoretical Computer Science
, vol.A
, pp. 869-941
-
-
Karp, R.M.1
Ramachandran, V.2
-
17
-
-
0027644646
-
Fast recognition of deterministic cfl's with a smaller number of processors
-
Corrigendum
-
B. Monien, W. Rytter, and H. Schäpers. Fast recognition of deterministic cfl's with a smaller number of processors. Theoret. Comput. Sci., 116:421-429, 1993. Corrigendum, 123:427,1993.
-
(1993)
Theoret. Comput. Sci
, vol.116
, pp. 421-429
-
-
Monien, B.1
Rytter, W.2
Schäpers, H.3
-
21
-
-
84976758731
-
On the tape complexity of deterministic context-free languages
-
I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405-414, 1978.
-
(1978)
J. Assoc. Comp. Mach
, vol.25
, pp. 405-414
-
-
Sudborough, I.1
-
22
-
-
0024112189
-
The method of forcing for nondeterministic automata
-
R. Szelepcsényi. The method of forcing for nondeterministic automata. Acta Informatica, 26:279-284, 1988.
-
(1988)
Acta Informatica
, vol.26
, pp. 279-284
-
-
Szelepcsényi, R.1
|