BibSLEIGH — Frank_Thomson

Travelled to:

1 × Canada
18 × USA

Collaborated with:

∅ J.Håstad M.Newman B.M.Maggs S.N.Bhatt A.Moitra R.D.Kleinberg M.Adler E.G.C.Jr. P.W.Shor A.L.Rosenberg B.Berger J.M.Kleinberg A.Aggarwal M.Hansen S.Arora B.Rogoff B.S.Baker C.G.Plaxton M.Andrews P.T.Metaxas L.Zhang B.Awerbuch Y.Azar A.Fiat T.N.Bui C.Heigham C.Jones D.J.Kleitman M.Lepley G.L.Miller R.R.Koch S.Rao F.R.K.Chung J.Hong J.L.Bentley D.S.Johnson C.C.McGeoch L.A.McGeoch D.R.Karger E.Lehman R.Panigrahy M.S.Levine D.Lewin N.Kahale Y.Ma T.Suel E.Szemerédi F.Makedon S.A.Plotkin C.Stein É.Tardos S.Tragoudas B.Ghosh S.Muthukrishnan R.Rajaraman A.W.Richa R.E.Tarjan D.Zuckerman

Talks about:

algorithm (7) network (5) tight (3) bound (3) protocol (2) parallel (2) hypercub (2) approxim (2) provabl (2) problem (2)

Person: Frank Thomson Leighton

DBLP: Leighton:Frank_Thomson

Facilitated 4 volumes:

Contributed to:

2010

2003

2001

2000

1997

1996

1995

1992

1991

1990

1989

1988

1987

1986

1984

1983

1982

1981

Wrote 27 papers:

STOC-2010-LeightonM: Extensions and limits to vertex sparsification (FTL, AM), pp. 47–56.
STOC-2003-KleinbergL #consistency: Consistent load balancing via spread minimization (RDK, FTL), pp. 565–574.
PODS-2001-Leighton #challenge #internet: The Challenges of Delivering Content on the Internet (FTL).
STOC-2000-AdlerL #multi #performance #using: Compression using efficient multicasting (MA, FTL), pp. 153–162.
STOC-1997-KargerLLPLL #consistency #distributed #protocol #random #web: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.
STOC-1996-AndrewsLMZ #automation #latency #network: Automatic Methods for Hiding Latency in High Bandwidth Networks (MA, FTL, PTM, LZ), pp. 257–265.
STOC-1996-AwerbuchAFL #how #nondeterminism: Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (BA, YA, AF, FTL), pp. 519–530.
STOC-1996-BergerKL #3d #fault: Reconstructing a Three-Dimensional Model with Arbitrary Errors (BB, JMK, FTL), pp. 449–458.
STOC-1995-GhoshLMMPRRTZ #algorithm #analysis: Tight analyses of two local load balancing algorithms (BG, FTL, BMM, SM, CGP, RR, AWR, RET, DZ), pp. 548–558.
STOC-1995-KahaleLMPSS #bound #network #sorting: Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.
STOC-1992-Leighton #parallel: Methods for Message Routing in Parallel Machines (FTL), pp. 77–96.
STOC-1991-LeightonMPSTT #algorithm #approximate #multi #performance #problem: Fast Approximation Algorithms for Multicommodity Flow Problems (FTL, FM, SAP, CS, ÉT, ST), pp. 101–111.
STOC-1990-AggarwalHL #diagrams #problem: Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (AA, MH, FTL), pp. 331–340.
STOC-1990-AroraLM #algorithm #network #online: On-line Algorithms for Path Selection in a Nonblocking Network (SA, FTL, BMM), pp. 149–158.
DAC-1989-BuiHJL #algorithm #graph #performance: Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.
STOC-1989-HastadLN #performance #using: Fast Computation Using Faulty Hypercubes (JH, FTL, MN), pp. 251–263.
STOC-1989-KochLMRR #network: Work-Preserving Emulations of Fixed-Connection Networks (RRK, FTL, BMM, SR, ALR), pp. 227–240.
STOC-1988-BhattCHLR #network #simulation: Optimal Simulations by Butterfly Networks (SNB, FRKC, JWH, FTL, ALR), pp. 192–204.
STOC-1987-HastadLN #configuration management #fault: Reconfiguring a Hypercube in the Presence of Faults (JH, FTL, MN), pp. 274–284.
STOC-1987-HastadLR #analysis #multi #protocol: Analysis of Backoff Protocols for Multiple Access Channels (JH, FTL, BR), pp. 241–253.
STOC-1986-CoffmanL #algorithm #performance: A Provably Efficient Algorithm for Dynamic Storage Allocation (EGCJ, FTL), pp. 77–90.
STOC-1986-LeightonS #algorithm #analysis #bound #grid: Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
STOC-1984-BentleyJLMM #behaviour: Some Unexpected Expected Behavior Results for Bin Packing (JLB, DSJ, FTL, CCM, LAM), pp. 279–288.
STOC-1984-Leighton #bound #complexity #parallel #sorting: Tight Bounds on the Complexity of Parallel Sorting (FTL), pp. 71–80.
STOC-1983-BakerBL #algorithm #approximate: An Approximation Algorithm for Manhattan Routing (BSB, SNB, FTL), pp. 477–486.
STOC-1982-Leighton #layout: A Layout Strategy for VLSI which Is Provably Good (FTL), pp. 85–98.
STOC-1981-KleitmanLLM #graph: New Layouts for the Shuffle-Exchange Graph (DJK, FTL, ML, GLM), pp. 278–292.