Volume 12; Issue 3

ACM SIGACT News

Volume 12; Issue 3
1

A general method for solving divide-and-conquer recurrences

Bentley, Jon Louis, Haken, Dorothea, Saxe, James B.
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 457 KB
english, 1980
2

Complexity of approximation algorithms for combinatorial problems

Gens, Georgii, Levner, Evgenii
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 930 KB
english, 1980
5

A note on the constructors of the computable universe

Nourani, Farshid
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 76 KB
english, 1980
6

Roots of the hardest context free language and other constructs

Gaifman, H., Shamir, E.
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 225 KB
english, 1980
7

Constructing a finite automaton for a given regular expression

Leiss, Ernst
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 271 KB
english, 1980
8

On folk theorems

Harel, David
Journal:
ACM SIGACT News
Year:
1980
Language:
english
File:
PDF, 682 KB
english, 1980