#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1960

1985

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Micha A. Perles, Michael O. Rabin, Eliahu Shamir
- IEEE Trans. Electronic Computers
- 1963

A definite automaton is, roughly speaking, an automaton (sequential circuit) with the property that for some fixed integer k its action depends only on the last k inputs. The notion of a definite… (More)

- Eliahu Shamir
- 1968

It is shown that weak solutions of mixed elliptic problems are Hölder continuous of any order less than 1/2 and that they possess higher regularity in non-critical directions.

- Dan Gordon, Eliahu Shamir
- Theor. Comput. Sci.
- 1983

The following problem in the computation of partial recursive functionals is considered: Minimizing the length of inital segments of input functions containing all function values requested by a… (More)

- Eliahu Shamir
- Information and Control
- 1967

Algebraic power series in noncommuting variables are obtained as solutions of polynomial systems of equations. These systems can be regarded as context-free grammars with weights. Some properties of… (More)

- Jakob Gonczarowski, Eliahu Shamir
- J. Comput. Syst. Sci.
- 1985

Abstract Pattern selector grammars are defined in general. We concentrate on the study of special grammars, the pattern selectors of which contain precisely κ “one”s (0∗(10∗) κ ) or κ adjacent “one”s… (More)

- Eliahu Shamir
- 1961

- Eliahu Shamir, Eli Upfal
- 1981

The following result is proved: LetGn,p be a random graph withn vertices and probabilityp for an edge. Ifp is such that the random graph has min-degree at leastr with probability 1, then anyf-factor… (More)