Search results for "Tom Leighton"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Frank Thomson Leighton, Ankur Moitra	Extensions and limits to vertex sparsification.	STOC	2010	DBLP DOI BibTeX RDF	oblivious reductions, multicommodity flow
1	Tom Leighton, Ankur Moitra	Some Results on Greedy Embeddings in Metric Spaces.	Discrete & Computational Geometry	2010	DBLP DOI BibTeX RDF
1	Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra	Vertex Sparsifiers and Abstract Rounding Algorithms	CoRR	2010	DBLP BibTeX RDF
1	Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton	Basic network creation games.	SPAA	2010	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
1	Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra	Vertex Sparsifiers and Abstract Rounding Algorithms.	FOCS	2010	DBLP DOI BibTeX RDF
1	Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Hat Guessing Games.	SIAM Review	2009	DBLP DOI BibTeX RDF
1	Tom Leighton	Improving performance on the internet.	Commun. ACM	2009	DBLP DOI BibTeX RDF
1	Tom Leighton	Improving Performance on the Internet.	ACM Queue	2008	DBLP DOI BibTeX RDF	World Wide Web (WWW)
1	Steve Butler, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Hat Guessing Games.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Ankur Moitra, Tom Leighton	Some Results on Greedy Embeddings in Metric Spaces.	FOCS	2008	DBLP DOI BibTeX RDF
1	William Aiello, Frank Thomson Leighton	Hamming Codes, Hypercube Embeddings, and Fault Tolerance.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton	Oblivious routing on node-capacitated and directed graphs.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	node-capacitated graphs, directed graphs, communication networks, Oblivious routing
1	Antonio Fernández, Tom Leighton, José Luis López-Presa	Containment properties of product and power graphs.	Discrete Applied Mathematics	2007	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton	Localized Client-Server Load Balancing without Global Information.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton	Semi-oblivious routing: lower bounds.	SODA	2007	DBLP DOI BibTeX RDF
1	Tom Leighton	The Akamai approach to achieving performance and reliability on the internet.	PODC	2007	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke	New lower bounds for oblivious routing in undirected graphs.	SODA	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton	Improved lower and upper bounds for universal TSP in planar metrics.	SODA	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Tom Leighton	On the max-flow min-cut ratio for directed multicommodity flows.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Semi-oblivious routing.	SPAA	2006	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	The Challenges of Delivering Content and Applications on the Internet.	NSDI	2005	DBLP BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke	Oblivious routing on node-capacitated and directed graphs.	SODA	2005	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton	Online client-server load balancing without global information.	SODA	2005	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke	Oblivious routing in directed graphs with random demands.	STOC	2005	DBLP DOI BibTeX RDF	demand distributions, directed graphs, oblivious routing
1	Frank Thomson Leighton	The Challenges of Delivering Content and Applications on the Internet.	RIDE	2004	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	JACM 1991-1997.	J. ACM	2003	DBLP DOI BibTeX RDF
1	Markus Jakobsson, Frank Thomson Leighton, Silvio Micali, Michael Szydlo	Fractal Merkle Tree Representation and Traversal.	CT-RSA	2003	DBLP DOI BibTeX RDF	authentication, fractal, Merkle tree, Amortization
1	Robert D. Kleinberg, Frank Thomson Leighton	The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions.	FOCS	2003	DBLP DOI BibTeX RDF
1	Robert D. Kleinberg, Frank Thomson Leighton	Consistent load balancing via spread minimization.	STOC	2003	DBLP DOI BibTeX RDF	load balancing, randomized algorithms, on-line algorithms
1	Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton	Guessing Secrets.	Electr. J. Comb.	2001	DBLP BibTeX RDF
1	Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg	Universal-stability results and performance bounds for greedy contention-resolution protocols.	J. ACM	2001	DBLP DOI BibTeX RDF	adversarial queuing theory, packet scheduling, end-to-end delay, network stability
1	Micah Adler, Frank Thomson Leighton	Compression Using Efficient Multicasting.	J. Comput. Syst. Sci.	2001	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Chi-Jen Lu, Satish Rao, Aravind Srinivasan	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.	SIAM J. Comput.	2001	DBLP DOI BibTeX RDF
1	Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton	Guessing secrets.	SODA	2001	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	The Challenges of Delivering Content on the Internet. (PDF / PS)	NCA	2001	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	The Challenges of Delivering Content on the Internet.	WADS	2001	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	The Challenges of Delivering Content on the Internet. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
1	Antonio Fernández, Tom Leighton, José Luis López-Presa	Containment Properties of Product and Power Graphs.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang	General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate).	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
1	Micah Adler, Frank Thomson Leighton	Compression using efficient multicasting.	STOC	2000	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Eric J. Schwabe	Efficient Algorithms for Dynamic Allocation of Distributed Memo.	Algorithmica	1999	DBLP DOI BibTeX RDF	Allocation algorithms, Memory allocation, Parallel and distributed systems, Dynamic allocation
1	Stephen Guattery, Frank Thomson Leighton, Gary L. Miller	The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian.	Combinatorics, Probability & Computing	1999	DBLP BibTeX RDF
1	Frank Thomson Leighton, Satish Rao	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.	J. ACM	1999	DBLP DOI BibTeX RDF	muticommocity flow, routing, approximation algorithms, graph partitioning, divide and conquer, VLSI layout, maximum flow, minimum cut, graph bisection
1	Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton	Reconstructing a Three-Dimensional Model with Arbitrary Errors.	J. ACM	1999	DBLP DOI BibTeX RDF	biomolecular structure, randomized algorithms, random sampling, distance geometry
1	Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa	Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68M20, 68M07, 60C05, 68M10
1	Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu	Tight Bounds for On-Line Tree Embeddings.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang	Automatic Methods for Hiding Latency in Parallel and Distributed Computation.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Yuan Ma	Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman	Tight Analyses of Two Local Load Balancing Algorithms.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Satish Rao, Aravind Srinivasan	New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.	SODA	1999	DBLP DOI BibTeX RDF
1	Jin Suk Kim, Eric Lehman, Frank Thomson Leighton	Oblivious Deadlock-Free Routing in a Faulty Hypercube. (PDF / PS)	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
1	Mor Harchol-Balter, Frank Thomson Leighton, Daniel Lewin	Resource Discovery in Distributed Networks.	PODC	1999	DBLP DOI BibTeX RDF
1	Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton (eds.)	Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA	STOC	1999	DBLP BibTeX RDF
1	Bonnie Berger, Frank Thomson Leighton	Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete.	Journal of Computational Biology	1998	DBLP BibTeX RDF
1	Nabil Kahale, Frank Thomson Leighton	Greedy Dynamic Routing on Arrays.	J. Algorithms	1998	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman	On the Fault Tolerance of Some Popular Bounded-Degree Networks.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Edward G. Coffman Jr., Nabil Kahale, Frank Thomson Leighton	Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, C. Greg Plaxton	Hypercubic Sorting Networks.	SIAM J. Comput.	1998	DBLP DOI BibTeX RDF
1	Bonnie Berger, Frank Thomson Leighton	Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete.	RECOMB	1998	DBLP DOI BibTeX RDF
1	Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg	An Optimal Strategies for Cycle-Stealing in Networks of Workstations.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF
1	Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe	Work-preserving emulations of fixed-connection networks.	J. ACM	1997	DBLP DOI BibTeX RDF	parallel architectures, graph embeddings, processor arrays, network emulations
1	Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon	Secure spread spectrum watermarking for multimedia.	IEEE Transactions on Image Processing	1997	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Yuan Ma, Torsten Suel	On Probabilistic Networks for Selection, Merging, and Sorting.	Theory Comput. Syst.	1997	DBLP DOI BibTeX RDF
1	Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma	On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton	Breaking the Theta (n log² n) Barrier for Sorting with Faults.	J. Comput. Syst. Sci.	1997	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Mark Jerrum, Frank Thomson Leighton, Satish Rao	Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers.	SIAM J. Comput.	1997	DBLP DOI BibTeX RDF
1	Stephen Guattery, Frank Thomson Leighton, Gary L. Miller	The Path Resistance Method for Bounding lambda2 of a Laplacian.	SODA	1997	DBLP DOI BibTeX RDF
1	Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang	General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).	FOCS	1997	DBLP DOI BibTeX RDF	per-packet delay, queue buildup, scheduling, packet-switching, communication networks, dynamic routing, telecommunication networks, performance guarantees, delay bounds, bursty traffic, packet delay, arbitrary topology
1	David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin	Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.	STOC	1997	DBLP DOI BibTeX RDF	Internet
1	Frank Thomson Leighton, Peter W. Shor (eds.)	Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997	STOC	1997	DBLP BibTeX RDF
1	Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg	Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.	J. Parallel Distrib. Comput.	1996	DBLP DOI BibTeX RDF
1	Donald D. Chinn, Frank Thomson Leighton, Martin Tompa	Minimal Adaptive Routing on the Mesh with Bounded Queue Size.	J. Parallel Distrib. Comput.	1996	DBLP DOI BibTeX RDF
1	Sandeep N. Bhatt, Fan R. K. Chung, Jia-Wei Hong, Frank Thomson Leighton, Bojana Obrenic, Arnold L. Rosenberg, Eric J. Schwabe	Optimal Emulations by Butterfly-Like Networks.	J. ACM	1996	DBLP DOI BibTeX RDF	parallel architectures, embeddings, emulations, processor arrays, mapping algorithms, mapping problems
1	Johan Håstad, Frank Thomson Leighton, Brian Rogoff	Analysis of Backoff Protocols for Multiple Access Channels.	SIAM J. Comput.	1996	DBLP DOI BibTeX RDF
1	Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs	On-Line Algorithms for Path Selection in a Nonblocking Network.	SIAM J. Comput.	1996	DBLP DOI BibTeX RDF
1	Ingemar J. Cox, Joe Kilian, Frank Thomson Leighton, Talal Shamoon	A Secure, Robust Watermark for Multimedia.	Information Hiding	1996	DBLP DOI BibTeX RDF
1	Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang	Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).	SPAA	1996	DBLP BibTeX RDF
1	Frank Thomson Leighton	How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty.	ISTCS	1996	DBLP BibTeX RDF
1	Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu	Universal Stability Results for Greedy Contention-Resolution Protocols.	FOCS	1996	DBLP DOI BibTeX RDF	universal stability results, greedy contention-resolution protocols, packet generation, path determination, time-averaged injection rate, commonly-used protocols, n-node ring, distributed randomized greedy protocol, hypercubes, communication networks, FIFO, telecommunication networks, packet delay, adversarial model
1	Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton	Reconstructing a Three-Dimensional Model with Arbitrary Errors.	STOC	1996	DBLP DOI BibTeX RDF
1	Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang	Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).	STOC	1996	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Yossi Azar, Amos Fiat, Frank Thomson Leighton	Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract).	STOC	1996	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Fillia Makedon, Ioannis G. Tollis	A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues.	Algorithmica	1995	DBLP DOI BibTeX RDF
1	Bonnie Berger, Martin L. Brady, Donna J. Brown, Frank Thomson Leighton	Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing.	J. ACM	1995	DBLP DOI BibTeX RDF	multilayer routing, VLSI layout, channel routing
1	Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg	Salvage-Embeddings of Complete Trees.	SIAM J. Discrete Math.	1995	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas	Fast Approximation Algorithms for Multicommodity Flow Problems.	J. Comput. Syst. Sci.	1995	DBLP DOI BibTeX RDF
1	Andrew Chou, Jeremy R. Cooperstock, Ran El-Yaniv, Michael Klugerman, Frank Thomson Leighton	The Statistical Adversary Allows Optimal Money-Making Trading Strategies.	SODA	1995	DBLP DOI BibTeX RDF
1	Nabil Kahale, Frank Thomson Leighton	Greedy Dynamic Routing on Arrays.	SODA	1995	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Bruce M. Maggs	Fast algorithms for finding O(congestion+dilation) packet routing schedules.	HICSS	1995	DBLP DOI BibTeX RDF	packet routing schedules, fixed edge-simple paths, constant-size queues, algorithm parallelization, parallel algorithms, computational complexity, multiprocessor interconnection networks, packet switching, congestion, processor scheduling, telecommunication network routing, fast algorithms, dilation, Lovasz local lemma
1	Frank Thomson Leighton, Yuan Ma, Torsten Suel	On Probabilistic Networks for Selection, Merging, and Sorting.	SPAA	1995	DBLP DOI BibTeX RDF
1	Joe Kilian, Frank Thomson Leighton	Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract).	CRYPTO	1995	DBLP DOI BibTeX RDF
1	Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman	Tight analyses of two local load balancing algorithms.	STOC	1995	DBLP DOI BibTeX RDF
1	Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi	Lower bounds for sorting networks.	STOC	1995	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Allan Borodin (eds.)	Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA	STOC	1995	DBLP BibTeX RDF
1	Frank Thomson Leighton	Methods for Message Routing in Parallel Machines.	Theor. Comput. Sci.	1994	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao	Randomized Routing and Sorting on Fixed-Connection Networks.	J. Algorithms	1994	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton, Bruce M. Maggs, Satish Rao	Packet Routing and Job-Shop Scheduling in O(Congestion + Dilation) Steps.	Combinatorica	1994	DBLP DOI BibTeX RDF
1	Frank Thomson Leighton	A 2d-1 Lower Bound for Two-Layer Knock-Knee Channel Routing.	SIAM J. Discrete Math.	1994	DBLP DOI BibTeX RDF
1	Frederic T. Chong, Eric A. Brewer, Frank Thomson Leighton, Thomas F. Knight Jr.	Packaging and Multiplexing of Hierarchical Scalable Expanders.	PCRCW	1994	DBLP DOI BibTeX RDF
1	Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg	Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.	SPAA	1994	DBLP DOI BibTeX RDF

Publications of Tom Leighton Frank Thomson Leighton ( http://dblp.L3S.de/Authors/Tom_Leighton )