Cake-Cutting Algorithms: befair if you can

By: Jack RobertsonContributor(s): William WebbMaterial type: Text

TextLanguage: English Series: Publication details: Universities Press 2003 Edition: Description: x, 181pISBN: 8173714487 (PB)Subject(s): Algorithms | Cutting stock problem | FairnessDDC classification: 005.1 ROB(CAK)

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Materials specified	Copy number	Status	Date due	Barcode	Item holds
Books	Central Library	005.1 ROB(CAK) (Browse shelf(Opens below))		1	Available		15785

Total holds: 0

Previous								Next
Previous	005.1 PRE(SOF) Software engineering : a practitioner’s approach	005.1 PRO Programming methodology	005.1 RAY(DIS) Distributed algorithms for message-passing systems	005.1 ROB(CAK) Cake-Cutting Algorithms: befair if you can	005.1 ROB(THI) Thinking recursively	005.1 SAM(CLA) Classic data structures	005.1 SCI(DAT) Database design and implementation	Next