Tom Leighton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2014

Correction: Basic Network Creation GamesNoga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Panagiotis Kanellopoulos, Tom Leighton. siamdm, 28(3):1638-1640, 2014. [doi]

2013

Basic Network Creation GamesNoga Alon, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Tom Leighton. siamdm, 27(2):656-668, 2013. [doi]

2010

Basic network creation gamesNoga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton. spaa 2010: 106-113 [doi]

Vertex Sparsifiers and Abstract Rounding AlgorithmsMoses Charikar, Tom Leighton, Shi Li, Ankur Moitra. focs 2010: 265-274 [doi]

Some Results on Greedy Embeddings in Metric SpacesTom Leighton, Ankur Moitra. dcg, 44(3):686-705, 2010. [doi]

2009

Hat Guessing GamesSteve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton. siamrev, 51(2):399-413, 2009. [doi]

Improving performance on the internetTom Leighton. CACM, 52(2):44-51, 2009. [doi]

2008

Hat Guessing GamesSteve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton. siamdm, 22(2):592-605, 2008. [doi]

Improving Performance on the InternetTom Leighton. queue, 6(6):20-29, 2008. [doi]

Some Results on Greedy Embeddings in Metric SpacesAnkur Moitra, Tom Leighton. focs 2008: 337-346 [doi]

2007

2006

On the max-flow min-cut ratio for directed multicommodity flowsMohammad Taghi Hajiaghayi, Tom Leighton. TCS, 352(1-3):318-321, 2006. [doi]

Semi-oblivious routingMohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton. spaa 2006: 234 [doi]

2005

2001

Containment Properties of Product and Power GraphsAntonio Fernández, Tom Leighton, José Luis López-Presa. endm, 7:46-49, 2001. [doi]

1998

Multicommodity Flow and Circuit SwitchingTom Leighton, Satish Rao, Aravind Srinivasan. hicss 1998: 459-465 [doi]

1996

Secure spread spectrum watermarking for images, audio and videoIngemar J. Cox, Joe Kilian, Tom Leighton, Talal Shamoon. icip 1996: 243-246 [doi]

1994

Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networksBaruch Awerbuch, Tom Leighton. stoc 1994: 487-496 [doi]

Scalable expanders: exploiting hierarchical random wiringEric A. Brewer, Frederic T. Chong, Tom Leighton. stoc 1994: 144-152 [doi]

1990

Empirical evaluation of randomly-wire multistage networksTom Leighton, Derek Linsinski, Bruce M. Maggs. iccd 1990: 380-385 [doi]

1989

Tight bounds for minimax grid matching wit applications to the average case analysis of algorithmsTom Leighton, Peter W. Shor. combinatorica, 9(2):161-187, 1989.

1983

Parallel Computation Using Meshes of TreesTom Leighton. wg 1984: 200-218

Sign in or sign up to see more results.

runs on WebDSL