( en | de | ru )

 

Disambiguation of "Paterson, Mike"

Author of the publication

copydeleteadd this publication to your clipboard
The Asymptotic Complexity of Merging Networks

, , and . FOCS, page 236-246. IEEE Computer Society, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ralph Paterson

Heinz Miketta

Anna Mikecz

Helmut Mikelskis

Bernd Miketta

 

Other publications of authors with the same name

Combinatorial Communication in the Locker Room., , and . CoRR, (2020)Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2., , , and . LMS J. Comput. Math., (2006)A note on disjunctive form tautologies., , , , and . SIGACT News, 5 (2): 17-20 (1973)Deterministic one-counter automata., and . Automatentheorie und Formale Sprachen, volume 2 of Lecture Notes in Computer Science, page 104-115. Springer, (1973)The computational complexity of two-state spin systems., , and . Random Struct. Algorithms, 23 (2): 133-154 (2003)The Depth of All Boolean Functions., and . SIAM J. Comput., 6 (2): 373-380 (1977)The Multi-Commodity Source Location Problems and the Price of Greed., , and . J. Graph Algorithms Appl., 13 (1): 55-73 (2009)Complexity of Monotone Networks for Boolean Matrix Product.. Theor. Comput. Sci., 1 (1): 13-20 (1975)Circuit Size is Nonlinear in Depth., and . Theor. Comput. Sci., 2 (3): 397-400 (1976)Deterministic One-Counter Automata., and . J. Comput. Syst. Sci., 10 (3): 340-350 (1975)