Suchergebnisse - Paterson, Michael S. 1942-

Impossibility of distributed consensus with one faulty process

von Fischer, Michael J., Lynch, Nancy A. 1948-, Paterson, Michael S. 1942-

String-matching and other products

von Fischer, Michael J., Paterson, Michael S. 1942-

Equivalence problems in a model of computation

von Paterson, Michael S. 1942-

With what frequency are apparently intractable problems difficult?

von Meyer, Albert R., Paterson, Michael S. 1942-

A faster algorithm computing string edit distances

von Masek, William J., Paterson, Michael S. 1942-

An improved argument for on-line multipication

von Paterson, Michael S. 1942-, Fischer, Michael J., Meyer, Albert R.

Nlogn lower bounds on length of Boolean formula

von Fischer, Michael J., Meyer, Albert R., Paterson, Michael S. 1942-

Identities from partition involutions

von Knuth, Donald Ervin 1938-, Paterson, Michael S. 1942-

Automata, languages and programming: 17th international colloquium, Warwick University, England, July 16 - 20, 1990 ; proceedings

Weitere beteiligte Personen: “… Paterson, Michael S. 1942- …”