( en | de | ru )

 

Disambiguation of "Leighton, Frank Thomson"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks With Destructive Faults.

, and . SPAA, page 30-41. ACM, (1993)

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.

Leighton Richards

Leighton Folkes

Mark Thomson

Erhard Thomson

Charles Leighton

 

Other publications of authors with the same name

Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract)., , , and . STOC, page 257-265. ACM, (1996)An Asymptotically Optimal Layout for the Shuffle-Exchange Graph., , , and . J. Comput. Syst. Sci., 26 (3): 339-361 (1983)Tight analyses of two local load balancing algorithms., , , , , , , , and . STOC, page 548-558. ACM, (1995)Resource Discovery in Distributed Networks., , and . PODC, page 229-237. ACM, (1999)The Challenges of Delivering Content on the Internet.. NCA, page 214. IEEE Computer Society, (2001)Optimal Simulations of Tree Machines (Preliminary Version), , , and . FOCS, page 274-282. IEEE Computer Society, (1986)On the Fault Tolerance of Some Popular Bounded-Degree Networks, , and . FOCS, page 542-552. IEEE Computer Society, (1992)On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates, , and . FOCS, page 332-346. IEEE Computer Society, (1994)Packet Routing and Job-Shop Scheduling in (Congestion + Dilation) Steps, , and . Combinatorica, 14 (2): 167-186 (1994)Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules., , and . Combinatorica, 19 (3): 375-401 (1999)