Author of the publication

Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks.

, , , , , , and . NeurIPS, page 6695-6706. (2021)

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.

 

Other publications of authors with the same name

Handbook of Parallel Computing: Models, Algorithms and Applications, , and . chapter Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform, CRC Press, (2007)Finding the maximum, merging and sorting in a parallel computation model., and . CONPAR, volume 111 of Lecture Notes in Computer Science, page 314-327. Springer, (1981)Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking., and . AWOC, volume 319 of Lecture Notes in Computer Science, page 91-100. Springer, (1988)What to Do with All this Hardware? (Invited Lecture).. CPM, volume 2089 of Lecture Notes in Computer Science, page 50. Springer, (2001)Randomized Parallel Speedups for List Ranking.. J. Parallel Distributed Comput., 4 (3): 319-333 (1987)An efficient distributed orientation algorithm.. IEEE Trans. Inf. Theory, 29 (4): 624-629 (1983)Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm, and . STOC, page 220-230. ACM, (1986)Deterministic Sampling-A New Technique for Fast Pattern Matching. STOC, page 170-180. ACM, (1990)Randomized Speed-Ups in Parallel Computation. STOC, page 230-239. ACM, (1984)Constant Depth Reducibility., , and . SIAM J. Comput., 13 (2): 423-439 (1984)