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

On the Parallel Complexity of Digraph Reachability., and . Inf. Process. Lett., 52 (5): 239-241 (1994)Constant Depth Reducibility., , and . SIAM J. Comput., 13 (2): 423-439 (1984)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)Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm, and . STOC, page 220-230. ACM, (1986)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)Strutural Parallel Algorithmics.. ICALP, volume 510 of Lecture Notes in Computer Science, page 363-380. Springer, (1991)A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors., , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 30 (4): 494-507 (2011)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)