From post

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.

 

Другие публикации лиц с тем же именем

On Feasible Numbers (Preliminary Version). STOC, стр. 195-207. ACM, (1977)A Note on the Bottleneck Counting Argument., и . CCC, стр. 297-301. IEEE Computer Society, (1997)On the Structure of Feasible Computation., и . GI Jahrestagung, том 26 из Lecture Notes in Computer Science, стр. 3-51. Springer, (1974)Probabilistic Communication Complexity (Preliminary Version), и . FOCS, стр. 118-126. IEEE Computer Society, (1984)Complexity classes in communication complexity theory (preliminary version), , и . FOCS, стр. 337-347. IEEE Computer Society, (1986)On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract), , и . FOCS, стр. 107-112. IEEE Computer Society, (1978)Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link., и . ICALP, том 1853 из Lecture Notes in Computer Science, стр. 768-779. Springer, (2000)Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version). STOC, стр. 158-167. ACM, (1981)Average Circuit Depth and Average Communication Complexity., , и . ESA, том 979 из Lecture Notes in Computer Science, стр. 102-112. Springer, (1995)Symmetry Breaking in Anonymous Networks: Characterizations., , , , , и . ISTCS, стр. 16-26. IEEE Computer Society, (1996)