First Page | Document Content | |
---|---|---|
Date: 2007-09-28 06:20:20Analysis 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 2Add to Reading ListSource URL: www.comp.nus.edu.sgDownload Document from Source WebsiteFile Size: 219,68 KBShare Document on Facebook |
Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of viewDocID: 1xVR3 - View Document | |
Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗DocID: 1xUAX - View Document | |
Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcsDocID: 1xUr4 - View Document | |
Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingenDocID: 1xTuz - View Document | |
CS 153 Current Topics in Theoretical Computer Science Spring 2016DocID: 1vryF - View Document |