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.

 

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

Fast Canonization of Circular Strings.. J. Algorithms, 2 (2): 107-121 (1981)An O(log n) Parallel Connectivity Algorithm., и . J. Algorithms, 3 (1): 57-67 (1982)Efficient Optimization of Monotonic Functions on Trees., и . CAAP, том 112 из Lecture Notes in Computer Science, стр. 332-339. Springer, (1981)An O(n² log n) Parallel MAX-FLOW Algorithm., и . J. Algorithms, 3 (2): 128-146 (1982)Finding Euler Circuits in Logarithmic Parallel Time, , и . STOC, стр. 249-257. ACM, (1984)Finding the maximum, merging and sorting in a parallel computation model., и . CONPAR, том 111 из Lecture Notes in Computer Science, стр. 314-327. Springer, (1981)Using Linear Programming Techniques for Scheduling-Based Random Test-Case Generation., , и . Haifa Verification Conference, том 4383 из Lecture Notes in Computer Science, стр. 16-33. Springer, (2006)A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality., и . SIAM J. Comput., 9 (4): 827-845 (1980)The complexity of finding maximum disjoint paths with length constraints., , и . Networks, 12 (3): 277-286 (1982)A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality, и . FOCS, стр. 205-217. IEEE Computer Society, (1979)