Contention Resolution with Heterogeneous Job Sizes Michael A. Bender1 , Jeremy T. Fineman2 , and Seth Gilbert2 1 2

First Page		Document Content
Date: 2007-09-28 06:20:20 Analysis of algorithms Operations research Computational complexity theory Ethernet Exponential backoff Search algorithms Job shop scheduling Binary logarithm Time complexity Theoretical computer science Mathematics Applied mathematics		Contention Resolution with Heterogeneous Job Sizes Michael A. Bender1 , Jeremy T. Fineman2 , and Seth Gilbert2 1 2 Add to Reading List Source URL: www.comp.nus.edu.sg Download Document from Source Website File Size: 219,68 KB Share Document on Facebook

	SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗ DeustoTech, University of Deusto DocID: 1v9SC - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits DocID: 1v8bH - View Document
	J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER Complexity control of HEVC encoders targeting real-time DocID: 1uq0O - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits DocID: 1umuY - View Document
	A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email: DocID: 1uaFl - View Document